Experimenting with Power Default Reasoning
Abstract
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.
Cite
Text
Klavins et al. "Experimenting with Power Default Reasoning." AAAI Conference on Artificial Intelligence, 1998.Markdown
[Klavins et al. "Experimenting with Power Default Reasoning." AAAI Conference on Artificial Intelligence, 1998.](https://mlanthology.org/aaai/1998/klavins1998aaai-experimenting/)BibTeX
@inproceedings{klavins1998aaai-experimenting,
title = {{Experimenting with Power Default Reasoning}},
author = {Klavins, Eric and Rounds, William C. and Zhang, Guo-Qiang},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {1998},
pages = {846-852},
url = {https://mlanthology.org/aaai/1998/klavins1998aaai-experimenting/}
}