Sciweavers

1385 search results - page 30 / 277
» Natural Rewriting for General Term Rewriting Systems
Sort
View
ANLP
2000
68views more  ANLP 2000»
15 years 1 months ago
Distilling dialogues - A method using natural dialogue corpora for dialogue systems development
We report on a method for utilising corpora collected in natural settings. It is based on distilling re-writing natural dialogues to elicit the type of dialogue that would occur i...
Arne Jönsson, Nils Dahlbäck
AMAST
2008
Springer
15 years 1 months ago
Towards an Efficient Implementation of Tree Automata Completion
Term Rewriting Systems (TRSs) are now commonly used as a modeling language for applications. In those rewriting based models, reachability analysis, i.e. proving or disproving that...
Emilie Balland, Yohan Boichut, Thomas Genet, Pierr...
WIDM
2003
ACM
15 years 5 months ago
Query rewriting using views in the presence of inclusion dependencies
Query rewriting using views is an essential issue in data integration. A number of algorithms, e.g., the bucket algorithm, the inverse rules algorithm, the SVB algorithm and the M...
Qingyuan Bai, Jun Hong, Michael F. McTear
CORR
2008
Springer
140views Education» more  CORR 2008»
14 years 12 months ago
A Cloning Pushout Approach to Term-Graph Transformation
We address the problem of cyclic termgraph rewriting. We propose a new framework where rewrite rules are tuples of the form (L, R, , ) such that L and R are termgraphs representing...
Dominique Duval, Rachid Echahed, Fréd&eacut...
LISP
2006
77views more  LISP 2006»
14 years 11 months ago
Expressing combinatory reduction systems derivations in the rewriting calculus
The last few years have seen the development of the rewriting calculus (also called rho-calculus or -calculus) that uniformly integrates first-order term rewriting and the -calculu...
Clara Bertolissi, Horatiu Cirstea, Claude Kirchner