Cumulative default logic: Finite characterization, algorithms, and complexity
From MaRDI portal
Publication:1337685
DOI10.1016/0004-3702(94)90086-8zbMath0821.68111OpenAlexW2004387901WikidataQ59259764 ScholiaQ59259764MaRDI QIDQ1337685
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
Related Items
Cumulative default logic: Finite characterization, algorithms, and complexity ⋮ Cumulativity Tailored for Nonmonotonic Reasoning ⋮ Characterizations and algorithms of extensions for CADL and QDL
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A logic for default reasoning
- Cumulative default logic: In defense of nonmonotonic inference rules
- On the complexity of propositional knowledge base revision, updates, and counterfactuals
- On extensions of general default theories
- Cumulative default logic: Finite characterization, algorithms, and complexity
- Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete
- Complexity Results for Nonmonotonic Logics
- A survey of complexity results for non-monotonic logics