4617 search results - page 714 / 924 » Automation of Diagrammatic Reasoning |
167
click to vote
LICS
2006
IEEE
16 years 1 months 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...
205
click to vote
LICS
2006
IEEE
16 years 1 months 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....
155
click to vote
LICS
2006
IEEE
16 years 1 months 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...
206
click to vote
LICS
2006
IEEE
16 years 1 months 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...
199
click to vote
LICS
2006
IEEE
16 years 1 months ago
2006
IEEE
Hoare logic is bedevilled by complex but coarse side conditions on the use of variables. We define a logic, free of side conditions, which permits more precise statements of a pr...