A Unified Framework for Solving Boolean, Integer and Set Constraints - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 1998

A Unified Framework for Solving Boolean, Integer and Set Constraints

Résumé

In this short paper, a unified framework for solving Boolean, integer and set constraints is presented. The computation model for solving conjunctions of primitive constraints, possibly with existential and universal quantifications, is described using rewrite rules. An important feature of the constraint solving model is that a variable's domain (set of integers) can be a constrained variable ({\sl set variable}). Based on such a strong extension, set constraints and dynamic constraints are introduced. Integer constraints, Boolean logic and set reasoning are combined perfectly in a single constraint solver.
Fichier non déposé

Dates et versions

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

Identifiants

  • HAL Id : inria-00098612 , version 1

Citer

Jianyang Zhou. A Unified Framework for Solving Boolean, Integer and Set Constraints. Third International Conference on Systems Science and Systems Engineering, 1998, Beijing, Chine, 6 p. ⟨inria-00098612⟩
72 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More