Partial constraint satisfaction
Artificial Intelligence - Special volume on constraint-based reasoning
Maintaining reversible DAC for Max-CSP
Artificial Intelligence
Partition-Based Lower Bound for Max-CSP
Constraints
Meta-constraints on violations for over constrained problems
ICTAI '00 Proceedings of the 12th IEEE International Conference on Tools with Artificial Intelligence
The State of the Art of Nurse Rostering
Journal of Scheduling
Solving weighted CSP by maintaining arc consistency
Artificial Intelligence
Parallel and distributed local search in COMET
Computers and Operations Research
Solving (Weighted) Partial MaxSAT through Satisfiability Testing
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Algorithms for Weighted Boolean Optimization
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Existential arc consistency: getting closer to full arc consistency in weighted CSPs
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
MiniZinc: towards a standard CP modelling language
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Solving nurse rostering problems using soft global constraints
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Zchaff2004: an efficient SAT solver
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
A fast linear-arithmetic solver for DPLL(T)
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
On SAT modulo theories and optimization problems
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
A modular approach to MaxSAT modulo theories
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
| Hi-index | 0.00 |
We introduce WSimply, a new framework for modelling and solving Weighted Constraint Satisfaction Problems (WCSP) using Satisfiability Modulo Theories (SMT) technology. In contrast to other well-known approaches designed for extensional representation of goods or no-goods, and with few declarative facilities, our approach aims to follow an intensional and declarative syntax style. In addition, our language has built-in support for some meta-constraints, such as priority and homogeneity, which allows the user to easily specify rich requirements on the desired solutions, such as preferences and fairness. We propose two alternative strategies for solving these WCSP instances using SMT. The first is the reformulation into Weighted SMT (WSMT) and the application of satisfiability test based algorithms from recent contributions in the Weighted Maximum Satisfiability field. The second one is the reformulation into an operation research-like style which involves an optimisation variable or objective function and the application of optimisation SMT solvers. We present experimental results of two well-known problems: the Nurse Rostering Problem (NRP) and a variant of the Balanced Academic Curriculum Problem (BACP), and provide some insights into the impact of the addition of meta-constraints on the quality of the solutions and the solving time.