A theory of diagnosis from first principles
Artificial Intelligence
Operations research: principles and practice, 2nd ed.
Operations research: principles and practice, 2nd ed.
OOPSLA '87 Conference proceedings on Object-oriented programming systems, languages and applications
Model-based reasoning: troubleshooting
Exploring artificial intelligence
Combinatorial aspects of construction of competition Dutch Professional Football Leagues
Discrete Applied Mathematics - Special issue: Timetabling and chromatic scheduling
Readings in model-based diagnosis
Readings in model-based diagnosis
Intelligent Support for Interactive Configuration of Mass-Customized Products
Proceedings of the 14th International conference on Industrial and engineering applications of artificial intelligence and expert systems: engineering of intelligent systems
Hierarchical Diagnosis of Large Configurator Knowledge Bases
KI '01 Proceedings of the Joint German/Austrian Conference on AI: Advances in Artificial Intelligence
MUST: provide a finer-grained explanation of unsatisfiability
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Exploiting past and future: pruning by inconsistent partial state dominance
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
On improving MUS extraction algorithms
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Towards a notion of unsatisfiable cores for LTL
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
Towards a notion of unsatisfiable and unrealizable cores for LTL
Science of Computer Programming
Towards efficient MUS extraction
AI Communications - 18th RCRA International Workshop on “Experimental evaluation of algorithms for solving problems with combinatorial explosion”
On computing minimal equivalent subformulas
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
MUStICCa: MUS extraction with interactive choice of candidates
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Minimal sets over monotone predicates in boolean formulae
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Preserving partial solutions while relaxing constraint networks
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
Constraint relaxation is a frequently used technique for managing over-determined constraint satisfaction problems. A problem in constraint relaxation is the selection of the appropriate constraints. We show that methods developed in model-based diagnosis solve this problem. The resulting method, DOC, an abbreviation for Diagnosis of Over-determined Constraint Satisfaction Problems, identifies the set of least important constraints that should be relaxed to solve the remaining constraint satisfaction problem. If the solution is not acceptable for a user, DOC selects next-best sets of least-important constraints until an acceptable solution has been generated. The power of DOC is illustrated by a case study of scheduling the Dutch major league soccer competition. The current schedule is made using human insight and Operations Research methods. Using DOC, the 1992-1993 schedule has been improved by reducing the number and importance of the violated constraints by 56%. The case study revealed that efficiency improvement is a major issue in order to apply this method to large-scale over-determined scheduling and constraint satisfaction problems.