Mapping Inferences: Constraint Propagation and Diamond Satisfaction
The main theme shared by the two main parts of this thesis is EFFICIENT AUTOMATED REASONING.Part I is focussed on a general theory underpinning a number of efficient approximate algorithms for Constraint Satisfaction Problems (CSPs),the constraint propagation algorithms.In Chapter 3, we propose a St...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en |
| Published: |
Universiteit van Amsterdam
2016
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10919/71553 |