This paper summarizes a constraint solving technique that can be used to reason effectively in the scope of a constraint language that supersedes common finite domain languages available in the literature. The first part of this paper motivates the presented work and introduces the constraint language, namely Hereditarily Finite Sets (HFS) language. Then, the proposed constraint solver is detailed in terms of a set of rewrite rules which exploit finite domain reasoning within the HFS language. The presented approach achieves good efficiency without loosing the desired correctness and completeness properties that other solvers for HFS provide.
Generalizing Finite Domain Constraint Solving / Bergenti, Federico; DAL PALU', Alessandro; Rossi, Gianfranco. - STAMPA. - (2008), pp. 1-15. (Intervento presentato al convegno Convegno Italiano di Logica Computazionale tenutosi a Perugia nel 10-12 Luglio 2008).
Generalizing Finite Domain Constraint Solving
BERGENTI, Federico;DAL PALU', Alessandro;ROSSI, Gianfranco
2008-01-01
Abstract
This paper summarizes a constraint solving technique that can be used to reason effectively in the scope of a constraint language that supersedes common finite domain languages available in the literature. The first part of this paper motivates the presented work and introduces the constraint language, namely Hereditarily Finite Sets (HFS) language. Then, the proposed constraint solver is detailed in terms of a set of rewrite rules which exploit finite domain reasoning within the HFS language. The presented approach achieves good efficiency without loosing the desired correctness and completeness properties that other solvers for HFS provide.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
