Debugging unsatisfiable constraint models
From MaRDI portal
Publication:2011577
Recommendations
Cites work
- Algorithms for computing minimal unsatisfiable subsets of constraints
- Enumerating infeasibility: finding multiple MUSes quickly
- Fast, flexible MUS enumeration
- Finding a collection of MUSes incrementally
- Generating Corrective Explanations for Interactive Constraint Satisfaction
- Identifying Minimally Infeasible Subsystems of Inequalities
- Irreducibly inconsistent systems of linear inequalities
- Philosophy of the MiniZinc challenge
- Propagation = Lazy Clause Generation
- The resource-constrained modulo scheduling problem: an experimental study
Cited in
(8)- Constraint-based debugging in probabilistic model checking
- scientific article; zbMATH DE number 2080316 (Why is no real title available?)
- Debugging Unrealizable Specifications with Model-Based Diagnosis
- Learning variable activity initialisation for lazy clause generation solvers
- Human-centred feasibility restoration in practice
- A framework for step-wise explaining how to solve constraint satisfaction problems
- Cable tree wiring -- benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints
- MUST: Provide a Finer-Grained Explanation of Unsatisfiability
This page was built for publication: Debugging unsatisfiable constraint models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2011577)