A Unified Framework for Solving Boolean, Integer and Set Constraints

Jianyang Zhou 1
1 PROTHEO - Constraints, automatic deduction and software properties proofs
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : 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.
Type de document :
Communication dans un congrès
Third International Conference on Systems Science and Systems Engineering, 1998, Beijing, Chine, 6 p, 1998
Liste complète des métadonnées

https://hal.inria.fr/inria-00098612
Contributeur : Publications Loria <>
Soumis le : lundi 25 septembre 2006 - 17:03:57
Dernière modification le : jeudi 11 janvier 2018 - 06:19:58

Identifiants

  • HAL Id : inria-00098612, version 1

Collections

Citation

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, 1998. 〈inria-00098612〉

Partager

Métriques

Consultations de la notice

154