Thesis icon

Thesis

Hybrid tractability of constraint satisfaction problems with global constraints

Abstract:

A wide range of problems can be modelled as constraint satisfaction problems (CSPs), that is, a set of constraints that must be satisfied simultaneously. Constraints can either be represented extensionally, by explicitly listing allowed combinations of values, or intensionally, whether by an equation, propositional logic formula, or other means. Intensionally represented constraints, known as global constraints, are a powerful modelling technique, and many modern CSP solvers provide them. ...

Expand abstract

Actions


Access Document


Files:

Authors


More by this author
Institution:
University of Oxford
Research group:
Constraints group
Oxford college:
St Anne's College
Department:
Mathematical,Physical & Life Sciences Division - Computer Science,Department of

Contributors

Role:
Supervisor
Role:
Supervisor
Publication date:
2013
Type of award:
DPhil
Level of award:
Doctoral
Awarding institution:
Oxford University, UK
URN:
uuid:05707b54-69e3-40eb-97e7-63b1a178c701
Local pid:
ora:7270

Terms of use


Metrics



If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP