Weak equivalence for constraint sets

Authors:
Sieger Van Denneheuvel;Karen L. Kwast
Affiliations:
Department of Mathematics and Computer Science, University of Amsterdam, Amsterdam;Department of Mathematics and Computer Science, University of Amsterdam, Amsterdam
Venue:
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 2
Year:
1991

Citing 3
Cited 0

A semantical model for integration and modularization of rules

Proceedings of the 12th symposium on Mathematical foundations of computer science 1986
Constraint programming languages: their specification and generation

Constraint programming languages: their specification and generation
Mathematica: a system for doing mathematics by computer

Mathematica: a system for doing mathematics by computer

Quantified Score

Hi-index	0.00

Visualization

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.