Matthias Zytnicki
ABSTRACT
The weighted constraint satisfaction problem (WCSP) is a soft constraint framework with a wide range of applications. Most current complete solvers can be described as a depth-first branch and bound search that maintains some form of local consistency during the search. However, the known consistencies are unable to solve problems with huge domains because of their time and space complexities. In this paper, we adapt the 2B-consistency, a weaker form of arc consistency well-known in classic CSPs, into the bound arc consistency and we provide several algorithms to enforce it.
- S. Bistarelli, P. Codognet, Y. Georget, and F. Rossi. Labeling and partial local consistency for soft constraint programming. In Proc. PADL 2000, pages 230--248, 2000.]] Google Scholar
Digital Library
- M. Cooper and T. Schiex. Arc consistency for soft constraints. Artificial Intelligence, 154:199--227, 2004.]] Google ScholarDigital Library
- D. Gautheret, F. Major, and R. Cedergren. Pattern searching/alignment with RNA primary and secondary structures: an effective descriptor for tRNA. Comp. Appl. Biosc., 6:325--331, 1990.]]Google Scholar
- J. Gorodkin, L. L. Heyer, and G. D. Stormo. Finding the most significant common sequence and structure motifs in a set of RNA sequences. Nucleic Acids Research, 25:3724--3732, 1997.]]Google ScholarCross Ref
- P. V. Hentenryck, Y. Deville, and C.-M. Teng. A generic arc-consistency algorithm and its specializations. Artificial Intelligence, 57(2-3):291--321, 1992.]] Google ScholarDigital Library
- L. Khatib, P. Morris, R. Morris, and F. Rossi. Temporal constraint reasoning with preferences. In Proc. IJCAI 2001, pages 322--327, 2001.]]Google Scholar
- J. Larrosa. Node and arc consistency in weighted CSP. In Proc. AAAI'02, 2002.]] Google ScholarDigital Library
- J. Larrosa, P. Meseguer, and T. Schiex. Maintaining reversible DAC for Max-CSP. Artificial Intelligence, 17(1):149--163, 1999.]] Google ScholarDigital Library
- J. Larrosa and T. Schiex. Solving Weighted CSP by Maintaining Arc-consistency. Artificial Intelligence, 159(1-2):1--26, 2004.]] Google ScholarDigital Library
- O. Lhomme. Consistency techniques for numeric CSPs. In Proc. IJCAI 1993, pages 232--238, 1993.]]Google Scholar
- T. Petit, J.-C. Régin, and C. Bessière. Meta-constraints on violations for over constrained problems. In Proc. ICTAI'00, pages 358--365, 2000.]] Google ScholarDigital Library
- T. Petit, J.-C. Régin, and C. Bessière. Range-based algorithm for Max-CSP. In Proc. CP'02, pages 280--294, 2002.]] Google ScholarDigital Library
- T. Schiex. Arc consistency for soft constraints. In Proc. CP'00, pages 411--424, 2000.]] Google ScholarDigital Library
- T. Schiex, H. Fargier, and G. Verfaillie. Valued constraint satisfaction problems: Hard and easy problems. In Proc. IJCAI 1995, 1995.]]Google ScholarDigital Library
Index Terms
- A new local consistency for weighted CSP dedicated to long domains
Recommendations
Solving weighted CSP by maintaining arc consistency
Recently, a general definition of arc consistency (AC) for soft constraint frameworks has been proposed by T. Schiex [Proc. CP-2000, Singapore, 2000, pp. 411-424]. In this paper we specialize this definition to weighted CSP and introduce two O(ed3) ...
Soft arc consistency revisited
The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. It has applications in Artificial Intelligence, Operations Research, Bioinformatics and has ...
Local consistency for extended CSPs
We extend the framework of Constraint Satisfaction Problems to make it more suitable for/applicable to modern constraint programming languages where both constraint satisfaction and constraint solving have a role. Some rough principles for local ...
Comments