Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Cadoli, M., Schaerf, M.: The complexity of entailment in propositional multivalued logics. Annals of Mathematics and Artificial Intelligence 18(1), 29–50 (1996)
Carbone, A., Semmes, S.: A Graphic Apology for Symmetry and Implicitness. Mathematical Monographs. Oxford University Press, Oxford (2000)
Chang, C., Lee, R.: Symbolic Logic and Mechanical Theorem Proving. Academic Press, London (1973)
Dalal, M.: Anytime families of tractable propositional reasoners. In: International Symposium of Artificial Intelligence and Mathematics AI/MATH-96, pp. 42–45 (1996)
Dalal, M.: Semantics of an anytime family of reasponers. In: 12th European Conference on Artificial Intelligence, pp. 360–364 (1996)
Finger, M., Wassermann, R.: Expressivity and control in limited reasoning. In: van Harmelen, F. (ed.) 5th European Conference on Artificial Intelligence (ECAI 2002), Lyon, France, pp. 272–276. IOS Press, Amsterdam (2002)
Finger, M., Wassermann, R.: The universe of approximations. In: de Queiroz, R., Pimentel, E., Figueiredo, L. (eds.) Electronic Notes in Theoretical Computer Science, vol. 84, pp. 1–14. Elsevier, Amsterdam (2003)
Finger, M., Wassermann, R.: Approximate and limited reasoning: Semantics, proof theory, expressivity and control. Journal of Logic And Computation 14(2), 179–204 (2004)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)
Massacci, F.: Anytime approximate modal reasoning. In: Mostow, J., Rich, C. (eds.) AAAI 1998, pp. 274–279. AAAI Press, Menlo Park (1998)
Massacci, F.: Efficient Approximate Deduction and an Application to Computer Security. PhD thesis, Dottorato in Ingegneria Informatica, Università di Roma I “La Sapienza”, Dipartimento di Informatica e Sistemistica (June 1998)
McAllester, D.: Truth maintenance. In: Proceedings of the Eighth National Conference on Artificial Intelligence (AAAI 1990), pp. 1109–1116 (1990)
Schaerf, M., Cadoli, M.: Tractable reasoning via approximation. Artificial Intelligence 74(2), 249–310 (1995)
Selman, B., Kautz, H.: Knowledge compilation using horn approximations. In: Proceedings AAAI 1991, July 1991, pp. 904–909 (1991)
Selman, B., Kautz, H.: Knowledge compilation and theory approximation. Journal of the ACM 43(2), 193–224 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Finger, M. (2004). Towards Polynomial Approximations of Full Propositional Logic. In: Bazzan, A.L.C., Labidi, S. (eds) Advances in Artificial Intelligence – SBIA 2004. SBIA 2004. Lecture Notes in Computer Science(), vol 3171. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28645-5_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-28645-5_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23237-7
Online ISBN: 978-3-540-28645-5
eBook Packages: Springer Book Archive