MUST: Provide a Finer-Grained Explanation of Unsatisfiability
From MaRDI portal
Publication:3523066
DOI10.1007/978-3-540-74970-7_24zbMath1145.68516MaRDI QIDQ3523066
Éric Grégoire, Bertrand Mazure, Cédric Piette
Publication date: 2 September 2008
Published in: Principles and Practice of Constraint Programming – CP 2007 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-74970-7_24
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Choco
- On the complexity of propositional knowledge base revision, updates, and counterfactuals
- Approximating minimal unsatisfiable subformulae by means of adaptive core search
- Local-search extraction of mUSes
- Generalized filtering algorithms for infeasibility analysis
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing