Return of the JTMS: Preferences Orchestrate Conflict Learning and Solution Synthesis

Authors:
Ulrich Junker;Olivier Lhomme
Affiliations:
ILOG S.A., France, email: {ujunker, olhomme}@ilog.fr;ILOG S.A., France, email: {ujunker, olhomme}@ilog.fr
Venue:
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Year:
2006

Citing 6
Cited 0

GRASP: A Search Algorithm for Propositional Satisfiability

IEEE Transactions on Computers
Bucket elimination: a unifying framework for reasoning

Artificial Intelligence
QUICKXPLAIN: preferred explanations and relaxations for over-constrained problems

AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Propagate the right thing: how preferences can speed-up constraint solving

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Using CSP look-back techniques to solve real-world SAT instances

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Applications of craig interpolants in model checking

TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems

Quantified Score

Hi-index	0.01

Visualization

Abstract

We use a lexicographical preference order on the problem space to combine solution synthesis with conflict learning. Given two preferred solutions of two subproblems, we can either combine them to a solution of the whole problem or learn a 'fat' conflict which cuts off a whole subtree. The approach makes conflict learning more pervasive for Constraint Programming as it well exploits efficient support finding and compact representations of Craig interpolants.