Skip to main content
Springer Nature Link
Log in

Towards Polynomial Approximations of Full Propositional Logic

  • Conference paper
Advances in Artificial Intelligence – SBIA 2004 (SBIA 2004)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3171))

Included in the following conference series:

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

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Cadoli, M., Schaerf, M.: The complexity of entailment in propositional multivalued logics. Annals of Mathematics and Artificial Intelligence 18(1), 29–50 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  2. Carbone, A., Semmes, S.: A Graphic Apology for Symmetry and Implicitness. Mathematical Monographs. Oxford University Press, Oxford (2000)

    MATH  Google Scholar 

  3. Chang, C., Lee, R.: Symbolic Logic and Mechanical Theorem Proving. Academic Press, London (1973)

    MATH  Google Scholar 

  4. Dalal, M.: Anytime families of tractable propositional reasoners. In: International Symposium of Artificial Intelligence and Mathematics AI/MATH-96, pp. 42–45 (1996)

    Google Scholar 

  5. Dalal, M.: Semantics of an anytime family of reasponers. In: 12th European Conference on Artificial Intelligence, pp. 360–364 (1996)

    Google Scholar 

  6. 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)

    Google Scholar 

  7. 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)

    Google Scholar 

  8. Finger, M., Wassermann, R.: Approximate and limited reasoning: Semantics, proof theory, expressivity and control. Journal of Logic And Computation 14(2), 179–204 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  9. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)

    MATH  Google Scholar 

  10. Massacci, F.: Anytime approximate modal reasoning. In: Mostow, J., Rich, C. (eds.) AAAI 1998, pp. 274–279. AAAI Press, Menlo Park (1998)

    Google Scholar 

  11. 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)

    Google Scholar 

  12. McAllester, D.: Truth maintenance. In: Proceedings of the Eighth National Conference on Artificial Intelligence (AAAI 1990), pp. 1109–1116 (1990)

    Google Scholar 

  13. Schaerf, M., Cadoli, M.: Tractable reasoning via approximation. Artificial Intelligence 74(2), 249–310 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  14. Selman, B., Kautz, H.: Knowledge compilation using horn approximations. In: Proceedings AAAI 1991, July 1991, pp. 904–909 (1991)

    Google Scholar 

  15. Selman, B., Kautz, H.: Knowledge compilation and theory approximation. Journal of the ACM 43(2), 193–224 (1996)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departamento de Ciência da Computação, IME-USP,  

    Marcelo Finger

Authors
  1. Marcelo Finger
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Instituto de Informática, UFRGS, Porto Alegre, RS, Brasil

    Ana L. C. Bazzan

  2. Intelligent Systems Laboratory LSI, Center of Technology, Federal University of Maranao UFMA, Bacanga Campus, 65080-040, Sao Luis, MA, Brazil

    Sofiane Labidi

Rights and permissions

Reprints 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

Publish with us

Policies and ethics