Seminormalizing a default theory
From MaRDI portal
Publication:3647232
DOI10.3166/jancl.15.321-340zbMath1185.03052OpenAlexW2087561262MaRDI QIDQ3647232
Publication date: 30 November 2009
Published in: Journal of Applied Non-Classical Logics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3166/jancl.15.321-340
Other nonclassical logic (03B60) Logic in artificial intelligence (68T27) Knowledge representation (68T30)
Cites Work
- Unnamed Item
- Unnamed Item
- On the relation between default and autoepistemic logic
- Results on translating defaults to circumscription
- A logic for default reasoning
- Cumulative default logic: In defense of nonmonotonic inference rules
- Propositional knowledge base revision and minimal change
- On cumulative default logics
- Operational concepts of nonmonotonic logics. I: Default logic
- Alternative approaches to default logic
- Reducing belief revision to circumscription (and vice versa)
- Semantics and complexity of abduction from default theories
- Alternative foundations for Reiter's default logic
- Probabilistic default reasoning with conditional constraints
- Computing with default logic
- Propositional default logics made easier: computational complexity of model checking.
- Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete
- On the logic of theory change: Partial meet contraction and revision functions
- Representing actions in logic programs and default theories a situation calculus approach
- Translating default logic into standard autoepistemic logic
- A proof theoretical approach to default reasoning I: tableaux for default logic
- Where fail-safe default logics fail
- Representability in Default Logic
This page was built for publication: Seminormalizing a default theory
