360 search results - page 36 / 72 » Explanations and Proof Trees |
LICS
1995
IEEE
14 years 1 months ago
1995
IEEE
We prove that tree isomorphism is not expressible in the language (FO + TC + COUNT). This is surprising since in the presence of ordering the language captures NL, whereas tree is...
CPC
2004
13 years 9 months ago
2004
We consider boolean functions over n variables. Any such function can be represented (and computed) by a complete binary tree with and or or in the internal nodes and a literal in...
CP
2000
Springer
14 years 1 months ago
2000
Springer
We are interested in the expressiveness of constraints represented by general first order formulae, with equality as unique relation symbol and function symbols taken from an infi...
CSL
2010
Springer
13 years 11 months ago
2010
Springer
Deduction modulo consists in presenting a theory through rewrite rules to support automatic and interactive proof search. It induces proof search methods based on narrowing, such a...
ICCAD
2010
IEEE
13 years 8 months ago
2010
IEEE
In this paper, we present an efficient method to solve the obstacle-avoiding rectilinear Steiner minimum tree (OARSMT) problem optimally. Our work is a major improvement over the w...