889 search results - page 47 / 178 » Problems in Rewriting III |
SOFSEM
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. The dependency pair method is a powerful method for automatically proving termination of rewrite systems. When used with traditional simplification orders like LPO and K...
AWIC
2005
Springer
14 years 3 months ago
2005
Springer
In data integration systems there is a problem of answering queries through a target schema, given a set of mappings between source schemas and the target schema, and given that th...
FSTTCS
1993
Springer
14 years 2 months ago
1993
Springer
Abstract. We provide a complete system of transformation rules for semantic unification with respect to theories defined by convergent rewrite systems. We show that this standard u...
AB
2007
Springer
14 years 1 months ago
2007
Springer
Lie group theory states that knowledge of a m-parameters solvable group of symmetries of a system of ordinary differential equations allows to reduce by m the number of equations. ...
TABLEAUX
2000
Springer
14 years 1 months ago
2000
Springer
We present an approach to inductive theorem proving that integrates rippling-based rewriting into matrix-based logical proof search. The selection of appropriate connections in a m...