In this paper weexplore the computationalaspects of Propositional PowerDefault Reasoning (PDR),a form of non-monotonicreasoning whichthe underlyinglogic is Kleene's3-valued propositionallogic. PDRleads to a concisemeaning of the problemof skeptical entailment which has better complexitycharacteristics than the usual formalisms(co-NP(3)-Completeinstead [[p-Complete). Wetake advantage of this in an implementationcalled powderto encode and solve hard graphproblemsand explore randomly generatedinstancesof skeptical entailment.
Eric Klavins, William C. Rounds, Guo-Qiang Zhang