Cost-minimal parameter correction subsets for unsatisfiable constraint problems

DOI10.1007/978-3-032-27242-3_17MaRDI QIDQ7356171zbMATH OpenFDO

Authors Antoine Laviolette, Claude-Guy Quimper, Raphaël Boudreault

Publication date 23 September 2026

Full work available at URL https://doi.org/10.1007/978-3-032-27242-3_17

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Deterministic scheduling theory in operations research (90B35)

Cites work

• A framework for step-wise explaining how to solve constraint satisfaction problems
• Accelerated deletion-based extraction of minimal unsatisfiable cores
• An updated survey of variants and extensions of the resource-constrained project scheduling problem
• Cutting plane algorithms for the inverse mixed integer linear programming problem
• Debugging unsatisfiable constraint models
• Enumerating infeasibility: finding multiple MUSes quickly
• Fast, flexible MUS enumeration
• Human-centred feasibility restoration in practice
• Infeasibility resolution based on goal programming
• Irreducibly inconsistent systems of linear inequalities
• MiniBrass: soft constraints for MiniZinc
• Objective-based counterfactual explanations for linear discrete optimization
• PSPLIB -- a project scheduling problem library

This page was built for publication: Cost-minimal parameter correction subsets for unsatisfiable constraint problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7356171)