Sciweavers

1458 search results - page 75 / 292
» Extended Term Rewriting Systems
Sort
View
TABLEAUX
2009
Springer
15 years 2 months ago
Tableaux for Projection Computation and Knowledge Compilation
Projection computation is a generalization of second-order quantifier elimination, which in turn is closely related to the computation of forgetting and of uniform interpolants. O...
Christoph Wernhard
PVLDB
2008
118views more  PVLDB 2008»
14 years 9 months ago
XTCcmp: XQuery compilation on XTC
XTCcmp, the XQuery Compiler of a native XML database system, extends Starburst's well-known Query Graph Model to serve as an internal representation and basis for query restr...
Christian Mathis, Andreas M. Weiner, Theo Här...
RTA
2004
Springer
15 years 3 months ago
Automated Termination Proofs with AProVE
We describe the system AProVE, an automated prover to verify (innermost) termination of term rewrite systems (TRSs). For this system, we have developed and implemented efficient al...
Jürgen Giesl, René Thiemann, Peter Sch...
VLDB
2007
ACM
225views Database» more  VLDB 2007»
15 years 10 months ago
An Approach to Optimize Data Processing in Business Processes
In order to optimize their revenues and profits, an increasing number of businesses organize their business activities in terms of business processes. Typically, they automate imp...
Marko Vrhovnik, Holger Schwarz, Oliver Suhre, Bern...
POPL
1995
ACM
15 years 1 months ago
Parametric Program Slicing
Program slicing is a technique for isolating computational threads in programs. In this paper, we show how to mechanically extract a family of practical algorithms for computing s...
John Field, G. Ramalingam, Frank Tip