Add to ORKGAbstract: This paper investigates the semantics of conditional term rewriting systems with negation which do not satisfy useful properties like termination. It is shown that the approach used by Fitting [5] for Prolog-style logic programs is applicable in this context. A monotone operator is developed, whose fixpoints describe the semantics of conditional rewriting. Several examples illustrate this semantics for non-terminating rewrite systems which could not be easily handled by previous approaches.
Algebraic specifications of abstract data types can often be viewed as systems of rewrite rules. He...
A classification of types of termination of term rewriting systems is proposed, built on properties ...
AbstractRewrite programs are logic programs represented as rewrite rules, whose execution mechanism ...
This paper investigates the semantics of conditional term rewriting systems with negation which do n...
In the field of conditional term rewriting systems, the reduction of a given term involves recursive...
. We transpose a conservative extension theorem from structural operational semantics to conditional...
AbstractWe define a semantics for negation as failure in logic programming. Our semantics may be vie...
AbstractWe investigate proving termination of term rewriting systems by interpretation of terms in a...
AbstractSystem S is a calculus providing the basic abstractions of term rewriting: matching and buil...
The authors present semantics for logic programs using term rewrite systems. Reading program lines f...
Contribution à un ouvrage.This chapter introduces term rewriting and some of its applications from d...
AbstractA conditional term rewriting system is called logical if it has the same logical strength as...
Rewrite programs are logic programs represented as rewrite rules, whose execution mechanism usually ...
textabstractIn this paper a translation from a subclass of logic programs consisting of the simply m...
AbstractAlgebraic specifications of abstract data types can often be viewed as systems of rewrite ru...
Algebraic specifications of abstract data types can often be viewed as systems of rewrite rules. He...
A classification of types of termination of term rewriting systems is proposed, built on properties ...
AbstractRewrite programs are logic programs represented as rewrite rules, whose execution mechanism ...
This paper investigates the semantics of conditional term rewriting systems with negation which do n...
In the field of conditional term rewriting systems, the reduction of a given term involves recursive...
. We transpose a conservative extension theorem from structural operational semantics to conditional...
AbstractWe define a semantics for negation as failure in logic programming. Our semantics may be vie...
AbstractWe investigate proving termination of term rewriting systems by interpretation of terms in a...
AbstractSystem S is a calculus providing the basic abstractions of term rewriting: matching and buil...
The authors present semantics for logic programs using term rewrite systems. Reading program lines f...
Contribution à un ouvrage.This chapter introduces term rewriting and some of its applications from d...
AbstractA conditional term rewriting system is called logical if it has the same logical strength as...
Rewrite programs are logic programs represented as rewrite rules, whose execution mechanism usually ...
textabstractIn this paper a translation from a subclass of logic programs consisting of the simply m...
AbstractAlgebraic specifications of abstract data types can often be viewed as systems of rewrite ru...
Algebraic specifications of abstract data types can often be viewed as systems of rewrite rules. He...
A classification of types of termination of term rewriting systems is proposed, built on properties ...
AbstractRewrite programs are logic programs represented as rewrite rules, whose execution mechanism ...