11345 search results - page 1684 / 2269 » Foundations of Computer Science |
168
click to vote
LICS
2006
IEEE
16 years 13 days ago
2006
IEEE
— In a data word each position carries a label from a finite alphabet and a data value from some infinite domain. These models have been already considered in the realm of semi...
144
Voted
LICS
2006
IEEE
16 years 13 days ago
2006
IEEE
Constraint languages that arise from finite algebras have recently been the object of study, especially in connection with the Dichotomy Conjecture of Feder and Vardi. An importa...
180
click to vote
LICS
2006
IEEE
16 years 13 days ago
2006
IEEE
Logical properties of iterations of relational structures are studied and these decidability results are applied to the model checking of a powerful extension of pushdown systems....
136
click to vote
LICS
2006
IEEE
16 years 13 days ago
2006
IEEE
Abstract. We describe simple algebraic and combinatorial characterisations of finite relational core structures admitting finitely many obstructions. As a consequence, we show th...
191
click to vote
LICS
2006
IEEE
16 years 13 days ago
2006
IEEE
Treewidth measures the ”tree-likeness” of structures. Many NP-complete problems, e.g., propositional satisfiability, are tractable on bounded-treewidth structures. In this wo...