Results 31 to 40 of about 15,438 (311)
Dualities for Constraint Satisfaction Problems [PDF]
, 2008 In a nutshell, a duality for a constraint satisfaction problem equates the existence of one homomorphism to the non-existence of other homomorphisms. In this survey paper, we give an overview of logical, combinatorial, and algebraic aspects of the following forms of duality for constraint satisfaction problems: finite duality, bounded pathwidth duality,
Andrei A. Bulatov +2 more
openaire +2 more sources
Constraint Satisfaction Problems on Intervals and Lengths [PDF]
SIAM Journal on Discrete Mathematics, 2004 Summary: We study interval-valued Constraint Satisfaction Problems (CSPs), in which the aim is to find an assignment of intervals to a given set of variables subject to constraints on the relative positions of intervals. Many well-known problems such as INTERVAL GRAPH RECOGNITION and INTERVAL SATISFIABILITY can be considered as examples of such CSPs ...
Andrei A. Krokhin +2 more
openaire +4 more sources
Parameterized Constraint Satisfaction Problems: a Survey [PDF]
, 2017 We consider constraint satisfaction problems parameterized above or below guaranteed values. One example is MaxSat parameterized above m/2: given a CNF formula F with m clauses, decide whether there is a truth assignment that satisfies at least m/2 + k ...
Gutin, Gregory, Yeo, Anders
core +1 more source
Constraint Solving Approach to Schedulability Analysis in Real-Time Systems
IEEE Access, 2018 In real-time systems, the satisfaction of real-time properties is as important as the correct behavior of the function. There are many safety-critical systems among the real-time systems, and thus, the satisfaction of real-time properties is directly ...
Hyuk Lee, Jin-Young Choi
doaj +1 more source
Google vs IBM: A Constraint Solving Challenge on the Job-Shop Scheduling Problem [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 The job-shop scheduling is one of the most studied optimization problems from the dawn of computer era to the present day. Its combinatorial nature makes it easily expressible as a constraint satisfaction problem.
Giacomo Da Col, Erich Teppan
doaj +1 more source
On amenability of constraint satisfaction problems
CoRR, 2020 Recent results show that a constraint satisfaction problem (CSP) defined over rational numbers with their natural ordering has a solution if and only if it has a definable solution. The proof uses advanced results from topology and modern model theory. The aim of this paper is threefold.
openaire +2 more sources
Discrete Temporal Constraint Satisfaction Problems [PDF]
Journal of the ACM, 2018 A discrete temporal constraint satisfaction problem is a constraint satisfaction problem (CSP) over the set of integers whose constraint language consists of relations that are first-order definable over the order of the integers.
Manuel Bodirsky +2 more
openaire +4 more sources
A Novel Strategy of Combining Variable Ordering Heuristics for Constraint Satisfaction Problems
IEEE Access, 2018 Variable ordering heuristic plays a central role in solving constraint satisfaction problems. Many heuristics have been proposed and well-studied.
Hongbo Li, Zhanshan Li
doaj +1 more source
Binarisation for Valued Constraint Satisfaction Problems [PDF]
SIAM Journal on Discrete Mathematics, 2017 Subsumes 1507 ...
David A. Cohen +5 more
openaire +6 more sources
Independent Constraint Satisfaction and its Application to Sewerage System Control [PDF]
, 2003 Most of real world problems contain complex and various constraints, and this goes for the sewerage system control problem, our target. For handling them, the penalty depending on the degree of violation is often used.
Nagaiwa, Akihiro +3 more
core +1 more source