1385 search results - page 68 / 277 » Natural Rewriting for General Term Rewriting Systems |
177
click to vote
LACL
2005
Springer
15 years 11 months ago
2005
Springer
Locality Conditions (LCs) on (unbounded) dependencies have played a major role in the development of generative syntax ever since the seminal work by Ross [22]. Descriptively, they...
176
click to vote
CADE
2008
Springer
16 years 6 months ago
2008
Springer
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
160
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...
163
click to vote
SIGIR
2003
ACM
15 years 11 months ago
2003
ACM
This paper presents an algorithm to generate possible variants for biomedical terms. The algorithm gives each variant its generation probability representing its plausibility, whi...
171
click to vote
KBSE
2005
IEEE
15 years 11 months ago
2005
IEEE
The Nix software deployment system is based on the paradigm of transparent source/binary deployment: distributors deploy descriptors that build components from source, while clien...