Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A Guided Tour of Artificial Intelligence ResearchReasoning with Propositional Logic: From SAT Solvers to Knowledge Compilation

A Guided Tour of Artificial Intelligence Research: Reasoning with Propositional Logic: From SAT... [The Propositional Logic playsPropositional Logic a central role in Artificial Intelligence. Extremely simple, this logic already addresses some of the most important problems in computer theory. It allows an incredible panel of pragmatic solutions to be successfully applied on a large number of (theoretically) hard problems. Its apparent simplicity allows one to design very efficient and compactSimon, Laurent algorithms to tackle, in practice, problems lying at the first levels of the complexity classes. In this chapter, we first present the kind of A.I. problems that can typically be addressed by this formalism. Then, we present an historical view of the impressive progresses observed in the practical solving of the Satisfiability (SAT) problem. Then, we introduce the concept of Knowledge Compilation,Knowledge compilation another important field of A.I. often build upon Propositional Logic. We also introduce Quantified Boolean Formula (QBF), Quantified boolean formula a natural extension of SAT to quantifiers.] http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

A Guided Tour of Artificial Intelligence ResearchReasoning with Propositional Logic: From SAT Solvers to Knowledge Compilation

Editors: Marquis, Pierre; Papini, Odile; Prade, Henri

Loading next page...
 
/lp/springer-journals/a-guided-tour-of-artificial-intelligence-research-reasoning-with-HY2tGrIcUk

References (138)

Publisher
Springer International Publishing
Copyright
© Springer Nature Switzerland AG 2020
ISBN
978-3-030-06166-1
Pages
115 –152
DOI
10.1007/978-3-030-06167-8_5
Publisher site
See Chapter on Publisher Site

Abstract

[The Propositional Logic playsPropositional Logic a central role in Artificial Intelligence. Extremely simple, this logic already addresses some of the most important problems in computer theory. It allows an incredible panel of pragmatic solutions to be successfully applied on a large number of (theoretically) hard problems. Its apparent simplicity allows one to design very efficient and compactSimon, Laurent algorithms to tackle, in practice, problems lying at the first levels of the complexity classes. In this chapter, we first present the kind of A.I. problems that can typically be addressed by this formalism. Then, we present an historical view of the impressive progresses observed in the practical solving of the Satisfiability (SAT) problem. Then, we introduce the concept of Knowledge Compilation,Knowledge compilation another important field of A.I. often build upon Propositional Logic. We also introduce Quantified Boolean Formula (QBF), Quantified boolean formula a natural extension of SAT to quantifiers.]

Published: May 8, 2020

There are no references for this article.