23201 search results - page 159 / 4641 » Rewriting Systems with Data |
167
click to vote
ICFP
2008
ACM
16 years 6 months ago
2008
ACM
Self-adjusting programs respond automatically and efficiently to input changes by tracking the dynamic data dependences of the computation and incrementally updating the output as...
262
click to vote
ICDE
2008
IEEE
16 years 7 months ago
2008
IEEE
In Online Analytic Processing (OLAP) deployments, different users, lines of businesses and business units often create adhoc aggregation hierarchies tailor-made for specific report...
160
click to vote
CADE
2007
Springer
16 years 6 months ago
2007
Springer
This paper combines predictive labeling with dependency pairs and reports on its implementation. Our starting point is the method of proving termination of rewrite systems using se...
161
click to vote
CADE
2006
Springer
16 years 6 months ago
2006
Springer
This paper presents new classes of tree automata combining automata with equality test and automata modulo equational theories. We believe that these classes have a good potential ...
173
click to vote
CADE
2009
Springer
16 years 1 months ago
2009
Springer
SPASS is an automated theorem prover for full first-order logic with equality and a number of non-classical logics. This system description provides an overview of our recent deve...