584 search results - page 28 / 117 » Logic Programs as term Rewriting Systems |
ISTA
2003
14 years 11 months ago
2003
: A new approach of building enterprise distributed applications for layer of business rules as standard part of architecture is proposed in this paper. The approach uses symbolic ...
RTA
1995
Springer
15 years 1 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...
CADE
2010
Springer
14 years 8 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...
123
click to vote
MST
2006
14 years 9 months ago
2006
We consider the transition graphs of regular ground tree (or term) rewriting systems. The vertex set of such a graph is a (possibly infinite) set of trees. Thus, with a finite tree...
ANCS
2007
ACM
15 years 1 months ago
2007
ACM
Programming specialized network processors (NPU) is inherently difficult. Unlike mainstream processors where architectural features such as out-of-order execution and caches hide ...