论文信息 - Polynomial Approximations of Full Propositional Logic via Limited Bivalence

Polynomial Approximations of Full Propositional Logic via Limited Bivalence

The aim of this paper is to study an anytime 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 [Dal96a,Dal96b]. However, Dalal’s approach cannot be applied to full classical logic.

Marcelo Finger

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

[2] R. Smullyan. First-Order Logic , 1968 .

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

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

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

[6] Marcelo Finger. Towards Polynomial Approximations of Full Propositional Logic , 2004, SBIA.

[7] Marcello D'Agostino,et al. Tableau Methods for Classical Propositional Logic , 1999 .

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

[9] D. Gabbay,et al. Handbook of tableau methods , 1999 .

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

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

[12] Marcello D'Agostino,et al. The Taming of the Cut. Classical Refutations with Analytic Cut , 1994, J. Log. Comput..

[13] Marcello D'Agostino,et al. Are tableaux an improvement on truth-tables? , 1992, J. Log. Lang. Inf..

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

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