{"type":"ScholarlyArticle","title":"Weak Equivalence for Constraint Sets","authors":[{"name":"Sieger van Denneheuvel","slug":"sieger-van-denneheuvel","given":"Sieger","family":"van Denneheuvel","affiliation":""},{"name":"Karen L. Kwast","slug":"karen-l-kwast","given":"Karen L.","family":"Kwast","affiliation":""}],"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.","doi":null,"url":"https://ijcai.org/proceedings/1991/125","pdf":"https://ijcai.org/proceedings/1991/0125.pdf","markdown":"https://ijcai.org/proceedings/1991/125.md","bibtex":"https://ijcai.org/proceedings/1991/bibtex/125","volume":{"slug":"1991","title":"Proceedings of the Twelfth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1991","url":"https://ijcai.org/proceedings/1991/","year":1991,"location":"Sydney, New South Wales, Australia","dates":"24-30 August 1991","editors":"John Mylopoulos and Ray Reiter","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Logic Programming","track":"Logic Programming","number":125,"pages":{"first":851,"last":855},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}