J-C. Régin, T. Petit, C. Bessière, J-F. Puget  Home/Search
Context Related
| lirmm.fr/~bessiere/stock/cp00.ps.gz lirmm.fr/~tpetit/./resCP2000.ps lirmm.fr/~bessiere/stock/cp00.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: lirmm.fr/~bessiere/publis (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper we present a new framework for over constrained problems. We suggest to define an over-constrained network as a global constraint. We introduce two new lower bounds of the number of violations, without making any assumption on the arity of constraints. (Update)
Context of citations to this paper: More
...[9] In this paper, we are interested in solving such problems. Existing algorithms dedicated to over constrained problems [6, 15, 8, 14, 13] are generic. However, the use of constraint speci c ltering algorithms is generally required to solve real world applications...
...number of constraint violations. The best solving algorithm for Max CSP, PFC MRDAC [1] has been extended to the non binary case [4, 5, 3]. Moreover, in [4, 5] it has been shown that a Max CSP can be encoded through a global constraint. When we de ne a Max CSP as a global...
Cited by: More
Integrating algorithms for Weighted CSP in a Constraint.. - Lemaitre, Verfaillie.. (Correct)
A Hyper-Arc Consistency Algorithm for the Soft Alldierent.. - van Hoeve (2004) (Correct)
Lower Bounds for Non-binary Constraint Optimization Problems - Meseguer, Larrosa, Sanchez (2001) (Correct)
Similar documents (at the sentence level):
30.3%: New Lower Bounds of Constraint Violations for.. - Régin, Petit.. (2001) (Correct)
6.7%: Range-Based Algorithm for Max-CSP - Thierry Petit Jean-Charles (Correct)
Active bibliography (related documents): More All
0.5: Explanation-Based Generalization for Negation as Failure and.. - Schrödl (1996) (Correct)
0.2: Knowledge-based Locomotive Planning for the Swedish Railway - Scholz (1998) (Correct)
0.2: Optimal Distributed Arc-Consistency - Youssef Hamadi Thales (1999) (Correct)
Similar documents based on text: More All
0.8: Meta-Constraints on Violations for Over Constrained.. - Petit, Régin.. (2000) (Correct)
0.7: Specific Filtering Algorithms for Over-Constrained Problems - Petit, Regin, Bessiere (2001) (Correct)
0.6: Enforcing Arc Consistency on Global Constraints By.. - Bessière.. (1999) (Correct)
Related documents from co-citation: More All
4: Maintaining reversible DAC for Max-CSP (context) - Larrosa, Meseguer et al. - 1999
4: Partial Constraint Satisfaction - Freuder, Wallace - 1992
4: Arc consistency for soft constraints - Schiex
BibTeX entry: (Update)
J.-C. Regin, T. Petit, C. Bessiere, and J.-F. Puget. An original constraint based approach for solving over constrained prolems. Proceedings CP, pages 543-548, 2000. http://citeseer.ist.psu.edu/egin00original.html More
@inproceedings{ regin00:over-constrained:inp,
title={An Original Constraint Based Approach for Solving Over Constrained Problems},
author={Jean-Charles R{\'e}gin, Thierry Petit, Christian Bessi{\`e}re, Jean-Francois Puget},
abstract={In this paper we present a new framework for over constrained problems.
We suggest to define an over-constrained network as a global constraint.
We introduce two new lower bounds of the number of violations, without
making any assumption on the arity of constraints. },
booktitle={Proceedings of the Sixth International Conference on Principles and Practice
of Constraint Programming (CP 2000)},
year={2000},
month={September 18-21},
publisher={Springer},
editor={Rina Dechter},
pages={543-547},
url={citeseer.ist.psu.edu/egin00original.html},
url={http://www.lirmm.fr/~bessiere/stock/cp00.ps.gz},
isbn={3-540-41053-8},
volume={1894},
series={Lecture Notes in Computer Science},
note={poster} }
Citations (may not include all citations):311 Partial constraint satisfaction - Freuder, Wallace - 1992
44 Semiring-based csps and valued csps: Frameworks (context) - Bistarelli, Montanari et al. - 1999
28 Maintaining reversible dac for max-csp (context) - Larrosa, Meseguer et al. - 1999
10 Directed arc consistency preprocessing as a strategy for max.. - Wallace - 1994
9 Partition-based lower bound for max-csp (context) - Larrossa, Meseguer - 1999
9 Explanation-based generalization of failures (context) - de Siqueira, Puget - 1988
5 Problem classication scheme for nite domain constraint solvi.. (context) - Simonis - 1996
Documents on the same site (http://www.lirmm.fr/~bessiere/publis.html): More
Arc Consistency for General Constraint Networks.. - Bessière.. (1997) (Correct)
Compilation of Intractable Problems and Its Application to.. - Liberatore (1998) (Correct)
MAC and Combined Heuristics: Two Reasons to Forsake FC .. - Bessière.. (1996) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC