---

＜電子ブック＞
Tractable Reasoning in Aritificial Intelligence / by Marco Cadoli
(Lecture Notes in Artificial Intelligence. ISSN:29459141 ; 941)

版	1st ed. 1995.
出版者	(Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer)
出版年	1995
本文言語	英語
大きさ	X, 286 p : online resource
著者標目	*Cadoli, Marco author SpringerLink (Online service)
件　名	LCSH:Artificial intelligence LCSH:Machine theory LCSH:Computer science FREE:Artificial Intelligence FREE:Formal Languages and Automata Theory FREE:Theory of Computation
一般注記	Language restriction: Complexity of minimal reasoning -- Approximation of a logical theory -- Using complexity results for evaluating approximation techniques -- Conclusion 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 HTTP:URL=https://doi.org/10.1007/3-540-60058-2

 類似資料