The Boolean hierarchy I: structural properties
SIAM Journal on Computing
Hard problems for simple default logics
Proceedings of the first international conference on Principles of knowledge representation and reasoning
The Stanford GraphBase: a platform for combinatorial computing
The Stanford GraphBase: a platform for combinatorial computing
Improvements to propositional satisfiability search algorithms
Improvements to propositional satisfiability search algorithms
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
Domains for Denotational Semantics
Proceedings of the 9th Colloquium on Automata, Languages and Programming
Smodels - An Implementation of the Stable Model and Well-Founded Semantics for Normal LP
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
Complexity of Power Default Reasoning
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Clausal logic and logic programming in algebraic domains
Information and Computation
Theoretical Computer Science
| Hi-index | 0.00 |
In this paper we explore the computational aspects of Propositional Power Default Reasoning (PDR), a form of non-monotonic reasoning in 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 of 驴2P-Complete). We take advantage of this in an implementation called powdef to encode and solve hard graph problems and explore randomly generated instances of skeptical entailment.