A Strategy Language for Solving CSPs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 1998

A Strategy Language for Solving CSPs

Abstract

In this paper we propose a strategy language for designing single constraint solvers as well as their collaborations. Based on the notions of constraint filter, separator, and sorter, we define basic strategy operators that allow us to specify single solvers and their collaboration in a uniform way. We exemplify the use of this language by specifying some techniques for solving constraints over finite and real domains.

Domains

Other [cs.OH]
No file

Dates and versions

inria-00098511 , version 1 (25-09-2006)

Identifiers

  • HAL Id : inria-00098511 , version 1

Cite

Carlos Castro, Eric Monfroy. A Strategy Language for Solving CSPs. Proceedings of The Third Workshop of the Working Group on Constraints of the European Research Consortium for Informatics & Mathematics, ERCIM'98, CWI Amsterdam, Pays Bas, 1998, Amsterdam, Pays Bas, 15 p. ⟨inria-00098511⟩
53 View
0 Download

Share

Gmail Facebook X LinkedIn More