[PDF][PDF] On computing minimal correction subsets
A set of constraints that cannot be simultaneously satisfied is over-constrained. Minimal
relaxations and minimal explanations for over-constrained problems find many practical …
relaxations and minimal explanations for over-constrained problems find many practical …
A new model for automated examination timetabling
Automated examination timetabling has been addressed by a wide variety of methodologies
and techniques over the last ten years or so. Many of the methods in this broad range of …
and techniques over the last ten years or so. Many of the methods in this broad range of …
Workforce optimization: Identification and assignment of professional workers using constraint programming
Matching highly skilled people to available positions is a high-stakes task that requires
careful consideration by experienced resource managers. A wrong decision may result in …
careful consideration by experienced resource managers. A wrong decision may result in …
Exploiting unit propagation to compute lower bounds in branch and bound Max-SAT solvers
One of the main differences between complete SAT solvers and exact Max-SAT solvers is
that the former make an intensive use of unit propagation at each node of the proof tree …
that the former make an intensive use of unit propagation at each node of the proof tree …
[PDF][PDF] Boosting MCSes Enumeration.
É Grégoire, Y Izza, JM Lagniez - IJCAI, 2018 - ijcai.org
The enumeration of all Maximal Satisfiable Subsets (MSSes) or all Minimal Correction
Subsets (MCSes) of an unsatisfiable CNF Boolean formula is a useful and sometimes …
Subsets (MCSes) of an unsatisfiable CNF Boolean formula is a useful and sometimes …
An experimentally efficient method for (MSS, CoMSS) partitioning
É Grégoire, JM Lagniez, B Mazure - … of the AAAI Conference on Artificial …, 2014 - ojs.aaai.org
The concepts of MSS (Maximal Satisfiable Subset) andCoMSS (also called Minimal
Correction Subset) playa key role in many AI approaches and techniques. Inthis paper, a …
Correction Subset) playa key role in many AI approaches and techniques. Inthis paper, a …
Domain specific high-level constraints for user interface layout
C Lutteroth, R Strandh, G Weber - Constraints, 2008 - Springer
Abstract We present the Auckland Layout Model (ALM), a constraint-based technique for
specifying 2D layout as it is used for arranging the controls in a graphical user interface …
specifying 2D layout as it is used for arranging the controls in a graphical user interface …
Improving MCS enumeration via caching
Enumeration of minimal correction sets (MCSes) of conjunctive normal form formulas is a
central and highly intractable problem in infeasibility analysis of constraint systems. Often …
central and highly intractable problem in infeasibility analysis of constraint systems. Often …
Exact Max-SAT solvers for over-constrained problems
J Argelich, F Manyà - Journal of Heuristics, 2006 - Springer
We present a new generic problem solving approach for over-constrained problems based
on Max-SAT. We first define a Boolean clausal form formalism, called soft CNF formulas, that …
on Max-SAT. We first define a Boolean clausal form formalism, called soft CNF formulas, that …
On computing preferred MUSes and MCSes
J Marques-Silva, A Previti - … Conference on Theory and Applications of …, 2014 - Springer
Abstract Minimal Unsatisfiable Subsets (MUSes) and Minimal Correction Subsets (MCSes)
are essential tools for the analysis of unsatisfiable formulas. MUSes and MCSes find a …
are essential tools for the analysis of unsatisfiable formulas. MUSes and MCSes find a …