Cumulative default logic: Finite characterization, algorithms, and complexity
From MaRDI portal
Recommendations
Cites work
- 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
- 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?)
- 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
(7)- Cumulative default logic: In defense of nonmonotonic inference rules
- Characterizations and algorithms of extensions for CADL and QDL
- On cumulative default logics
- Cumulative default logic: Finite characterization, algorithms, and complexity
- MULTIPLE-CONCLUSION LP AND DEFAULT CLASSICALITY
- A note on the cumulativity of justified default logic
- Cumulativity Tailored for Nonmonotonic Reasoning
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)
