Temporal Reasoning and Termination of Programs

Fariñas del Cerro, Luis

Temporal Reasoning and Termination of Programs

Download BibTeX Cite

Proceedings of the Eighth International Joint Conference on Artificial Intelligence. Theorem Proving. Pages 926-928.

Abstract

This paper deals with the relationship between the termination of programs and the validity of certain modal formulas. We give a complete proof procedure for theses formulas, which will allow to bring the correctness of these programs back to a problem of automated deduction in modal logic.

Luis Fariñas del Cerro. 1983. Temporal Reasoning and Termination of Programs. In Proceedings of the Eighth International Joint Conference on Artificial Intelligence, IJCAI-83. IJCAI, 926–928. https://ijcai.org/proceedings/1983/218

@inproceedings{ijcai1983p218,
  title     = {Temporal Reasoning and Termination of Programs},
  author    = {Fariñas del Cerro, Luis},
  booktitle = {Proceedings of the Eighth International Joint Conference on
               Artificial Intelligence, {IJCAI-83}},
  publisher = {International Joint Conferences on Artificial Intelligence},
  editor    = {Alan Bundy},
  pages     = {926--928},
  year      = {1983},
  note      = {Theorem Proving},
  url       = {https://ijcai.org/proceedings/1983/218},
}

TY  - CPAPER
TI  - Temporal Reasoning and Termination of Programs
AU  - Fariñas del Cerro, Luis
T2  - Proceedings of the Eighth International Joint Conference on Artificial Intelligence, IJCAI-83
PB  - International Joint Conferences on Artificial Intelligence
PY  - 1983
SP  - 926
EP  - 928
UR  - https://ijcai.org/proceedings/1983/218
ER  -