Fitting semantics for conditional term rewriting

Authors:
Chilukuri K. Mohan
Affiliations:
School of Computer and Information Science, Syracuse University, Syracuse, NY
Venue:
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 2
Year:
1991

Citing 3
Cited 0

Positive/negative conditional rewriting

1st international workshop on Conditional Term Rewriting Systems
Conditional specifications with inequational assumptions

1st international workshop on Conditional Term Rewriting Systems
Contributions to the Theory of Logic Programming

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper investigates the semantics of conditional term rewriting systems with negation, which may not satisfy desirable 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.