Seminormalizing a default theory
From MaRDI portal
Publication:3647232
DOI10.3166/JANCL.15.321-340zbMATH Open1185.03052OpenAlexW2087561262MaRDI QIDQ3647232FDOQ3647232
Authors: Paolo Liberatore 
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
Recommendations
- Seminormal stratified default theories
- Publication:4943322
- Ordered seminormal default theories and their extensions
- scientific article; zbMATH DE number 1051025
- On extensions of general default theories
- Constraints on extensions of a default theory
- DEFAULTABLE TERM STRUCTURES DRIVEN BY SEMIMARTINGALES
- A proof method for closed normal default theories
- Characterization of an auto-compatible default theory
Other nonclassical logic (03B60) Knowledge representation (68T30) Logic in artificial intelligence (68T27)
Cites Work
- On the logic of theory change: Partial meet contraction and revision functions
- Knowledge in flux. Modeling the dynamics of epistemic states
- Representing actions in logic programs and default theories a situation calculus approach
- Propositional knowledge base revision and minimal change
- A logic for default reasoning
- Title not available (Why is that?)
- Probabilistic default reasoning with conditional constraints
- Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete
- Semantics and complexity of abduction from default theories
- On the relation between default and autoepistemic logic
- Translating default logic into standard autoepistemic logic
- Alternative approaches to default logic
- A proof theoretical approach to default reasoning I: tableaux for default logic
- Cumulative default logic: In defense of nonmonotonic inference rules
- Results on translating defaults to circumscription
- Reducing belief revision to circumscription (and vice versa)
- Operational concepts of nonmonotonic logics. I: Default logic
- Propositional default logics made easier: computational complexity of model checking.
- Alternative foundations for Reiter's default logic
- On cumulative default logics
- Representability in Default Logic
- Computing with default logic
- Where fail-safe default logics fail
Cited In (3)
This page was built for publication: Seminormalizing a default theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3647232)
