662 search results - page 45 / 133 » Trees, Automata and XML |
189
click to vote
CADE
2008
Springer
16 years 7 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...
206
click to vote
BDA
2001
15 years 8 months ago
2001
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 ...
207
click to vote
RTA
2005
Springer
16 years 4 days ago
2005
Springer
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...
