498 search results - page 11 / 100 » Term Rewriting |
95
Voted
ALP
1994
Springer
15 years 1 months ago
1994
Springer
This paper studies the relationship between logic programs and term rewriting systems (TRSs). A compositional transform is de ned which given a logic program computes a TRS. For a...
93
Voted
CCL
1994
Springer
15 years 1 months ago
1994
Springer
We introduce a modular property of equational proofs, called modularity of normalization, for the union of term rewrite systems with shared symbols. The idea is, that every normali...
107
click to vote
PLILP
1994
Springer
15 years 1 months ago
1994
Springer
Abstract. Program slicing is a useful technique for debugging, testing, and analyzing programs. A program slice consists of the parts of a program which (potentially) affect the va...
CAINE
2001
14 years 11 months ago
2001
In this paper, we describe the theoretical framework that allows us to use of the expert system shell CLIPS to define the network model in the Distribution Management System (DMS)...
FSTTCS
2008
Springer
14 years 10 months ago
2008
Springer
For a given (terminating) term rewriting system one can often estimate its derivational complexity indirectly by looking at the proof method that established termination. In this s...