Results 1 to 10 of about 6,708,930 (288)
On Classifying Continuous Constraint Satisfaction Problems [PDF]
TheoretiCS, 2022 A continuous constraint satisfaction problem (CCSP) is a constraint satisfaction problem (CSP) with an interval domain $U \subset \mathbb{R}$. We engage in a systematic study to classify CCSPs that are complete of the Existential Theory of the Reals, i.e.
Tillmann Miltzow, Reinier F. Schmiermann
doaj +10 more sources
Invariants and Other Structural Properties of Biochemical Models as a Constraint Satisfaction Problem [PDF]
Algorithms for Molecular Biology, 2012 Background We present a way to compute the minimal semi-positive invariants of a Petri net representing a biological reaction system, as resolution of a Constraint Satisfaction Problem.
Soliman Sylvain
doaj +2 more sources
Locked Constraint Satisfaction Problems [PDF]
Physical Review Letters, 2008 4 pages, 2 ...
Zdeborová, Lenka, Mézard, Marc
openaire +4 more sources
Logical compactness and constraint satisfaction problems [PDF]
Logical Methods in Computer Science, 2017 We investigate a correspondence between the complexity hierarchy of constraint satisfaction problems and a hierarchy of logical compactness hypotheses for finite relational structures.
Danny Rorabaugh +2 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
The Approximability of Constraint Satisfaction Problems [PDF]
SIAM Journal on Computing, 2001 Summary: We study optimization problems that may be expressed as ``Boolean constraint satisfaction problems.'' An instance of a Boolean constraint satisfaction problem is given by m constraints applied to n Boolean variables. Different computational problems arise from constraint satisfaction problems depending on the nature of the ``underlying ...
Khanna, Sanjeev +3 more
openaire +2 more sources
Absorbing Subalgebras, Cyclic Terms, and the Constraint Satisfaction Problem [PDF]
Logical Methods in Computer Science, 2012 The Algebraic Dichotomy Conjecture states that the Constraint Satisfaction Problem over a fixed template is solvable in polynomial time if the algebra of polymorphisms associated to the template lies in a Taylor variety, and is NP-complete otherwise ...
Libor Barto, Marcin Kozik
doaj +1 more source
When the Decomposition Meets the Constraint Satisfaction Problem
IEEE Access, 2020 This paper explores the joint use of decomposition methods and parallel computing for solving constraint satisfaction problems and introduces a framework called Parallel Decomposition for Constraint Satisfaction Problems (PD-CSP).
Youcef Djenouri +5 more
doaj +1 more source
A finer reduction of constraint problems to digraphs [PDF]
Logical Methods in Computer Science, 2015 It is well known that the constraint satisfaction problem over a general relational structure A is polynomial time equivalent to the constraint problem over some associated digraph.
Jakub Bulín +3 more
doaj +1 more source
Compilation-Based Approaches to Parallel Planning: An Empirical Comparison
Proceedings of the International Florida Artificial Intelligence Research Society Conference, 2021 Automated planning deals with finding a sequence of actions, a plan, to reach a goal. One of the possible approaches to automated planning is a compilation of a planning problem to a Boolean satisfiability problem or to a constraint satisfaction problem,
Kristýna Pantůčková, Roman Barták
doaj +1 more source