Amazon cover image
Image from Amazon.com

Foundations of equational logic programming / Steffen Hölldobler.

By: Material type: TextTextSeries: Lecture notes in computer science ; 353. | Lecture notes in computer science. Lecture notes in artificial intelligence.Publisher: Berlin ; New York : Springer-Verlag, ©1989Description: 1 online resource (x, 250 pages) : illustrationsContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9783540482260
  • 3540482261
Subject(s): Additional physical formats: Print version:: No titleDDC classification:
  • 006.3 20
LOC classification:
  • QA76.63 .H65 1989
Other classification:
  • 54.51
  • *68-02
  • 03B35
  • 28
  • 31.80
  • 54.71
  • 68T15
  • 68T20
Online resources:
Contents:
Preliminaries -- Equational Logic Programming -- Universal Unification -- SLDE-Resolution -- Paramodulation -- Universal Unification by Complete Sets of Transformations -- Lazy Resolution and Complete Sets of Inference Rules for Horn Equational Theories -- Conclusion.
Action note:
  • digitized 2010 HathiTrust Digital Library committed to preserve
Summary: Equations play a vital role in many fields of mathematics, computer science, and artificial intelligence. Therefore, many proposals have been made to integrate equational, functional, and logic programming. This book presents the foundations of equational logic programming. After generalizing logic programming by augmenting programs with a conditional equational theory, the author defines a unifying framework for logic programming, equation solving, universal unification, and term rewriting. Within this framework many known results are developed. In particular, a presentation of the least model and the fixpoint semantics of equational logic programs is followed by a rigorous proof of the soundness and the strong completeness of various proof techniques: SLDE-resolution, where a universal unification procedure replaces the traditional unification algorithm; linear paramodulation and special forms of it such as rewriting and narrowing; complete sets of transformations for conditional equational theories; and lazy resolution combined with any complete set of inference rules for conditional equational theories.
Holdings
Item type Current library Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library eBook LNCS Available
Total holds: 0

Includes bibliographical references (pages 231-241).

Use copy Restrictions unspecified star MiAaHDL

Electronic reproduction. [Place of publication not identified] : HathiTrust Digital Library, 2010. MiAaHDL

Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002. MiAaHDL

http://purl.oclc.org/DLF/benchrepro0212

digitized 2010 HathiTrust Digital Library committed to preserve pda MiAaHDL

Equations play a vital role in many fields of mathematics, computer science, and artificial intelligence. Therefore, many proposals have been made to integrate equational, functional, and logic programming. This book presents the foundations of equational logic programming. After generalizing logic programming by augmenting programs with a conditional equational theory, the author defines a unifying framework for logic programming, equation solving, universal unification, and term rewriting. Within this framework many known results are developed. In particular, a presentation of the least model and the fixpoint semantics of equational logic programs is followed by a rigorous proof of the soundness and the strong completeness of various proof techniques: SLDE-resolution, where a universal unification procedure replaces the traditional unification algorithm; linear paramodulation and special forms of it such as rewriting and narrowing; complete sets of transformations for conditional equational theories; and lazy resolution combined with any complete set of inference rules for conditional equational theories.

Print version record.

Preliminaries -- Equational Logic Programming -- Universal Unification -- SLDE-Resolution -- Paramodulation -- Universal Unification by Complete Sets of Transformations -- Lazy Resolution and Complete Sets of Inference Rules for Horn Equational Theories -- Conclusion.

Powered by Koha