Cumulative default logic: Finite characterization, algorithms, and complexity

DOI10.1016/0004-3702(94)90086-8MaRDI QIDQ1337685zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Georg Gottlob, MingYi Zhang

Publication date 8 November 1994

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0004-3702(94)90086-8

zbMATH Keywords

cumulative default logic

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Recommendations

• On cumulative default logics
• Characterizations and algorithms of extensions for CADL and QDL
• scientific article; zbMATH DE number 52991
• Cumulative default logic: In defense of nonmonotonic inference rules
• Yet some more complexity results for default logic

Cites work

• scientific article; zbMATH DE number 140413 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 517023 (Why is no real title available?)
• scientific article; zbMATH DE number 1142309 (Why is no real title available?)
• scientific article; zbMATH DE number 1761422 (Why is no real title available?)
• A logic for default reasoning
• A survey of complexity results for non-monotonic logics
• A tableaux-based theorem prover for a decidable subset of default logic
• Complexity Results for Nonmonotonic Logics
• Cumulative default logic: Finite characterization, algorithms, and complexity
• Cumulative default logic: In defense of nonmonotonic inference rules
• On extensions of general default theories
• On the complexity of propositional knowledge base revision, updates, and counterfactuals
• Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete

Cited in

(5)

• A note on the cumulativity of justified default logic
• Characterizations and algorithms of extensions for CADL and QDL
• Cumulative default logic: Finite characterization, algorithms, and complexity
• Cumulativity Tailored for Nonmonotonic Reasoning
• MULTIPLE-CONCLUSION LP AND DEFAULT CLASSICALITY

This page was built for publication: Cumulative default logic: Finite characterization, algorithms, and complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1337685)