000 03215nam a22005055i 4500
001 978-3-540-48226-0
003 DE-He213
005 20160624102031.0
007 cr nn 008mamaa
008 121227s1989 gw | s |||| 0|eng d
020 _a9783540482260
_9978-3-540-48226-0
024 7 _a10.1007/BFb0015791
_2doi
050 4 _aQ334-342
050 4 _aTJ210.2-211.495
072 7 _aUYQ
_2bicssc
072 7 _aTJFM1
_2bicssc
072 7 _aCOM004000
_2bisacsh
082 0 4 _a006.3
_223
245 1 0 _aFoundations of Equational Logic Programming
_h[electronic resource] /
_cedited by Steffen Hölldobler.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1989.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1989.
300 _aXII, 256 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science, Lecture Notes in Artificial Intelligence,
_x0302-9743 ;
_v353
505 0 _aPreliminaries -- 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.
520 _aEquations 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.
650 0 _aComputer science.
650 0 _aArtificial intelligence.
650 1 4 _aComputer Science.
650 2 4 _aArtificial Intelligence (incl. Robotics).
650 2 4 _aMathematical Logic and Formal Languages.
650 2 4 _aProgramming Languages, Compilers, Interpreters.
700 1 _aHölldobler, Steffen.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540515333
786 _dSpringer
830 0 _aLecture Notes in Computer Science, Lecture Notes in Artificial Intelligence,
_x0302-9743 ;
_v353
856 4 0 _uhttp://dx.doi.org/10.1007/BFb0015791
942 _2EBK6374
_cEBK
999 _c35668
_d35668