887 search results - page 98 / 178 » A Science of Reasoning |
144
Voted
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
The ability to detect ambiguities in context-free grammars is vital for their use in several fields, but the problem is undecidable in the general case. We present a safe, conser...
136
Voted
LICS
2006
IEEE
15 years 10 months 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...
100
click to vote
LICS
2006
IEEE
15 years 10 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...
143
click to vote
LICS
2006
IEEE
15 years 10 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...
144
Voted
VL
2006
IEEE
15 years 10 months ago
2006
IEEE
The problem of dependability in end-user programming is an emerging area of interest. Pair collaboration in end-user software development may offer a way for end users to debug th...