1385 search results - page 16 / 277 » Natural Rewriting for General Term Rewriting Systems |
FSTTCS
2008
Springer
15 years 23 days ago
2008
Springer
ABSTRACT. Formalisms involving some degree of nondeterminism are frequent in computer science. In particular, various programming or specification languages are based on term rewr...
AB
2007
Springer
15 years 5 months ago
2007
Springer
Abstract The classical attenuation regulation of gene expression in bacteria is considered. We propose to represent the secondary RNA structure in the leader region of a gene or an...
120
click to vote
ESSLLI
2009
Springer
14 years 9 months ago
2009
Springer
This paper describes cdiprover3 a tool for proving termination of term rewrite systems by polynomial interpretations and context dependent interpretations. The methods used by cdip...
100
click to vote
FM
1997
Springer
15 years 3 months ago
1997
Springer
Abstract Set boolean operations between 2-dlmensional geometric objects are crucial in computational geometry and deserve rigorous treatments. We build up a simple and convergent s...
ICALP
1990
Springer
15 years 3 months ago
1990
Springer
Termrewritingsystemsare importantfor computabilitytheoryof abstractdata types,for automatictheorem proving, and for the foundationsof functionalprogramming.In this shortsurveywe pr...