On kernels, defaults and even graphs
Rent the article at a discountRent now
* Final gross prices may vary according to local VAT.Get Access
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.
- 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.
- Berge, C. (1973) Graphs and Hypergraphs. North-Holland, Amsterdam
- Dimopoulos, Y., Magirou, V. (1994) A graph theoretic approach to Default Logic. Information & Computation 112: pp. 239-256 CrossRef
- Dimopoulos, Y., Torres, A. (1996) Graph theoretical structures in Logic Programs and Default Theories. Theoretical Computer Science 170: pp. 209-244 CrossRef
- Johnson, D., Papadimitriou, C.H., Yannakakis, M. (1988) On generating all Maximal Independent Sets. Information Processing Letters 27: pp. 119-123 CrossRef
- M. Garey and D. Johnson, Computers and Intractability (Freeman, 1979).
- 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.
- 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).
- Papadimitriou, C.H., Sideri, M. (1994) Default theories that always have extensions. Artificial Intelligence 69: pp. 347-357 CrossRef
- C.H. Papadimitriou and M. Yannakakis, Tie-Breaking Semantics and Structural Totality, Symposium on the Principles of Database Systems (1992).
- R. Reiter, A logic for default reasoning, Artificial Intelligence 13 (1980).
- On kernels, defaults and even graphs
Annals of Mathematics and Artificial Intelligence
Volume 20, Issue 1-4 , pp 1-12
- Cover Date
- Print ISSN
- Online ISSN
- Kluwer Academic Publishers
- Additional Links
- Industry Sectors
- Author Affiliations
- 1. Max‐Planck‐Institut für Informatik, Im Stadtwald, 66123, Saarbrücken, Germany
- 2. Athens University of Economics, 76 Patission Str., 10434, Athens, Greece
- 3. CS&EE Department, University of California at San Diego, La Jolla, CA, 92093‐0114, USA