Dynamic abstractions and reformulations in constraint satisfaction problems

(short version) Constraint satisfaction is the most successful computational paradigm for problem-solving today. A major difficulty is efficient formulation of constraint satisfaction proiblems (CSP). This thesis describes several methods for abstractions and reformulations of CSPs. The thesis presents three major results. The first is a technique for finding context-dependent interchangeability, an abstraction that allows simplifying CSP. The second is a technique for abstracting a CSP solution space into a tree of abstractions, which can in particular be used for compiling CSP. The third is a general reformulation technique that allows enumerating all equivalent formulations of a CSP


Advisor(s):
Faltings, Boi V.
Year:
1998
Publisher:
Lausanne, EPFL
Laboratories:


Note: The status of this file is: EPFL only


 Record created 2005-03-16, last modified 2018-05-01

Texte intégral / Full text:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)