Boolean Constraint Solving Using clp(FD) - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 1993

Boolean Constraint Solving Using clp(FD)

Résumé

We present a boolean constraint logic language clp(B/FD) built upon a language over finite domains clp(FD) which uses a local propagation constraint solver. It is based on a single primitive constraint which allows the boolean solver to be encoded at a low-level. The boolean solver obtained in this way is both very simple and very efficient: on average it is eight times faster than the CHIP propagationbased boolean solver, i.e. nearly an order of magnitude faster, and infinitely better than the CHIP boolean unification solver. It also performs on average several times faster than special-purpose stand-alone boolean solvers
Fichier non déposé

Dates et versions

hal-00668897 , version 1 (10-02-2012)

Identifiants

  • HAL Id : hal-00668897 , version 1

Citer

Philippe Codognet, Daniel Diaz. Boolean Constraint Solving Using clp(FD). International Logic Programming Symposium, 1993, Vancouver, British Columbia, Canada. 15 p. ⟨hal-00668897⟩
83 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More