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

Bibliographic Information

Book Title: Tractable Reasoning in Aritificial Intelligence
Authors: Marco Cadoli
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/3-540-60058-2
Publisher: Springer Berlin, Heidelberg
eBook Packages: Springer Book Archive
Copyright Information: Springer-Verlag Berlin Heidelberg 1995
Softcover ISBN: 978-3-540-60058-9Published: 18 July 1995
eBook ISBN: 978-3-540-49422-5Published: 04 July 2005
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: X, 286
Topics: Artificial Intelligence, Mathematical Logic and Formal Languages, Computation by Abstract Devices

Publish with us

Policies and ethics

Tractable Reasoning in Aritificial Intelligence

Overview

Access this book

Other ways to access

Table of contents (5 chapters)

Front Matter

Introduction

Language restriction: Complexity of minimal reasoning

Approximation of a logical theory

Using complexity results for evaluating approximation techniques

Conclusion

Back Matter

Keywords

About this book

Bibliographic Information

Publish with us

Search

Navigation