Implementing Constraint Relaxation over Finite Domains using ATMS

by: Narendra Jussien, Patrice Boizumault

edited by: Michael Jampel, Eugene Freuder, Michael Maher

No. 1106. (1996), pp. 265-280.

View FullText article

CiteSeer (at Penn State), CiteSeer (at MIT), CiteSeer (at Zurich), CiteSeer (at Singapore)

Reviews [Write a review of this article]

There are no reviews of this article

Find related articles from these CiteULike users

woutervdb

Find related articles with these CiteULike tags

atms, constraint, csp, relaxation

Abstract

Many real-life Constraint Satisfaction Problems are over-constrained. In order to provide some kind of solution for such problems, this paper proposes a constraint relaxation mechanism fully integrated with the constraint solver. Such a constraint relaxation system must be able to perform two fundamental tasks: identification of constraints to relax and efficient constraint suppression. Assumption-based Truth Maintenance Systems propose a uniform framework to tackle those requirements. The main ...

@inproceedings{citeulike:1196366, abstract = {Many real-life Constraint Satisfaction Problems are over-constrained. In order to provide some kind of solution for such problems, this paper proposes a constraint relaxation mechanism fully integrated with the constraint solver. Such a constraint relaxation system must be able to perform two fundamental tasks: identification of constraints to relax and efficient constraint suppression. Assumption-based Truth Maintenance Systems propose a uniform framework to tackle those requirements. The main ...}, author = {Jussien, Narendra and Boizumault, Patrice }, booktitle = {Over-Constrained Systems}, citeulike-article-id = {1196366}, editor = {Jampel, Michael and Freuder, Eugene and Maher, Michael }, keywords = {atms, constraint, csp, relaxation}, number = {1106}, pages = {265--280}, posted-at = {2007-03-29 16:35:34}, priority = {0}, publisher = {Springer-Verlag}, series = {Lecture Notes in Computer Science}, title = {Implementing Constraint Relaxation over Finite Domains using ATMS}, url = {http://citeseer.ist.psu.edu/jussien96implementing.html}, year = {1996} }

RIS record

TY - CONF ID - citeulike:1196366 L3 - citeulike-article-id:1196366 TI - Implementing Constraint Relaxation over Finite Domains using ATMS T2 - Over-Constrained Systems SE - Lecture Notes in Computer Science IS - 1106 SP - 265 EP - 280 PB - Springer-Verlag N2 - Many real-life Constraint Satisfaction Problems are over-constrained. In order to provide some kind of solution for such problems, this paper proposes a constraint relaxation mechanism fully integrated with the constraint solver. Such a constraint relaxation system must be able to perform two fundamental tasks: identification of constraints to relax and efficient constraint suppression. Assumption-based Truth Maintenance Systems propose a uniform framework to tackle those requirements. The main ... KW - atms KW - constraint KW - csp KW - relaxation AU - Jussien, Narendra AU - Boizumault, Patrice A2 - Jampel, Michael A2 - Freuder, Eugene A2 - Maher, Michael PY - 1996/// UR - http://citeseer.ist.psu.edu/jussien96implementing.html ER -

RIS BibTeX