Fitting Semantics for Conditional Term Rewriting

Mohan, Chilukuri K.

Fitting Semantics for Conditional Term Rewriting

Download BibTeX Cite

Proceedings of the Twelfth International Joint Conference on Artificial Intelligence. Logic Programming. Pages 857-861.

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.

Chilukuri K. Mohan. 1991. Fitting Semantics for Conditional Term Rewriting. In Proceedings of the Twelfth International Joint Conference on Artificial Intelligence, IJCAI-91. IJCAI, 857–861. https://ijcai.org/proceedings/1991/126

@inproceedings{ijcai1991p126,
  title     = {Fitting Semantics for Conditional Term Rewriting},
  author    = {Mohan, Chilukuri K.},
  booktitle = {Proceedings of the Twelfth International Joint Conference on
               Artificial Intelligence, {IJCAI-91}},
  publisher = {International Joint Conferences on Artificial Intelligence},
  editor    = {John Mylopoulos and Ray Reiter},
  pages     = {857--861},
  year      = {1991},
  month     = {8},
  note      = {Logic Programming},
  url       = {https://ijcai.org/proceedings/1991/126},
}

TY  - CPAPER
TI  - Fitting Semantics for Conditional Term Rewriting
AU  - Mohan, Chilukuri K.
T2  - Proceedings of the Twelfth International Joint Conference on Artificial Intelligence, IJCAI-91
PB  - International Joint Conferences on Artificial Intelligence
PY  - 1991
SP  - 857
EP  - 861
UR  - https://ijcai.org/proceedings/1991/126
ER  -