Skip to main content

On finding extensions of default theories

  • Conference paper
  • First Online:
Database Theory — ICDT '92 (ICDT 1992)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 646))

Included in the following conference series:

  • 133 Accesses

Abstract

We study from the computational standpoint the problem of finding an extension of a given default theory, and extend previous results in three directions. We show that all default theories that have no odd cycles (in some precise sense) have an extension, which can he found efficiently. We prove that it is NP-complete to find extensions even for default theories with no prerequisites and at most two literals per default. We also characterize precisely the complexity of finding extensions in general default theories: The problem is P2 -complete.

Research partially performed while the authors visited the Laboratiore de Réchérche en Informatique at the Université de Paris Sud, and supported by the ESPRIT Project ALCOM and the National Science Foundation.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

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. N. Bidoit, C. Froidevaux “General Logical Data-bases and Programs: Default ogic Semantics and Stratification,” Information and Computation, 91, 1, pp. 15–54, 1991.

    Google Scholar 

  2. Y. Dimopoulos and V. Magirou “A Graph Theoretic Approach to Default Logic,” to appear in Information and Computation, June 1991.

    Google Scholar 

  3. D. R. Etherington “Formalizing Non-monotonic Reasoning Systems,” Artificial Intelligence, 31, 1987.

    Google Scholar 

  4. Georg Gottlob “Complexity Results in Non-monotonic Logics,” CD-TR 91/24, T. U. Wien, August 1991.

    Google Scholar 

  5. P. Kolaitis, C. Papadimitriou “Why not Negation by Fixpoint?” Proc. 1988 PODS. Also, JCSS 1991.

    Google Scholar 

  6. H. Kautz and B. Selman “Hard Problems for Simple Default Logics,” Artificial Intelligence, 1991.

    Google Scholar 

  7. K. Kunen “Signed Data Dependencies in Logic Programs,” Journal of Logic Programming, 7, pp. 231–245, 1989.

    Article  Google Scholar 

  8. C. H. Papadimitriou and M. Yannakakis “Tiebreaking Semantics and Structural Totality of Logic Programs with Negation,” Proceedings of 11th PODS Conference, San Diego, June 1992.

    Google Scholar 

  9. R. Reiter “A Logic for Default Reasoning,” Artificial Intelligence 13, 1980.

    Google Scholar 

  10. B. Selman “The Complexity of Non-monotonic Reasoning” Ph.D. Thesis, Toronto Univ., 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Joachim Biskup Richard Hull

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Papadimitriou, C.H., Sideri, M. (1992). On finding extensions of default theories. In: Biskup, J., Hull, R. (eds) Database Theory — ICDT '92. ICDT 1992. Lecture Notes in Computer Science, vol 646. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56039-4_47

Download citation

  • DOI: https://doi.org/10.1007/3-540-56039-4_47

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics