Experimenting with power default reasoning
Eric Klavins, William C. Rounds, Guo‐Qiang Zhang · 1998
In this paper we explore the computational aspects of Propositional Power Default Reasoning (PDR), a form of non-monotonic reasoning which the underlying logic is Kleene’s 3-valued propositional logic. PDR leads to a concise meaning of the problem of skeptical entailment which has better complexity characteristics than the usual formalisms (co-NP(3)-Complete instead [[p-Complete). We take advantage of this in an implementation called powder to encode and solve hard graph problems and explore randomly generated instances of skeptical entailment.