Sciweavers

882 search results - page 84 / 177
» A Taste of Rewrite Systems
Sort
View
CORR
2010
Springer
76views Education» more  CORR 2010»
13 years 9 months ago
Infinitary Combinatory Reduction Systems: Normalising Reduction Strategies
Abstract. We study normalising reduction strategies for infinitary Combinatory Reduction Systems (iCRSs). We prove that all fair, outermost-fair, and needed-fair strategies are nor...
Jeroen Ketema, Jakob Grue Simonsen
RTA
2010
Springer
14 years 21 days ago
On (Un)Soundness of Unravelings
We revisit (un)soundness of transformations of conditional into unconditional rewrite systems. The focus here is on so-called unravelings, the most simple and natural kind of such ...
Karl Gmeiner, Bernhard Gramlich, Felix Schernhamme...
SIGMOD
1996
ACM
132views Database» more  SIGMOD 1996»
14 years 29 days ago
Cost-Based Optimization for Magic: Algebra and Implementation
Magic sets rewriting is a well-known optimization heuristic for complex decision-support queries. There can be many variants of this rewriting even for a single query, which diffe...
Praveen Seshadri, Joseph M. Hellerstein, Hamid Pir...
IANDC
2010
141views more  IANDC 2010»
13 years 7 months ago
Regaining cut admissibility in deduction modulo using abstract completion
stract Completion Guillaume Burel a,c,∗ Claude Kirchner b,c aNancy-Universit´e, Universit´e Henri Poincar´e bINRIA Bordeaux - Sud-Ouest cLORIA, ´Equipe Pareo, Bˆatiment B, C...
Guillaume Burel, Claude Kirchner
ECAL
2001
Springer
14 years 1 months ago
Evolving Multi-agent Networks in Structured Environments
A crucial feature of evolving natural systems is parallelism. The simultaneous and distributed application of rules (governed by e.g. biochemistry) is generally considered as the p...
Thomas Glotzmann, Holger Lange, Michael Hauhs, A. ...