Entailment of Finite Domain Constraints - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 1994

Entailment of Finite Domain Constraints

Björn Carlson
  • Fonction : Auteur
Daniel Diaz

Résumé

Using a glass-box theory of finite domain constraints, FD, we show how the entailment of user-defined constraints can be expressed by antimonotone FD constraints. We also provide an algorithm for checking the entailment and consistency of FD constraints. FD is shown to be expressive enough to allow the definition of arithmetical constraints, as well as nontrivial symbolic constraints, that are normally built in to CLP systems. In particular, we use conditional FD constraints, which exploit entailment checking, to define symbolic constraints. Thus, we claim that a glass-box system such as FD is expressive enough to capture the essence of finite domain constraint programming
Fichier non déposé

Dates et versions

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

Identifiants

  • HAL Id : hal-00668885 , version 1

Citer

Björn Carlson, Matts Carlsson, Daniel Diaz. Entailment of Finite Domain Constraints. International Conference on Logic Programming, 1994, Santa Margherita, Italy. 15 p. ⟨hal-00668885⟩

Collections

UNIV-PARIS1 CRI
42 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More