Skip to main content
SpringerLink
Log in

The computational value of joint consistency

Extended abstract

  • Conference paper
  • First Online:
Logics in Artificial Intelligence (JELIA 1994)

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

Included in the following conference series:

Abstract

In this paper we investigate the complexity of some recent reconstructions of Reiter's Default Logic using graph-theoretical structures. It turns out that requiring joint consistency of the justification of the applied rules has serious effects on the computational features of default reasoning. Namely, many of the intractability problems of Reiter's original approach, in some cases disappear in the new frameworks. However, interesting problems remain intractable. We also present a propositional semantics for those approaches, stemming from the translation of the graph structures into propositional logic. Finally, the constraint stable model semantics is introduced, and proved to be related to the notion of joint consistency.

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.

References

  1. R. Ben-Eliyahu and R. Dechter. Default logic, propositional logic and constraints. In Proc. of AAAI-91, pages 379–385, 1991.

    Google Scholar 

  2. R. Ben-Eliyahu and R. Dechter. Propositional semantics for default logic. In Fourth International Workshop on Nonmonotonic Reasoning, pages 13–27. Plymouth, VT, 1992.

    Google Scholar 

  3. G. Brewka. Cumulative default logic: in defence of nonmonotonic inference rules. AI Journal, 50:183–205, 1991.

    Google Scholar 

  4. J. Delgrande and W. Jackson. Default logic revisited. In J. Allen, R. Fikes, and E. Sandewall, editors, Proc. of the Second Int. Conf. on Principles of Knowledge Representation and Reasoning, pages 118–127. Morgan Kaufmann, 1991.

    Google Scholar 

  5. Y. Dimopoulos and V. Magirou. A graph-theoretic approach to default logic. To appear in Information and Computation, 1994.

    Google Scholar 

  6. Y. Dimopoulos, V. Magirou, and C. Papadimitriou. On kernels, defaults and even graphs. Technical Report MPI-I-93-226, Max-Planck-Institut für Informatik, 1993.

    Google Scholar 

  7. Y. Dimopoulos and A. Torres. Graph-theoretic structures in logic programs and default theories. Technical Report MPI-93-264, Max-Planck-Insitut für Informatik, 1993.

    Google Scholar 

  8. M. R. Garey and D. S. Johnson. Computers and intractability: A guide to the theory of NP-completeness. W. H. Freeman and Company, New York, 1979.

    Google Scholar 

  9. M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In Proc. Fifth International Conference and Symposium on Logic Programming, pages 1070–1080, Cambridge, Mass., 1988. MIT Press.

    Google Scholar 

  10. G. Gottlob and Z. Mingyi. Cumulative Default Logic: Finite Characterization, Algorithms, and Complexity. Draft paper, 1993.

    Google Scholar 

  11. D. Johnson, C. Papadimitriou, and M. Yannakakis. On generating all maximal independent sets. Information Processing Letters, 27(3):119–123, 1988.

    Google Scholar 

  12. H. Kautz and B. Selman. Hard problems for simple default theories. AI Journal, 49, 1991.

    Google Scholar 

  13. W. Lukaszewicz. Considerations on default logic — an alternative approach. Computational Intelligence, 4:1–16, 1988.

    Google Scholar 

  14. C. Papadimitriou and M. Sideri. On finding extensions of default theories. In J. Biskup and H. Hull, editors, Proc. Fourth International Conference on Database Theory, Berlin, Germany, 1992. Springer Verlag. LNCS, 646.

    Google Scholar 

  15. C. Papadimitriou and M. Yannakakis. Tie-breaking semantics and structural totality. In Proceedings Eleventh Symposium on Principles of Database Systems, pages 16–22, 1992.

    Google Scholar 

  16. R. Reiter. A logic for default reasoning. AI Journal, 13:81–132, 1980.

    Google Scholar 

  17. T. Schaub. On commitment and cumulativity in default logics. In R. Kruse, editor, European Conference on Symbolic and Quantitative Approaches to Uncertainty, pages 304–309. Springer Verlag, 1991.

    Google Scholar 

  18. S. Tsukiyama, M. Ide, H. Ariyoshi, and I. Shirakawa. A new algorithm for generating all maximal independent sets. SIAM J. Comput., 6(3):505–517, 1977.

    Google Scholar 

  19. A. Torres. The Hypothetical Semantics of Logic Programs. PhD thesis, Stanford University, February 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Max-Planck-Institut für Informatik, Im Stadtwald, 66123, Saarbrücken, Germany

    Yannis Dimopoulos

Authors
  1. Yannis Dimopoulos
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Craig MacNish David Pearce Luís Moniz Pereira

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dimopoulos, Y. (1994). The computational value of joint consistency. In: MacNish, C., Pearce, D., Pereira, L.M. (eds) Logics in Artificial Intelligence. JELIA 1994. Lecture Notes in Computer Science, vol 838. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0021964

Download citation

  • DOI: https://doi.org/10.1007/BFb0021964

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58332-5

  • Online ISBN: 978-3-540-48657-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation