Results 31 to 40 of about 5,971,608 (284)
Binarisation for Valued Constraint Satisfaction Problems [PDF]
SIAM Journal on Discrete Mathematics, 2017 Subsumes 1507 ...
David A. Cohen +5 more
openaire +8 more sources
Linear Datalog and Bounded Path Duality of Relational Structures [PDF]
Logical Methods in Computer Science, 2005 In this paper we systematically investigate the connections between logics with a finite number of variables, structures of bounded pathwidth, and linear Datalog Programs.
Victor Dalmau
doaj +1 more source
Equivalence Constraint Satisfaction Problems.
Proceedings of CSL, 2012 The following result for finite structures Gamma has been conjectured to hold for all countably infinite omega-categorical structures Gamma: either the model-complete core Delta of Gamma has an expansion by finitely many constants such that the pseudovariety generated by its polymorphism algebra contains a two-element algebra all of whose operations ...
Manuel Bodirsky, Michal Wrona
openaire +4 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
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 +3 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 +6 more sources
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
Using cooperative coevolution in large-scale black-box constraint satisfaction problems [PDF]
ITM Web of ConferencesSolving constrained large-scale global optimization problems poses a challenging task. In these problems with constraints, when the number of variables is measured in the thousands, when the constraints are presented in the form of a black box, and ...
Vakhnin Aleksei, Novikov Zakhar
doaj +1 more source
Argumentation Frameworks as Constraint Satisfaction Problems [PDF]
Annals of Mathematics and Artificial Intelligence, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Leila Amgoud, Caroline Devred
openaire +2 more sources
An invitation to the promise constraint satisfaction problem
ACM SIGLOG News, 2022 The study of the complexity of the constraint satisfaction problem (CSP), centred around the Feder-Vardi Dichotomy Conjecture, has been very prominent in the last two decades. After a long concerted effort and many partial results, the Dichotomy Conjecture has been proved in 2017 independently by Bulatov and Zhuk.
Andrei A. Krokhin, Jakub Oprsal
openaire +3 more sources