367 search results - page 35 / 74 » A Rewriting Logic Sampler |
108
click to vote
CORR
1999
Springer
15 years 4 days ago
1999
Springer
This paper introduces a logical system, called BV , which extends multiplicative linear logic by a non-commutative self-dual logical operator. This extension is particularly challe...
113
click to vote
AISC
2008
Springer
15 years 2 months ago
2008
Springer
Graph-based formalisms of quantum computation provide an abstract and symbolic way to represent and simulate computations. However, manual manipulation of such graphs is slow and e...
114
Voted
CADE
2010
Springer
14 years 11 months ago
2010
Springer
Polynomial interpretations are a useful technique for proving termination of term rewrite systems. In an automated setting, termination tools are concerned with parametric polynomi...
99
Voted
RTA
1995
Springer
15 years 4 months ago
1995
Springer
We use computational systems to express a completion with constraints procedure that gives priority to simpliļ¬cations. Computational systems are rewrite theories enriched by stra...
138
click to vote
PEPM
2010
ACM
15 years 2 months ago
2010
ACM
Software engineering, automated reasoning, rule-based programming or specifications often use rewriting systems for which termination, among other properties, may have to be ensur...