Sciweavers

226 search results - page 11 / 46
» GAC on Conjunctions of Constraints
Sort
View
CONSTRAINTS
2008
70views more  CONSTRAINTS 2008»
13 years 7 months ago
Reformulating Table Constraints using Functional Dependencies - An Application to Explanation Generation
We present a novel approach to automatically reformulating constraints defined as tables of allowed assignments to variables. Constraints of this form are common in a variety of se...
Hadrien Cambazard, Barry O'Sullivan
LICS
1999
IEEE
13 years 12 months ago
Entailment of Atomic Set Constraints is PSPACE-Complete
The complexity of set constraints has been extensively studied over the last years and was often found quite high. At the lower end of expressiveness, there are atomic set constra...
Joachim Niehren, Martin Müller, Jean-Marc Tal...
OL
2011
177views Neural Networks» more  OL 2011»
12 years 10 months ago
Exploiting vector space properties to strengthen the relaxation of bilinear programs arising in the global optimization of proce
In this paper we present a methodology for finding tight convex relaxations for a special set of quadratic constraints given by bilinear and linear terms that frequently arise in ...
Juan P. Ruiz, Ignacio E. Grossmann
ADBIS
2004
Springer
193views Database» more  ADBIS 2004»
13 years 11 months ago
Quantifier-Elimination for the First-Order Theory of Boolean Algebras with Linear Cardinality Constraints
Abstract. We present for the first-order theory of atomic Boolean algebras of sets with linear cardinality constraints a quantifier elimination algorithm. In the case of atomic Boo...
Peter Z. Revesz
IJCAI
1997
13 years 9 months ago
Constraint Satisfaction over Connected Row Convex Constraints
This paper studies constraint satisfaction over connected row-convex (CRC) constraints. It shows that CRC constraints are closed under composition, intersection, and transposition...
Yves Deville, Olivier Barette, Pascal Van Hentenry...