Skip to main content
Log in

Programming in temporal-nonmonotonic reasoning

  • Published:
Journal of Automated Reasoning Aims and scope Submit manuscript

Abstract

Nonmonotonic reasoning has been proposed as an extension to classical first-order logic. Now people are interested in temporal reasoning with nonmonotonic logic [6]. We combine the monotonic logic [7] with a temporal logic to get a more general reasoning language. We discuss a monotonic logic TML which has predicate formulas, temporal formulas and a special modal formula, and give a completeness theorem of it. We use TH(Δ) to designate the set of theorems of a temporal-nonmonotonic theory Δ which has the same language with TML. The completeness theorem of the temporal-nonmonotonic logic naturally arises. Like the relationship between predicate logic with a practical logic programming language PROLOG, we propose a useful temporal-nonmonotonic reasoning language TN for the temporal-nonmonotonic logic. As an appendix we supply an algorithm for the programming language TN.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Abadi, M. and Manna, Z., ‘Temporal Logic Programming”, Proceedings of Fourth IEEE Symposium on Logic Programming (1987).

  2. Chellas, B. F., Modal Logic. An Introduction, Cambridge University Press, 1980.

  3. Clarke, E. M., Emerson, E. A., and Sistla, A. P., ‘Automatic Verification of Finite-State Concurrent Systems Using Temporal Logic Specifications’, ACM Transactions on Programming Languages and Systems 8(2) 244–263 (1986).

    Google Scholar 

  4. Farinas Del, Cerro L., ‘Molog — A System that Extends PROLOG with Modal Logic’, New Generation Computing 4(1), 36–50 (1986).

    Google Scholar 

  5. Gabbay, D., Pnueli, A., Shelah, A. and Stavi, J., ‘The Temporal Analysis of Fairness’, Proc. 7th POPL 163–173 (1980).

  6. Hanks, S. and McDermott, D., ‘Nonmonotonic Logic and Temporal Projection’, Artificial Intelligence 33, 379–412 (1987).

    Google Scholar 

  7. McDermott, D. and Doyle, J., ‘Non-Monotonic Logic 1’, Artificial Intelligence 13, 41–72 (1980).

    Google Scholar 

  8. McDermott, D., ‘Nonmonotonic Logic II, Nonmonotonic Modal Theories’, Journal of the Association for Computing Machinery 29(1), 33–57 (1982).

    Google Scholar 

  9. Shoenfield, J. R., Mathematical Logic, Addison-Wesley Publishing Company, Reading, Massachusetts (1967).

    Google Scholar 

  10. Stirling, C., ‘Comparing Linear and Branching Time Temporal Logic’, in manuscript (1987).

  11. Tang, T. G., ‘A Completeness Theorem of First-order Temporal Logic with The Equality’, Scientia Sinica (series A), XXVIII (1985). In Chinese.

  12. Tang, T. G., ‘Temporal Logic CTL + PROLOG’, Journal of Automated Reasoning 5 49–65 (1989).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tang, T.G. Programming in temporal-nonmonotonic reasoning. J Autom Reasoning 7, 383–401 (1991). https://doi.org/10.1007/BF00249021

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00249021

Key words

Navigation