Seminormalizing a default theory

DOI10.3166/JANCL.15.321-340MaRDI QIDQ3647232zbMATHOpenAlexFDO

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

zbMATH Keywords

nonmonotonic reasoningknowledge representationdefault logic

Mathematics Subject Classification ID

Other nonclassical logic (03B60) Knowledge representation (68T30) Logic in artificial intelligence (68T27)

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

Cites work

• scientific article; zbMATH DE number 592370 (Why is no real title available?)
• A logic for default reasoning
• A proof theoretical approach to default reasoning I: tableaux for default logic
• Alternative approaches to default logic
• Alternative foundations for Reiter's default logic
• Computing with default logic
• Cumulative default logic: In defense of nonmonotonic inference rules
• Knowledge in flux. Modeling the dynamics of epistemic states
• On cumulative default logics
• On the logic of theory change: Partial meet contraction and revision functions
• On the relation between default and autoepistemic logic
• Operational concepts of nonmonotonic logics. I: Default logic
• Probabilistic default reasoning with conditional constraints
• Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete
• Propositional default logics made easier: computational complexity of model checking.
• Propositional knowledge base revision and minimal change
• Reducing belief revision to circumscription (and vice versa)
• Representability in Default Logic
• Representing actions in logic programs and default theories a situation calculus approach
• Results on translating defaults to circumscription
• Semantics and complexity of abduction from default theories
• Translating default logic into standard autoepistemic logic
• Where fail-safe default logics fail

Cited in

(3)

• scientific article; zbMATH DE number 1884388 (Why is no real title available?)
• Evaluating the effect of semi-normality on the expressiveness of defaults
• Ordered seminormal default theories and their extensions

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)