Debugging unsatisfiable constraint models
From MaRDI portal
Publication:2011577
DOI10.1007/978-3-319-59776-8_7zbMATH Open1489.68254OpenAlexW2618380584MaRDI QIDQ2011577FDOQ2011577
Authors: Kevin Leo, Guido Tack 
Publication date: 4 August 2017
Full work available at URL: https://doi.org/10.1007/978-3-319-59776-8_7
Recommendations
Cites Work
- Philosophy of the MiniZinc challenge
- Algorithms for computing minimal unsatisfiable subsets of constraints
- Irreducibly inconsistent systems of linear inequalities
- Fast, flexible MUS enumeration
- Identifying Minimally Infeasible Subsystems of Inequalities
- Enumerating infeasibility: finding multiple MUSes quickly
- Propagation = Lazy Clause Generation
- The resource-constrained modulo scheduling problem: an experimental study
- Finding a collection of MUSes incrementally
- Generating Corrective Explanations for Interactive Constraint Satisfaction
Cited In (8)
- Constraint-based debugging in probabilistic model checking
- Title not available (Why is that?)
- 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
Uses Software
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)
