Sciweavers

662 search results - page 45 / 133
» Trees, Automata and XML
Sort
View
CADE
2008
Springer
16 years 6 months ago
Automated Induction with Constrained Tree Automata
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...
Adel Bouhoula, Florent Jacquemard
BDA
2001
15 years 7 months ago
Rewriting and Evaluating Tree Queries with XPath
A Community Web portal is a set of tools for a community of people who want to share information on a certain domain via the Web. The backbone of this system is an ontology which ...
Bernd Amann, Catriel Beeri, Irini Fundulaki, Miche...
RTA
2005
Springer
15 years 11 months ago
On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems
We present a new method for proving termination of term rewriting systems automatically. It is a generalization of the match bound method for string rewriting. To prove that a term...
Alfons Geser, Dieter Hofbauer, Johannes Waldmann, ...
CAI
2009
Springer
16 years 20 days ago
Single-Path Restarting Tree Automata
Friedrich Otto, Heiko Stamer