Results 31 to 40 of about 6,708,930 (288)
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
09441 Executive Summary – The Constraint Satisfaction Problem: Complexity and Approximability [PDF]
, 2010 The seminar brought together forty researchers from di®erent highly advanced areas of constraint satisfaction and with complementary ex- pertise (logical, algebraic, combinatorial, probabilistic aspects). The list of participants contained both senior
Krokhin, Andrei +3 more
core +1 more source
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
Constraint Satisfaction Problems over Numeric Domains [PDF]
, 2017 We present a survey of complexity results for constraint satisfaction problems (CSPs) over the integers, the rationals, the reals, and the complex numbers.
Mamino, Marcello, Bodirsky, Manuel
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
Non-model based structural damage assessment using improved analytical redundancy relations
Journal of Low Frequency Noise, Vibration and Active Control, 2020 A damage assessment problem can be stated as a constraint satisfaction problem utilizing the translational and rotational displacements of a structure as measurements.
Sheng-En Fang, Bao Zhang
doaj +1 more source
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
Counting Constraint Satisfaction Problems [PDF]
, 2017 This chapter surveys counting Constraint Satisfaction Problems (counting CSPs, or #CSPs) and their computational complexity. It aims to provide an introduction to the main concepts and techniques, and present a representative selection of results and ...
Jerrum, Mark
core +1 more source
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
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