A Graph-Theoretic Approach to Default Logic
SourceInformation and Computation
Google Scholar check
MetadataShow full item record
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.