11740 search results - page 77 / 2348 » More Problems in Rewriting |
98
Voted
TABLEAUX
2000
Springer
15 years 4 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...
101
Voted
CORR
2006
Springer
15 years 21 days ago
2006
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 equation. ...
127
Voted
ESSLLI
2009
Springer
14 years 10 months ago
2009
Springer
The polynomial path order (POP for short) is a termination method that induces polynomial bounds on the innermost runtime complexity of term rewrite systems (TRSs for short). Seman...
104
click to vote
VAMOS
2007
Springer
15 years 6 months ago
2007
Springer
Requirements for product families are expressed in terms of commonality and variability. This distinction allows early identification of an appropriate software architecture and ...
137
click to vote
EDBT
2012
ACM
13 years 3 months ago
2012
ACM
In this paper we consider the problem of answering queries using views, with or without ontological constraints, which is important for data integration, query optimization, and d...