Tractable Reasoning in Artificial Intelligence

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

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

Author(s): Marco Cadoli (auth.)
Series: Lecture Notes in Computer Science 941 : Lecture Notes in Artificial Intelligence
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1995

Language: English
Pages: 286
City: Berlin; New York
Tags: Artificial Intelligence (incl. Robotics); Mathematical Logic and Formal Languages; Computation by Abstract Devices

Introduction....Pages 1-26
Language restriction: Complexity of minimal reasoning....Pages 27-65
Approximation of a logical theory....Pages 67-121
Using complexity results for evaluating approximation techniques....Pages 123-132
Conclusion....Pages 133-139