601 search results - page 11 / 121 » CSP(M): Constraint Satisfaction Problem over Models |
179
click to vote
CSL
2003
Springer
15 years 11 months ago
2003
Springer
For a fixed countable homogeneous relational structure Γ we study the computational problem whether a given finite structure of the same signature homomorphically maps to Γ. T...
257
click to vote
CP
2009
Springer
16 years 6 months ago
2009
Springer
Abstract. In this paper, we show how model-checking can be generalized to temporal logic constraint solving, by considering temporal logic formulae with free variables over some do...
156
click to vote
ECSQARU
2009
Springer
15 years 3 months ago
2009
Springer
We claim that divisible residuated lattices (DRLs) can act as a unifying evaluation framework for soft constraint satisfaction problems (soft CSPs). DRLs form the algebraic semanti...
151
click to vote
CSL
2006
Springer
15 years 9 months ago
2006
Springer
In this article, we study the quantified constraint satisfaction problem (QCSP) over infinite domains. We develop a technique called collapsibility that allows one to give strong c...
128
click to vote
JAIR
2007
15 years 5 months ago
2007
In this paper, we study the possibility of designing non-trivial random CSP models by exploiting the intrinsic connection between structures and typical-case hardness. We show tha...