ShopSpell

Tractable Reasoning in Aritificial Intelligence [Paperback]

$42.99     $54.99    22% Off      (Free Shipping)
100 available
  • Category: Books (Computers)
  • Author:  Cadoli, Marco
  • Author:  Cadoli, Marco
  • ISBN-10:  3540600582
  • ISBN-10:  3540600582
  • ISBN-13:  9783540600589
  • ISBN-13:  9783540600589
  • Publisher:  Springer
  • Publisher:  Springer
  • Binding:  Paperback
  • Binding:  Paperback
  • Pub Date:  01-Feb-1995
  • Pub Date:  01-Feb-1995
  • SKU:  3540600582-11-SPRI
  • SKU:  3540600582-11-SPRI
  • Item ID: 100928443
  • List Price: $54.99
  • Seller: ShopSpell
  • Ships in: 5 business days
  • Transit time: Up to 5 business days
  • Delivery by: Jul 03 to Jul 05
  • Notes: Brand New Book. Order Now.
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 forLogic 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 forLanguage restriction: Complexity of minimal reasoning.- Approximation of a logical theory.- Using complexity results for evaluating approximation techniques.- Conclusion.Springer Book ArchivesDE
Add Review