Cambridge, Mass. : MIT Press, 1994. Hardcover. 228 pp. - This 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. Condition : as new copy. ISBN 9780262041423. Keywords : COMPUTER STUDIES, Logic programming.

Seller Inventory # 287754

Contact seller

Report this item

Bibliographic Details

Title: From logic to logic programming.
Publisher: Mit Pr
Publication Date: 1994
Language: English
ISBN 10: 0262041421
ISBN 13: 9780262041423
Binding: Soft cover
Condition: as new

About this title

Synopsis

This 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.

About the Author

Kees Doets is University Lecturer, Faculty of Mathematics and Computer Science, University of Amsterdam.

"About this title" may belong to another edition of this title.

Store Description

In business since 1923 we are specialized in law, philosophy and other scholarly books from the 16th - 20th century. We also carry a general stock and we have permanently in stock ca. 60.000 titles. Visit only by appointment. Member of ILAB and the NVVA, the Dutch Antiquarian Booksellers Association.

Visit Seller's Storefront

Association Member

Members of these associations are committed to maintaining the highest standards. They vouch for the authenticity of all items offered for sale. They provide expert and detailed descriptions, disclose all significant defects and/or restorations, provide clear and accurate pricing, and operate with fairness and honesty during the purchase experience.

Seller's business information

Kloof Booksellers & Scientia Verlag
Netherlands

Sale & Shipping Terms

Terms of Sale

Condition of the books is VG or better, unless otherwise stated. Books are subject to prior sale. Orders usually ship within 2-3 business days. Shipping of books outside the EU, or to commercial and institutional addresses in the EU is at buyers cost & risk. Airmail & insurance rates on request. No discounts possible on orders through Abebooks. The displayed shipping costs are based on books weighing 2.2 LB, or 1 KG. All disputes which may arise are subject to Dutch law. In such a case Amsterdam...

More Information

Shipping Terms

Orders usually ship within 2-3 business days. Shipping of books outside the EU, or to commercial and institional addresses in the EU is at buyers cost & risk.. Airmail & insurance rates on request. The displayed shipping costs are based on books weighing 2.2 LB, or 1 KG. If your book order is heavy or oversized, we may contact you to let you know extra shipping is required.

Shipping rates from Netherlands to U.S.A.

Shipping rates from Netherlands to U.S.A.
Order quantity	14 to 60 business days	7 to 15 business days
First item	US$ 35.24	US$ 76.34

Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.