On kernels, defaults and even graphs

  • Yannis Dimopoulos
  • Vangelis Magirou
  • Christos H. Papadimitriou

Abstract

Extensions in prerequisite‐free, disjunction‐free default theories have been shown to be in direct correspondence with kernels of directed graphs; hence default theories without odd cycles always have a “standard” kind of an extension. We show that, although all “standard” extensions can be enumerated explicitly, several other problems remain intractable for such theories: Telling whether a non‐standard extension exists, enumerating all extensions, and finding the minimal standard extension. We also present a new graph‐theoretic algorithm, based on vertex feedback sets, for enumerating all extensions of a general prerequisite‐free, disjunction‐free default theory (possibly with odd cycles). The algorithm empirically performs well for quite large theories.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    E. Allender, The complexity of sparse sets in P, in: Proc. Symp. on Structure in Complexity Theory, Lecture Notes in Computer Science 223 (1986) pp. 1–11.Google Scholar
  2. [2]
    C. Berge, Graphs and Hypergraphs (Amsterdam, North-Holland, 1973).Google Scholar
  3. [3]
    Y. Dimopoulos and V. Magirou, A graph theoretic approach to Default Logic, Information & Computation 112 (1994) 239–256.MATHMathSciNetCrossRefGoogle Scholar
  4. [4]
    Y. Dimopoulos and A. Torres, Graph theoretical structures in Logic Programs and Default Theories, Theoretical Computer Science 170 (1996) 209–244.MATHMathSciNetCrossRefGoogle Scholar
  5. [5]
    D. Johnson, C.H. Papadimitriou and M. Yannakakis, On generating all Maximal Independent Sets, Information Processing Letters 27 (1988) 119–123.MATHMathSciNetCrossRefGoogle Scholar
  6. [6]
    M. Garey and D. Johnson, Computers and Intractability (Freeman, 1979).Google Scholar
  7. [7]
    M. Gelfond and V. Lifschitz, The Stable Model semantics for Logic Programming, in: Logic Programming: Proceedings of the 5th International Conference and Symposium, eds. R. Kowalski and K. Bowen (1988) pp. 1070–1080.Google Scholar
  8. [8]
    C.H. Papadimitriou and M. Sideri, On finding extensions of Default Theories, in: Proc. of the International Conference on Database Theory, eds. J. Biskup and R. Hull, Lecture Notes in Computer Science 646 (1992).Google Scholar
  9. [9]
    C.H. Papadimitriou and M. Sideri, Default theories that always have extensions, Artificial Intelligence 69 (1994) 347–357.MATHMathSciNetCrossRefGoogle Scholar
  10. [10]
    C.H. Papadimitriou and M. Yannakakis, Tie-Breaking Semantics and Structural Totality, Symposium on the Principles of Database Systems (1992).Google Scholar
  11. [11]
    R. Reiter, A logic for default reasoning, Artificial Intelligence 13 (1980).Google Scholar

Copyright information

© Kluwer Academic Publishers 1997

Authors and Affiliations

  • Yannis Dimopoulos
    • 1
  • Vangelis Magirou
    • 2
  • Christos H. Papadimitriou
    • 3
  1. 1.Max‐Planck‐Institut für InformatikSaarbrückenGermany
  2. 2.Athens University of EconomicsAthensGreece
  3. 3.CS&EE DepartmentUniversity of California at San DiegoLa JollaUSA

Personalised recommendations