Constraint satisfaction in logic programming
Constraint satisfaction in logic programming
Communications of the ACM
A practical use of Jackson's preemptive schedule for solving the job shop problem
Annals of Operations Research
The CLP( R ) language and system
ACM Transactions on Programming Languages and Systems (TOPLAS)
Concurrent constraint programming
Concurrent constraint programming
Search and imperative programming
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Alma-O: an imperative language that supports declarative programming
ACM Transactions on Programming Languages and Systems (TOPLAS)
The OPL optimization programming language
The OPL optimization programming language
PPDP '99 Proceedings of the International Conference PPDP'99 on Principles and Practice of Declarative Programming
JELIA '96 Proceedings of the European Workshop on Logics in Artificial Intelligence
Search Procedures and Parallelism in Constraint Programming
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Soft constraint propagation and solving in CHRs
Proceedings of the 2002 ACM symposium on Applied computing
PCK50 Proceedings of the Paris C. Kanellakis memorial workshop on Principles of computing & knowledge: Paris C. Kanellakis memorial workshop on the occasion of his 50th birthday
Preference programming: Advanced problem solving for configuration
Artificial Intelligence for Engineering Design, Analysis and Manufacturing
A decomposition-based implementation of search strategies
ACM Transactions on Computational Logic (TOCL)
A unified framework for partial and hybrid search methods in constraint programming
Computers and Operations Research
Propositional Satisfiability and Constraint Programming: A comparative survey
ACM Computing Surveys (CSUR)
A Modeling Layer for Constraint-Programming Libraries
INFORMS Journal on Computing
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
A Flexible Search Framework for CHR
Constraint Handling Rules
Monadic constraint programming
Journal of Functional Programming
Programming constraint services: high-level programming of standard and new constraint services
Programming constraint services: high-level programming of standard and new constraint services
Computers and Operations Research
A combined CLP-MILP approach for scheduling commodities in a pipeline
Journal of Scheduling
Procedural code generation vs static expansion in modelling languages for constraint programming
CSCLP'09 Proceedings of the 14th Annual ERCIM international conference on Constraint solving and constraint logic programming
Itemset mining: A constraint programming perspective
Artificial Intelligence
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Nondeterministic control for hybrid search
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Constraints
| Hi-index | 0.00 |
OPL is a modeling language for mathematical programming and combinatorial optimization. It is the first language to combine high-level algebraic and set notations from mathematical modeling languages with a rich constraint language and the ability to specify search procedures and strategies that are the essence of constraint programming. This paper describes the facilities available in OPL to specify search procedures. It describes the abstractions of OPL to specify both the search tree (search) and how to explore it (strategies). The paper also illustrates how to use these high-level constructs to implement traditional search procedures in constraint programming and scheduling.