000			03052nam a2200493 i 4500
001			6267470
003			IEEE
005			20220712204715.0
006			m o d
007			cr |n|||||||||
008			151223s1994 maua ob 001 eng d
010			_z 93006196 (print)
020			_a9780262288477 _qelectronic
020			_z9780262041423 _qprint
020			_a0262041421
035			_a(CaBNVSL)mat06267470
035			_a(IDAMS)0b000064818b44aa
040			_aCaBNVSL _beng _erda _cCaBNVSL _dCaBNVSL
050		4	_aQA76.63 _b.D64 1994eb
082	0	0	_a005.1 _220
100	1		_aDoets, Kees, _eauthor. _922971
245	1	0	_aFrom logic to logic programming / _cKees Doets.
264		1	_aCambridge, Massachusetts : _bMIT Press, _cc1994.
264		2	_a[Piscataqay, New Jersey] : _bIEEE Xplore, _c[1994]
300			_a1 PDF (xii, 214 pages) : _billustrations.
336			_atext _2rdacontent
337			_aelectronic _2isbdmedia
338			_aonline resource _2rdacarrier
490	1		_aFoundations of computing
504			_aIncludes bibliographical references (p. [197]-199) and index.
506	1		_aRestricted to subscribers or individual electronic text purchasers.
520			_aThis mathematically oriented introduction to the theory of logic programming presents a systematic exposition of the resolution method for propositional, first-order, and Horn- clause logics, together with an analysis of the semantic aspects of the method. It is through the inference rule of resolution that both proofs and computations can be manipulated on computers, and this book contains elegant versions and proofs of the fundamental theorems and lemmas in the proof theory of logic programming. Advanced topics such as recursive complexity and negation as failure and its semantics are covered, and streamlined setups for SLD- and SLDNF-resolution are described.No other book treats this material in such detail and with such sophistication. Doets provides a novel approach to resolution that is applied to the first-order case and the case of (positive) logic programs. In contrast to the usual approach, the concept of a resolvent is defined nonconstructively, without recourse to the concept of unification, allowing the soundness and completeness proofs to be carried out in a more economic way. Other new material includes computability results dealing with analytical hierarchy, results on infinite derivations and an exposition on general logic programs using 3-valued logic.
530			_aAlso available in print.
538			_aMode of access: World Wide Web
588			_aDescription based on PDF viewed 12/23/2015.
650		0	_aLogic programming. _92730
655		0	_aElectronic books. _93294
710	2		_aIEEE Xplore (Online Service), _edistributor. _922972
710	2		_aMIT Press, _epublisher. _922973
776	0	8	_iPrint version _z9780262041423
830		0	_aFoundations of computing _922604
856	4	2	_3Abstract with links to resource _uhttps://ieeexplore.ieee.org/xpl/bkabstractplus.jsp?bkn=6267470
942			_cEBK
999			_c73124 _d73124