Propositional truth maintenance systems: Classification and complexity analysis
From MaRDI portal
Publication:1924776
DOI10.1007/BF01530952zbMath0855.68076MaRDI QIDQ1924776
Publication date: 27 January 1997
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) General topics in artificial intelligence (68T01)
Related Items
Complexity of the multilevel critical node problem, A note on \(\Sigma_2^p\)-completeness of a robust binary linear program with binary uncertainty set, Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel Programming, Support set selection for abductive and default reasoning, On designing networks resilient to clique blockers, A survey on mixed-integer programming techniques in bilevel optimization, A new branch-and-bound algorithm for the maximum edge-weighted clique problem, The maximum clique interdiction problem, A Unified Framework for Multistage Mixed Integer Linear Optimization, Complexity results for explanations in the structural-model approach
Cites Work
- On the complexity of propositional knowledge base revision, updates, and counterfactuals
- Some simplified NP-complete graph problems
- The polynomial-time hierarchy
- Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis
- A rational reconstruction of nonmonotonic truth maintenance systems
- Complexity Results for Nonmonotonic Logics
- A survey of complexity results for non-monotonic logics
- Node-and edge-deletion NP-complete problems
- A Computing Procedure for Quantification Theory
- The complexity of theorem-proving procedures
- Unnamed Item
