AbstractA conditional term rewriting system is called logical if it has the same logical strength as the underlying conditional equational system. In this paper we summarize known logicality results and we present new sufficient conditions for logicality of the important class of oriented conditional term rewriting systems
Suzuki et al. showed that properly oriented, right-stable, orthogonal, and oriented conditional term...
In this paper a translation from a subclass of logic programs consisting of the simply moded logic p...
An automated technique to translate conditional rewrite rules into unconditional ones is presented, ...
AbstractA conditional term rewriting system is called logical if it has the same logical strength as...
AbstractConditional equations provide a paradigm of computation that combines the clean syntax and s...
AbstractFor reasons of efficiency, term rewriting is usually implemented by graph rewriting. Barendr...
AbstractAlgebraic specifications of abstract data types can often be viewed as systems of rewrite ru...
Conditional equations arise naturally in the algebraic specification of data types. They also provid...
We characterize conditional rewriting as satisfiability in a Herbrand-like model of terms where vari...
Conditional rewriting and priority rewriting are two recent generalizations of term rewriting system...
This paper investigates the semantics of conditional term rewriting systems with negation which do n...
Algebraic specifications of abstract data types can often be viewed as systems of rewrite rules. He...
In the field of conditional term rewriting systems, the reduction of a given term involves recursive...
AbstractA property of term rewriting systems is called modular if it is preserved under disjoint uni...
AbstractWe formally define and prove the correctness of a transformation from conditional rewrite sy...
Suzuki et al. showed that properly oriented, right-stable, orthogonal, and oriented conditional term...
In this paper a translation from a subclass of logic programs consisting of the simply moded logic p...
An automated technique to translate conditional rewrite rules into unconditional ones is presented, ...
AbstractA conditional term rewriting system is called logical if it has the same logical strength as...
AbstractConditional equations provide a paradigm of computation that combines the clean syntax and s...
AbstractFor reasons of efficiency, term rewriting is usually implemented by graph rewriting. Barendr...
AbstractAlgebraic specifications of abstract data types can often be viewed as systems of rewrite ru...
Conditional equations arise naturally in the algebraic specification of data types. They also provid...
We characterize conditional rewriting as satisfiability in a Herbrand-like model of terms where vari...
Conditional rewriting and priority rewriting are two recent generalizations of term rewriting system...
This paper investigates the semantics of conditional term rewriting systems with negation which do n...
Algebraic specifications of abstract data types can often be viewed as systems of rewrite rules. He...
In the field of conditional term rewriting systems, the reduction of a given term involves recursive...
AbstractA property of term rewriting systems is called modular if it is preserved under disjoint uni...
AbstractWe formally define and prove the correctness of a transformation from conditional rewrite sy...
Suzuki et al. showed that properly oriented, right-stable, orthogonal, and oriented conditional term...
In this paper a translation from a subclass of logic programs consisting of the simply moded logic p...
An automated technique to translate conditional rewrite rules into unconditional ones is presented, ...