Tractable Reasoning in Aritificial Intelligence / Najlacnejšie knihy
Tractable Reasoning in Aritificial Intelligence

Code: 01565984

Tractable Reasoning in Aritificial Intelligence

by Marco Cadoli

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 b ... more

51.53

RRP: 55.80 €

You save 4.27 €


In stock at our supplier
Shipping in 5 - 8 days
Add to wishlist

You might also like

Give this book as a present today
  1. Order book and choose Gift Order.
  2. We will send you book gift voucher at once. You can give it out to anyone.
  3. Book will be send to donee, nothing more to care about.

Book gift voucher sampleRead more

More about Tractable Reasoning in Aritificial Intelligence

You get 125 loyalty points

Book synopsis

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

Book details

Book category Books in English Computing & information technology Computer science Artificial intelligence

51.53

Trending among others



Collection points Bratislava a 12799 dalších

Copyright ©2008-26 najlacnejsie-knihy.sk All rights reservedPrivacyCookies


Account: Log in
Všetky knihy sveta na jednom mieste. Navyše za skvelé ceny.

Shopping cart ( Empty )

For free shipping
shop for 59,99 € and more

You are here: