Weak Equivalence for Constraint Sets
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. 1
Cite
Text
van Denneheuvel and Kwast. "Weak Equivalence for Constraint Sets." International Joint Conference on Artificial Intelligence, 1991.Markdown
[van Denneheuvel and Kwast. "Weak Equivalence for Constraint Sets." International Joint Conference on Artificial Intelligence, 1991.](https://mlanthology.org/ijcai/1991/vandenneheuvel1991ijcai-weak/)BibTeX
@inproceedings{vandenneheuvel1991ijcai-weak,
title = {{Weak Equivalence for Constraint Sets}},
author = {van Denneheuvel, Sieger and Kwast, Karen L.},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {1991},
pages = {851-856},
url = {https://mlanthology.org/ijcai/1991/vandenneheuvel1991ijcai-weak/}
}