12 search results - page 3 / 3 » Unranked Tree Automata with Sibling Equalities and Disequali... |
89
Voted
IANDC
2011
14 years 4 months ago
2011
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a res...
CADE
2008
Springer
15 years 9 months ago
2008
Springer
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...