A filtering algorithm for constraints of difference in CSPs
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
The OPL optimization programming language
The OPL optimization programming language
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Global Constraints for Lexicographic Orderings
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Constraint Processing
Constraint Lingo: towards high-level constraint programming
Software—Practice & Experience - Research Articles
Modelling and solving English Peg Solitaire
Computers and Operations Research
The rules of constraint modelling
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
NP-SPEC: an executable specification language for solving all problems in NP
Computer Languages
Model-driven constraint programming
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
The Monoids of Order Eight and Nine
Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics
Structural Tractability of Propagated Constraints
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Generalised arc consistency for the AllDifferent constraint: An empirical survey
Artificial Intelligence
Tank allocation problems in maritime bulk shipping
Computers and Operations Research
Data structures for generalised arc consistency for extensional constraints
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
QCSP made practical by virtue of restricted quantification
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
The monoids of orders eight, nine & ten
Annals of Mathematics and Artificial Intelligence
Artemis: a system for analyzing missing answers
Proceedings of the VLDB Endowment
Tailoring solver-independent constraint models: a case study with ESSENCE' and MINION
SARA'07 Proceedings of the 7th International conference on Abstraction, reformulation, and approximation
Advisors for incremental propagation
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
MiniZinc: towards a standard CP modelling language
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Modelling equidistant frequency permutation arrays: an application of constraints to mathematics
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Scheduling the CB1000 nanoproteomic analysis system with Python, Tailor, and Minion
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Maintaining state in propagation solvers
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Implementing logical connectives in constraint programming
Artificial Intelligence
Learning When to Use Lazy Learning in Constraint Solving
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Does testing help to reduce the number of potentially faulty statements in debugging?
TAIC PART'10 Proceedings of the 5th international academic and industrial conference on Testing - practice and research techniques
Generating special-purpose stateless propagators for arbitrary constraints
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Ensemble classification for constraint solver configuration
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Local consistency and SAT-solvers
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
Explaining missing answers to SPJUA queries
Proceedings of the VLDB Endowment
The extended global cardinality constraint: An empirical survey
Artificial Intelligence
Itemset mining: A constraint programming perspective
Artificial Intelligence
Grounding formulas with complex terms
Canadian AI'11 Proceedings of the 24th Canadian conference on Advances in artificial intelligence
MKM'11 Proceedings of the 18th Calculemus and 10th international conference on Intelligent computer mathematics
Policy expressivity in the Anzere personal cloud
Proceedings of the 2nd ACM Symposium on Cloud Computing
Generating highly balanced sudoku problems as hard problems
Journal of Heuristics
New decision rules for exact search in N-Queens
Journal of Global Optimization
Synthesis of search algorithms from high-level CP models
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Boolean equi-propagation for optimized SAT encoding
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Automatic generation of constraints for partial symmetry breaking
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
A delegation-based architecture for collaborative robotics
AOSE'10 Proceedings of the 11th international conference on Agent-oriented software engineering
Watched literals for constraint propagation in minion
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Lazy explanations for constraint propagators
PADL'10 Proceedings of the 12th international conference on Practical Aspects of Declarative Languages
Exploiting short supports for generalised arc consistency for arbitrary constraints
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Filtering algorithms for global chance constraints
Artificial Intelligence
An automated approach to generating efficient constraint solvers
Proceedings of the 34th International Conference on Software Engineering
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”
Local consistency and SAT-solvers
Journal of Artificial Intelligence Research
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Synthesis of tiled patterns using factor graphs
ACM Transactions on Graphics (TOG)
On the reification of global constraints
Constraints
View-based propagator derivation
Constraints
Combining slicing and constraint solving for better debugging: the CONBAS approach
Advances in Software Engineering
Short and long supports for constraint propagation
Journal of Artificial Intelligence Research
Boolean equi-propagation for concise and efficient SAT encodings of combinatorial problems
Journal of Artificial Intelligence Research
Extending simple tabular reduction with short supports
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Optimal implementation of watched literals and more general techniques
Journal of Artificial Intelligence Research
Hi-index | 0.00 |
We present Minion, a new constraint solver. Empirical results on standard benchmarks show orders of magnitude performance gains over state-of-the-art constraint toolkits. These gains increase with problem size --MINION delivers scalable constraint solving. MINION is a general-purpose constraint solver, with an expressive input language based on the common constraint modelling device of matrix models. Focussing on matrix models supports a highly-optimised implementation, exploiting the properties of modern processors. This contrasts with current constraint toolkits, which, in order to provide ever more modelling and solving options, have become progressively more complex at the cost of both performance and usability. MINION is a black box from the user point of view, deliberately providing few options. This, combined with its raw speed, makes MINION a substantial step towards Puget's 'Model and Run' constraint solving paradigm.