11345 search results - page 1680 / 2269 » Foundations of Computer Science |
160
click to vote
LFCS
2007
Springer
16 years 18 days ago
2007
Springer
Interval-based temporal logics are an important research area in computer science and artificial intelligence. In this paper we investigate decidability and expressiveness issues ...
136
Voted
MFCS
2007
Springer
16 years 17 days ago
2007
Springer
Abstract. We investigate the structure of the set of gapped motifs (repeated patterns with don’t cares) of a given string of symbols. A natural equivalence classification is int...
163
Voted
MFCS
2007
Springer
16 years 17 days ago
2007
Springer
Abstract. We introduce a new general polynomial-time constructionthe fibre construction- which reduces any constraint satisfaction problem CSP(H) to the constraint satisfaction pr...
134
click to vote
MFCS
2007
Springer
16 years 17 days ago
2007
Springer
Following recent works connecting two-variable logic to circuits and monoids, we establish, for numerical predicate sets P satisfying a certain closure property, a one-to-one corre...
161
Voted
MFCS
2007
Springer
16 years 17 days ago
2007
Springer
The notion of distance constrained graph labelings, motivated by the Frequency Assignment Problem, reads as follows: A mapping from the vertex set of a graph G = (V, E) into an in...