A Graph-Theoretic Approach to Default Logic
Date
1994Source
Information and ComputationVolume
112Issue
2Pages
239-256Google Scholar check
Metadata
Show full item recordAbstract
A network representation of propositional seminormal disjunction-free default theories is presented, leading to a graph-theoretic approach to their analysis. The problem of finding an extension is proved to be equivalent to that of determining a kernel for a corresponding graph, allowing stronger complexity results as well as new conditions for the existence of extensions. © 1994 Academic Press, Inc.