Fitting Semantics for Conditional Term Rewriting
Abstract
Abstract: 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. 1
Cite
Text
Mohan. "Fitting Semantics for Conditional Term Rewriting." International Joint Conference on Artificial Intelligence, 1991.Markdown
[Mohan. "Fitting Semantics for Conditional Term Rewriting." International Joint Conference on Artificial Intelligence, 1991.](https://mlanthology.org/ijcai/1991/mohan1991ijcai-fitting/)BibTeX
@inproceedings{mohan1991ijcai-fitting,
title = {{Fitting Semantics for Conditional Term Rewriting}},
author = {Mohan, Chilukuri K.},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {1991},
pages = {857-862},
url = {https://mlanthology.org/ijcai/1991/mohan1991ijcai-fitting/}
}