1. Introduction -- 2. Language restriction: Complexity of minimal reasoning -- 3. Approximation of a logical theory -- 4. Using complexity results for evaluating approximation techniques -- 5. Conclusions -- A Appendix to Chapter 2 -- B Appendix to Chapter 3 -- C Appendix to Chapter 4
Summary
Logic is one of the most popular approaches to artificial intelligence. A potential obstacle to the use of logic is its high computational complexity, as logical inference is an extraordinarily powerful computational device. This book is concerned with computational aspects of the logical approach to AI. The focus is on two strategies for achieving computational tractability in knowledge representation and reasoning by language restriction and approximation. Several formalisms for knowledge representation are taken into account; among the computational problems studied are checking satisfiability and entailment of formulae, finding a model, and approximating and compiling a logical for
Bibliography
Includes bibliographical references (pages 227-239) and index
Notes
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. http://purl.oclc.org/DLF/benchrepro0212 MiAaHDL
digitized 2010 HathiTrust Digital Library committed to preserve pda MiAaHDL
