Weak Equivalence for Constraint Sets

van Denneheuvel, Sieger; Kwast, Karen L.

Weak Equivalence for Constraint Sets

Download BibTeX Cite

Proceedings of the Twelfth International Joint Conference on Artificial Intelligence. Logic Programming. Pages 851-855.

Abstract

We describe a generalization of equivalence between constraint sets, called weak equivalence. This new equivalence relation takes into account that not all variables have the same function in a constraint set and therefore distinguishes between restriction variables and intermediate variables. We explore the properties of weak equivalence and its underlying notion of weak implication with an axiomatic approach. In addition a complete set of axioms for weak implication is presented. With examples derived from the declarative rule language RL we show the applicability of weak equivalence to constraint solving.

Sieger van Denneheuvel, and Karen L. Kwast. 1991. Weak Equivalence for Constraint Sets. In Proceedings of the Twelfth International Joint Conference on Artificial Intelligence, IJCAI-91. IJCAI, 851–855. https://ijcai.org/proceedings/1991/125

@inproceedings{ijcai1991p125,
  title     = {Weak Equivalence for Constraint Sets},
  author    = {van Denneheuvel, Sieger and Kwast, Karen L.},
  booktitle = {Proceedings of the Twelfth International Joint Conference on
               Artificial Intelligence, {IJCAI-91}},
  publisher = {International Joint Conferences on Artificial Intelligence},
  editor    = {John Mylopoulos and Ray Reiter},
  pages     = {851--855},
  year      = {1991},
  month     = {8},
  note      = {Logic Programming},
  url       = {https://ijcai.org/proceedings/1991/125},
}

TY  - CPAPER
TI  - Weak Equivalence for Constraint Sets
AU  - van Denneheuvel, Sieger
AU  - Kwast, Karen L.
T2  - Proceedings of the Twelfth International Joint Conference on Artificial Intelligence, IJCAI-91
PB  - International Joint Conferences on Artificial Intelligence
PY  - 1991
SP  - 851
EP  - 855
UR  - https://ijcai.org/proceedings/1991/125
ER  -