2001/09/24 by Antonio J. Fernández, Antonio J. Fernandez, Fernandez, Antonio J. +2
Computer Science · #Advanced Database Systems and Queries #Constraint Satisfaction and Optimization #Data Management and Algorithms #cs.PL
paper · pdf · doi:10.48550/arxiv.cs/0109060
18 pages, 2 figures, Proceedings ERCIM Workshop on Constraints (Prague, June 2001)
arxiv created 2001/09/24 · arxiv updated 2009/11/30
This paper focuses on the branching process for solving any constraint satisfaction problem (CSP). A parametrised schema is proposed that (with suitable instantiations of the parameters) can solve CSP's on both finite and infinite domains. The paper presents a formal specification of the schema and a statement of a number of interesting properties that, subject to certain conditions, are satisfied by any instances of the schema. It is also shown that the operational procedures of many constraint systems including cooperative systems) satisfy these conditions. Moreover, the schema is also used to solve the same CSP in different ways by means of different instantiations of its parameters.