Constraint Programming - What is behind?
Roman Barták
Abstract
Roman Barták
Abstract
: Constraint programming is an emergent software technology for declarative description and effective solving of large, particularly combinatorial, problems especially in areas of planning and scheduling. Not only it is based on a strong theoretical foundation but it is attracting widespread commercial interest as well, in particular, in areas of modelling heterogeneous optimisation and satisfaction problems. In the paper we give a survey of technology behind constraint programming (CP) with particular emphasis on constraint satisfaction problems. We place the constraint programming in history context and highlight the interdisciplinary character of CP. In the main part of the paper, we give an overview of basic constraint satisfaction and optimization algorithms and methods of solving over-constrained problems. We also list some main application areas of constraint programming. Keywords: constraint satisfaction, search, consistency techniques, constraint propagation, optimization 1...
OpenAlex reports 28 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
: Constraint programming is an emergent software technology for declarative description and effective solving of large, particularly combinatorial, problems especially in areas of planning and scheduling. Not only it is based on a strong theoretical foundation but it is attracting widespread commercial interest as well, in particular, in areas of modelling heterogeneous optimisation and satisfaction problems. In the paper we give a survey of technology behind constraint programming (CP) with particular emphasis on constraint satisfaction problems. We place the constraint programming in history context and highlight the interdisciplinary character of CP. In the main part of the paper, we give an overview of basic constraint satisfaction and optimization algorithms and methods of solving over-constrained problems. We also list some main application areas of constraint programming. Keywords: constraint satisfaction, search, consistency techniques, constraint propagation, optimization 1...
Key concepts: Constraint programming, Constraint satisfaction, Concurrent constraint logic programming, Constraint logic programming, Constraint satisfaction problem, Computer science, Constraint (computer-aided design), Context (archaeology)