1385 search results - page 27 / 277 » Natural Rewriting for General Term Rewriting Systems |
COLING
1992
15 years 28 days ago
1992
In machine translation (MT) dierent levels of representation can be used to translate a source language sentence onto its target language equivalent. These levels have to be relat...
164
click to vote
CMSB
2011
Springer
13 years 11 months ago
2011
Springer
From the phosphorylation state of a molecule to the volume of a cell, parameters are ubiquitous in systems biology. At the same time, most models involve static or dynamic compart...
138
click to vote
LICS
1994
IEEE
15 years 3 months ago
1994
IEEE
Higher-order narrowing is a general method for higher-order equational reasoning and serves for instance as the foundation for the integration of functional and logic programming. ...
AISC
2006
Springer
15 years 3 months ago
2006
Springer
We prove that the properties of reachability, joinability and confluence are undecidable for flat TRSs. Here, a TRS is flat if the heights of the left and right-hand sides of each ...
ENTCS
2007
14 years 11 months ago
2007
The rewrite-based approach to satisfiability modulo theories consists of using generic theorem-proving strategies for first-order logic with equality. If one can prove that an i...