Experimenting with Power Default Reasoning

In this paper weexplore the computationalaspects of Propositional PowerDefault Reasoning (PDR), a form of non-monotonicreasoning whichthe underlyinglogic is Kleene’s3-valued propositionallogic. PDR leads to a concisemeaning of the problem of skeptical entailment which has better complexitycharacteristics than the usual formalisms(co-NP(3)-Complete instead [[p-Complete). Wetake advantage of this in an implementationcalled powderto encode and solve hard graphproblemsand explore randomly generatedinstancesof skeptical entailment.

Authors

• Eric Klavins William C. Rounds

Keywords

No keywords are indexed for this paper.