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
Authors
Contributors
+ Jeavons, P
Division:
MPLS
Department:
Computer Science
Role:
Supervisor
+ Gottlob, G
Division:
MPLS
Department:
Computer Science
Role:
Supervisor
Funding
+ Engineering and Physical Sciences Research Council
More from this funder
Funding agency for:
Thorstensen, E
Grant:
EP/G055114/1
Bibliographic Details
- Publication date:
- 2013
- Type of award:
- DPhil
- Level of award:
- Doctoral
- Awarding institution:
- Oxford University, UK
Item Description
- Language:
- English
- Keywords:
- Subjects:
- UUID:
-
uuid:05707b54-69e3-40eb-97e7-63b1a178c701
- Local pid:
- ora:7270
- Deposit date:
- 2013-09-09
If you are the owner of this record, you can report an update to it here: Report update to this record