On kernels, defaults and even graphs
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.
Unable to display preview. Download preview PDF.
- 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
- C. Berge, Graphs and Hypergraphs (Amsterdam, North-Holland, 1973).Google Scholar
- M. Garey and D. Johnson, Computers and Intractability (Freeman, 1979).Google Scholar
- 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
- 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
- C.H. Papadimitriou and M. Yannakakis, Tie-Breaking Semantics and Structural Totality, Symposium on the Principles of Database Systems (1992).Google Scholar
- R. Reiter, A logic for default reasoning, Artificial Intelligence 13 (1980).Google Scholar