A Methodology for Proving Termination of General Logic Programs

Marchiori, Elena

A Methodology for Proving Termination of General Logic Programs

Download BibTeX Cite

Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence. Automated Reasoning. Pages 356-360.

Abstract

This paper introduces a methodology for proving termination of general logic programs, when the Prolog selection rule is considered. This methodology combines the approaches by Apt and Bezem [1] and Apt and Pedreschi [2J, and provides a simple and flexible tool for proving termination .

Elena Marchiori. 1995. A Methodology for Proving Termination of General Logic Programs. In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, IJCAI-95. IJCAI, 356–360. https://ijcai.org/proceedings/1995/47

@inproceedings{ijcai1995p47,
  title     = {A Methodology for Proving Termination of General Logic Programs},
  author    = {Marchiori, Elena},
  booktitle = {Proceedings of the Fourteenth International Joint Conference on
               Artificial Intelligence, {IJCAI-95}},
  publisher = {International Joint Conferences on Artificial Intelligence},
  editor    = {Chris S. Mellish},
  pages     = {356--360},
  year      = {1995},
  note      = {Automated Reasoning},
  url       = {https://ijcai.org/proceedings/1995/47},
}

TY  - CPAPER
TI  - A Methodology for Proving Termination of General Logic Programs
AU  - Marchiori, Elena
T2  - Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, IJCAI-95
PB  - International Joint Conferences on Artificial Intelligence
PY  - 1995
SP  - 356
EP  - 360
UR  - https://ijcai.org/proceedings/1995/47
ER  -