Enhancement schemes for constraint processing: backjumping, learning, and cutset decomposition
Artificial Intelligence
Unrestricted resolution versus N-resolution
Theoretical Computer Science
A filtering algorithm for constraints of difference in CSPs
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
CPlan: a constraint programming approach to planning
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Efficient conflict driven learning in a boolean satisfiability solver
Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
Global Cut Framework for Removing Symmetries
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Global Constraints for Lexicographic Orderings
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Towards understanding and harnessing the potential of clause learning
Journal of Artificial Intelligence Research
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
Propositional Satisfiability and Constraint Programming: A comparative survey
ACM Computing Surveys (CSUR)
Universal Booleanization of Constraint Models
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Crossword Puzzles as a Constraint Problem
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Learning from the Past to Dynamically Improve Search: A Case Study on the MOSP Problem
Learning and Intelligent Optimization
Propagation via lazy clause generation
Constraints
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Nogood recording from restarts
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Reasoning from last conflict(s) in constraint programming
Artificial Intelligence
Deriving Information from Sampling and Diving
AI*IA '09: Proceedings of the XIth International Conference of the Italian Association for Artificial Intelligence Reggio Emilia on Emergent Perspectives in Artificial Intelligence
INFORMS Journal on Computing
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
A compression algorithm for large arity extensional constraints
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Path consistency by dual consistency
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
Propagation = lazy clause generation
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Constraint representations and structural tractability
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Failed value consistencies for constraint satisfaction
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Compiling all possible conflicts of a CSP
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Learning When to Use Lazy Learning in Constraint Solving
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Restarts and Nogood Recording in Qualitative Constraint-based Reasoning
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Explaining the cumulative propagator
Constraints
New decision rules for exact search in N-Queens
Journal of Global Optimization
Domain-splitting generalized nogoods from restarts
EPIA'11 Proceedings of the 15th Portugese conference on Progress in artificial intelligence
Lazy explanations for constraint propagators
PADL'10 Proceedings of the 12th international conference on Practical Aspects of Declarative Languages
Rapid learning for binary programs
CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
An empirical study of learning and forgetting constraints
AI Communications - 18th RCRA International Workshop on “Experimental evaluation of algorithms for solving problems with combinatorial explosion”
Nogoods in qualitative constraint-based reasoning
KI'12 Proceedings of the 35th Annual German conference on Advances in Artificial Intelligence
Explaining circuit propagation
Constraints
Hi-index | 0.00 |
Although nogood learning in CSPs and clause learning in SAT are formally equivalent, nogood learning has not been as successful a technique in CSP solvers as clause learning has been for SAT solvers. We show that part of the reason for this discrepancy is that nogoods in CSPs (as standardly defined) are too restrictive. In this paper we demonstrate that these restrictions can be lifted so that a CSP solver can learn more general and powerful nogoods. Nogoods generalized in this manner yield a provably more powerful CSP solver. We also demonstrate how generalized nogoods facilitate learning useful nogoods from global constraints. Finally, we demonstrate empirically that generalized nogoods can yield significant improvements in performance.