Default logic, propositional logic and constraints

Authors:
Rachel Ben-Eliyahu;Rina Dechter
Affiliations:
Cognitive Systems Laboratory, Computer Science Department, University of California, Los-Angeles, California;Information & Computer Science, University of California, Irvine, California
Venue:
AAAI'91 Proceedings of the ninth National conference on Artificial intelligence - Volume 1
Year:
1991

Citing 10
Cited 3

Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs

SIAM Journal on Computing
The complexity of some polynomial network consistency algorithms for constraint satisfaction problems

Artificial Intelligence
A sufficient condition for backtrack-bounded search

Journal of the ACM (JACM)
Formalizing nonmonotonic reasoning systems

Artificial Intelligence
Network-based heuristics for constraint-satisfaction problems

Artificial Intelligence
On the relation between default and autoepistemic logic

Artificial Intelligence
Tree clustering for constraint networks (research note)

Artificial Intelligence
Enhancement schemes for constraint processing: backjumping, learning, and cutset decomposition

Artificial Intelligence
Hard problems for simple default logics

Proceedings of the first international conference on Principles of knowledge representation and reasoning
A Sufficient Condition for Backtrack-Free Search

Journal of the ACM (JACM)

Model-equivalent reductions

SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Complexity Results for 2CNF Default Theories

Fundamenta Informaticae
Approximate Inference In Default Logic And Circumscription

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a mapping from a class of default theories to sentences in propositional logic, such that each model of the latter corresponds to an extension of the former. Using this mapping we show that many properties of default theories can be determined by solving propositional satisfiability. In particular, we show how CSP techniques can be used to identify, analyze and solve tractable subsets of Reiter's default logic.