Debugging unsatisfiable constraint models

DOI10.1007/978-3-319-59776-8_7zbMath1489.68254OpenAlexW2618380584MaRDI QIDQ2011577

Guido Tack, Kevin Leo

Publication date: 4 August 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-59776-8_7

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

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, Learning variable activity initialisation for lazy clause generation solvers

Uses Software

• CSPLib
• MiniZinc

Cites Work

• Fast, flexible MUS enumeration
• Philosophy of the MiniZinc challenge
• Irreducibly inconsistent systems of linear inequalities
• The resource-constrained modulo scheduling problem: an experimental study
• Algorithms for computing minimal unsatisfiable subsets of constraints
• Finding a Collection of MUSes Incrementally
• Propagation = Lazy Clause Generation
• Generating Corrective Explanations for Interactive Constraint Satisfaction
• Identifying Minimally Infeasible Subsystems of Inequalities
• Enumerating Infeasibility: Finding Multiple MUSes Quickly