Temporal Reasoning and Termination of Programs
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.
Cite
Text
del Cerro. "Temporal Reasoning and Termination of Programs." International Joint Conference on Artificial Intelligence, 1983.Markdown
[del Cerro. "Temporal Reasoning and Termination of Programs." International Joint Conference on Artificial Intelligence, 1983.](https://mlanthology.org/ijcai/1983/delcerro1983ijcai-temporal/)BibTeX
@inproceedings{delcerro1983ijcai-temporal,
title = {{Temporal Reasoning and Termination of Programs}},
author = {del Cerro, Luis Fariñas},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {1983},
pages = {926-929},
url = {https://mlanthology.org/ijcai/1983/delcerro1983ijcai-temporal/}
}