Results 31 to 40 of about 15,021 (304)
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 improved constraint satisfaction adaptive neural network for job-shop scheduling [PDF]
, 2010 Copyright @ Springer Science + Business Media, LLC 2009This paper presents an improved constraint satisfaction adaptive neural network for job-shop scheduling problems.
Yang, S +11 more
core +1 more source
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
Compiling constraint satisfaction problems
Artificial Intelligence, 1999 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rainer Weigel, Boi Faltings
openaire +2 more sources
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
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
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 +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
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