Skip to main content
Springer Nature Link
Log in

Approximation of Relations by Propositional Formulas: Complexity and Semantics

  • Conference paper
  • First Online:
Abstraction, Reformulation, and Approximation (SARA 2002)

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

Abstract

Selman and Kautz introduced the notion of approximation of a theory and showed its usefulness for knowledge compilation and on-line reasoning. We study here the complexity of the main computational problems related to the approximation of relations (sets of possible worlds) by propositional formulas, and the semantics of reasoning with these approximations (deduction and abduction). The classes of formulas that we consider are those of (reverse-)Horn, bijunctive and affine formulas, which are the most interesting for storing knowledge.

Concerning the computation of approximations, we survey and complete the results that can be found in the literature, trying to adopt a unified point of view. On the contrary, as far as we know this paper is the first real attempt to study the semantics of abduction with the bounds of a theory.

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. Boufkhad, Y., Algorithms for propositional KB approximation, in: Proc. 15th National Conference on Artificial Intelligence (AAAI’98) (Madison, USA), Minlo Park: AAAI Press / MIT Press (1998) 280–285

    Google Scholar 

  2. Cadoli, M. and Scarcello, F., Semantical and computational aspects of Horn approximations, Artificial Intelligence 119(1-2) (2000) 1–17

    Article  MATH  MathSciNet  Google Scholar 

  3. Curtis, C.W., Linear algebra. An introductory approach, Springer-Verlag (1984)

    Google Scholar 

  4. Dechter, R. and Pearl, J., Structure identification in relational data, Artificial Intelligence 58 (1992) 237–270

    Article  MATH  MathSciNet  Google Scholar 

  5. Eiter, T. and Gottlob, G., The complexity of logic-based abduction, Journal of the ACM 42(1) (1995) 3–42

    Article  MATH  MathSciNet  Google Scholar 

  6. Garey, M.R. and Johnson, D.S., Computers and intractability: a guide to the theory of NP-completeness, San Francisco: W.H. Freeman and Company (1983)

    Google Scholar 

  7. Johnson, D.S., Yannakakis, M. and Papadimitriou, C.H., On generating all maximal independent sets, Inform. Process. Lett. 27(3) (1988) 119–123

    Article  MATH  MathSciNet  Google Scholar 

  8. Kautz, H., Kearns, M. and Selman, B., Horn approximations of empirical data, Artificial Intelligence 74 (1995) 129–145

    Article  MATH  MathSciNet  Google Scholar 

  9. Kavvadias, D., Papadimitriou, C.H. and Sideri, M., On Horn envelopes and hypergraph transversals (extended abstract), in: Proc. 4th International Symposium on Algorithms And Computation (ISAAC’93) (Honk Kong), Berlin: Springer Lecture Notes in Computer Science 762 (1993) 399–405

    Google Scholar 

  10. Kavvadias, D. and Sideri, M., The inverse satisfiability problem, SIAM J. Comput. 28(1) (1998) 152–163

    Article  MATH  MathSciNet  Google Scholar 

  11. Kavvadias, D.J., Sideri, M. and Stavropoulos, E.C., Generating all maximal models of a Boolean expression, Inform. Process. Lett. 74 (2000) 157–162

    Article  MathSciNet  Google Scholar 

  12. Khardon, R., Translating between Horn representations and their characteristic models, Journal of Artificial Intelligence Research 3 (1995) 349–372

    MATH  Google Scholar 

  13. Khardon, R. and Roth, D., Reasoning with models, Artificial Intelligence 87 (1996) 187–213

    Article  MathSciNet  Google Scholar 

  14. Reiter, R. and de Kleer, J., Foundations of assumption-based truth maintenance systems: preliminary report, in: Proc. 6th National Conefrence on Artificial Intelligence (AAAI’87) (Seattle, USA), Menlo Park: AAAI Press / MIT Press (1987) 183–188

    Google Scholar 

  15. Schaefer, T.J., The complexity of satisfiability problems, in: Proc. 10th Annual ACM Symposium on Theory Of Computing (STOC’78) (San Diego, USA), New York: ACM Press (1978) 216–226

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  17. Stearns, R.E. and Hunt III, H.B., Power indices and easier hard problems, Math. Systems Theory 23 (1990) 209–225

    Article  MATH  MathSciNet  Google Scholar 

  18. del Val, A., An analysis of approximate knowledge compilation, in: Proc. 14th International Joint Conference on Artificial Intelligence (IJCAI’95) (Montéal, Canada), San Francisco: Morgan Kaufmann (1995) 830–836

    Google Scholar 

  19. del Val, A., The complexity of restricted consequence finding and abduction, in: Proc. 17th National Conference on Artificial Intelligence (AAAI’00) (Austin, Texas), AAAI Press / MIT Press (2000) 337–342

    Google Scholar 

  20. Zanuttini, B. and Hébrard, J.-J., A unified framework for structure identification, Information Processing Letters 81 (2002) 335–339

    Article  MathSciNet  Google Scholar 

  21. Zanuttini, B., Approximating propositional knowledge with affine formulas, to appear in: Proc. 15th European Conference on Artificial Intelligence (ECAI’02) (Lyon, France), (2002)

    Google Scholar 

  22. Zanuttini, B., Des classes polynomiales pour l’abduction en logique propo-sitionnelle (in French), Proc. 8èmes Journées nationales sur la résolution de problèmes NP-Complets (JNPC’02) (Nice, France), available from the author (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. GREYC, Université de Caen, bd. Mal Juin, F-14032, Caen Cedex, France

    Bruno Zanuttini

Authors
  1. Bruno Zanuttini
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. College of Computing, Georgia Institute of Technology, 801 Atlantic Dr NW, Atlanta, GA, 30332-0280, USA

    Sven Koenig

  2. Department of Computing Science, Universtity of Alberta, 2-21 Athabasca Hall, Edmonton, Alberta, T6G 2E8, Canada

    Robert C. Holte

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zanuttini, B. (2002). Approximation of Relations by Propositional Formulas: Complexity and Semantics. In: Koenig, S., Holte, R.C. (eds) Abstraction, Reformulation, and Approximation. SARA 2002. Lecture Notes in Computer Science(), vol 2371. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45622-8_18

Download citation

  • DOI: https://doi.org/10.1007/3-540-45622-8_18

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43941-7

  • Online ISBN: 978-3-540-45622-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics