Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
ACL
1996
12 years 3 months ago
An Efficient Compiler for Weighted Rewrite Rules
Context-dependent rewrite rules are used in many areas of natural language and speech processing. Work in computational phonology has demonstrated that, given certain conditions, ...
Mehryar Mohri, Richard Sproat
IJCAI
1997
12 years 3 months ago
Equational Reasoning using AC Constraints
Unfailing completion is a commonly used technique for equational reasoning. For equational problems with associative and commutative functions, unfailing completion often generate...
David A. Plaisted, Yunshan Zhu
NAACL
2001
12 years 3 months ago
Re-Engineering Letter-to-Sound Rules
Using finite-state automata for the text analysis component in a text-to-speech system is problematic in several respects: the rewrite rules from which the automata are compiled a...
Martin Jansche
IASTEDSEA
2004
12 years 3 months ago
Higher-order strategic programming: A road to software assurance
Program transformation through the repeated application of simple rewrite rules is conducive to formal verification. In practice, program transformation oftentimes requires data t...
Victor L. Winter, Steve Roach, Fares Fraij
LCPC
1995
Springer
12 years 5 months ago
V-cal: A Calculus for the Compilation of Data Parallel Languages
V-cal is a calculus designed to support the compilation of data parallel languages that allows to describe program transformations and optimizations as semantics preserving rewrite...
P. F. G. Dechering, J. A. Trescher, J. P. M. de Vr...
SIGMOD
1992
ACM
160views Database» more  SIGMOD 1992»
12 years 6 months ago
Extensible/Rule Based Query Rewrite Optimization in Starburst
This paper describes the Query Rewrite facility of the Starburst extensible database system, a novel phase of query optimization. We present a suite of rewrite rules used in Starb...
Hamid Pirahesh, Joseph M. Hellerstein, Waqar Hasan
PPSN
1994
Springer
12 years 6 months ago
Genetic L-System Programming
We present the Genetic L-System Programming (GLP) paradigm for evolutionary creation and development of parallel rewrite systems (Lsystems, Lindenmayer-systems) which provide a com...
Christian Jacob
CONPAR
1994
12 years 6 months ago
The Rewrite Rule Machine Node Architecture and Its Performance
The Rewrite Rule Machine (RRM) is a massively parallel MIMD/SIMD computer designed with the explicit purpose of supporting veryhigh-level parallel programming with rewrite rules. T...
Patrick Lincoln, José Meseguer, Livio Ricci...
VLDB
1998
ACM
86views Database» more  VLDB 1998»
12 years 6 months ago
Inferring Function Semantics to Optimize Queries
The goal of the COKO-KOLA project [10, 91 is to express rules of rule-basedoptimizers in a mannerpermitting verification with a theoremprover. In [IO], we consideredquerytransform...
Mitch Cherniack, Stanley B. Zdonik
TYPES
1998
Springer
12 years 6 months ago
Proof Normalization Modulo
We define a generic notion of cut that applies to many first-order theories. We prove a generic cut elimination theorem showing that the cut elimination property holds for all theo...
Gilles Dowek, Benjamin Werner
books