Towards Polynomial Approximations of Full Propositional Logic

The aim of this paper is to study a family of logics that approximates classical inference, in which every step in the approximation can be decided in polynomial time. For clausal logic, this task has been shown to be possible by Dalal [4,5]. However, Dalal’s approach cannot be applied to full classical logic. In this paper we provide a family of logics, called Limited Bivaluation Logics, via a semantic approach to approximation that applies to full classical logic. Two approximation families are built on it. One is parametric and can be used in a depth-first approximation of classical logic. The other follows Dalal’s spirit, and with a different technique we show that it performs at least as well as Dalal’s polynomial approach over clausal logic.

[1]  Richard C. T. Lee,et al.  Symbolic logic and mechanical theorem proving , 1973, Computer science classics.

[2]  S. Semmes,et al.  A Graphic Apology for Symmetry and Implicitness , 2000 .

[3]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[4]  Mukesh Dalal,et al.  Semantics of an Anytime Family of Reasoners , 1996, ECAI.

[5]  David A. McAllester.  Truth Maintenance , 1990, AAAI.

[6]  Bart Selman,et al.  Knowledge compilation and theory approximation , 1996, JACM.

[7]  Bart Selman,et al.  Knowledge Compilation using Horn Approximations , 1991, AAAI.

[8]  Marcelo Finger,et al.  The Universe of Approximations , 2003, Electron. Notes Theor. Comput. Sci..

[9]  Mukesh Dalal.  Anytime Families of Tractable Propositional Reasoners Introduction , .

[10]  Alan Bundy,et al.  Constructing Induction Rules for Deductive Synthesis Proofs , 2006, CLASE.

[11]  Marcelo Finger,et al.  Expressivity and Control in Limited Reasoning , 2002, ECAI.

[12]  Fabio Massacci.  Anytime Approximate Modal Reasoning , 1998, AAAI/IAAI.

[13]  Marcelo Finger,et al.  Approximate and Limited Reasoning: Semantics, Proof Theory, Expressivity and Control , 2004, J. Log. Comput..

[14]  Fabio Massacci,et al.  Anytime approximate model reasoning , 1998, AAAI 1998.

[15]  Marco Schaerf,et al.  Tractable Reasoning via Approximation , 1995, Artif. Intell..

[16]  Marco Schaerf,et al.  On the complexity of entailment in propositional multivalued logics , 1996, Annals of Mathematics and Artificial Intelligence.