Results 21 to 30 of about 5,971,608 (284)
Graph Neural Networks for Maximum Constraint Satisfaction
Frontiers in Artificial Intelligence, 2021 Many combinatorial optimization problems can be phrased in the language of constraint satisfaction problems. We introduce a graph neural network architecture for solving such optimization problems.
Jan Tönshoff +3 more
doaj +1 more source
The complexity of global cardinality constraints [PDF]
Logical Methods in Computer Science, 2010 In a constraint satisfaction problem (CSP) the goal is to find an assignment of a given set of variables subject to specified constraints. A global cardinality constraint is an additional requirement that prescribes how many variables must be assigned a ...
Andrei A. Bulatov, Daniel Marx
doaj +1 more source
Compiling constraint satisfaction problems
Artificial Intelligence, 1999 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Weigel, R., Faltings, B.
openaire +3 more sources
Automated static symmetry breaking in constraint satisfaction problems [PDF]
, 2011 Variable symmetries in constraint satisfaction problems can be broken by adding lexicographic ordering constraints. Existing general methods of generating such sets of ordering constraints can produce a huge number of additional constraints. This adds
Grayland, Andrews
core +2 more sources
Sensitive instances of the Constraint Satisfaction Problem
CoRR, 2020 We investigate the impact of modifying the constraining relations of a Constraint Satisfaction Problem (CSP) instance, with a fixed template, on the set of solutions of the instance. More precisely we investigate sensitive instances: an instance of the CSP is called sensitive, if removing any tuple from any constraining relation invalidates some ...
Barto, Libor +3 more
openaire +7 more sources
IET Control Theory & Applications, 2023 This paper aims to discuss the approach of constrained modified feedback linearization model predictive control for the spacecraft simulator. By utilizing the high accuracy and constrained properties of model predictive control (MPC), an optimum MPC is ...
Maria Khodaverdian, Maryam Malekzadeh
doaj +1 more source
Distance Constraint Satisfaction Problems [PDF]
Information and Computation, 2010 We study the complexity of constraint satisfaction problems for templates $Γ$ that are first-order definable in $(\Bbb Z; succ)$, the integers with the successor relation. Assuming a widely believed conjecture from finite domain constraint satisfaction (we require the tractability conjecture by Bulatov, Jeavons and Krokhin in the special case of ...
Manuel Bodirsky +4 more
openaire +2 more sources
IEEE Access, 2017 Arc consistency is the most popular filtering technique for solving constraint satisfaction problems. Constraint check plays a central role in establishing arc consistency.
Hongbo Li
doaj +1 more source
IEEE Access, 2023 Striking a balance between objective optimization and constraint satisfaction is essential for solving constrained multi-objective optimization problems (CMOPs).
Kaiwen Zhao, Peng Wang, Xiangrong Tong
doaj +1 more source
Quantum-accelerated constraint programming [PDF]
Quantum, 2021 Constraint programming (CP) is a paradigm used to model and solve constraint satisfaction and combinatorial optimization problems. In CP, problems are modeled with constraints that describe acceptable solutions and solved with backtracking tree search ...
Kyle E. C. Booth +4 more
doaj +1 more source