250 search results - page 12 / 50 » The complexity of temporal constraint satisfaction problems |
103
click to vote
DAGSTUHL
2006
15 years 1 months ago
2006
Abstract. The Galois connection involving polymorphisms and coclones has received a lot of attention in regard to constraint satisfaction problems. However, it fails if we are inte...
176
click to vote
CP
2009
Springer
16 years 9 days 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...
CSL
2006
Springer
15 years 3 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...
CIE
2008
Springer
14 years 11 months ago
2008
Springer
We study the complexity of the model checking problem, for fixed models A, over certain fragments L of first-order logic, obtained by restricting which of the quantifiers and boole...
113
click to vote
CSL
2003
Springer
15 years 4 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...