Temporal disjunctive logic programming | New Generation Computing Skip to main content
Springer Nature Link
Log in

Temporal disjunctive logic programming

  • Short Note
  • Published:
New Generation Computing Aims and scope Submit manuscript

Abstract

In this paper we introduce the logic programming languageDisjunctive Chronolog which combines the programming paradigms of temporal and disjunctive logic programming. Disjunctive Chronolog is capable of expressing dynamic behaviour as well as uncertainty, two notions that are very common in a variety of real systems. We present the minimal temporal model semantics and the fixpoint semantics for the new programming language and demonstrate their equivalence. We also show how proof procedures developed for disjunctive logic programs can be easily extended to apply to Disjunctive Chronolog programs.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

Institutional subscriptions

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Baral, C., Gelfond, M. and Provetti, A., “Representing Actions: Laws, Observations and Hypotheses,”The Journal Of Logic Programming, 31, 1–3, pp. 201–244, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  2. Baudinet, M., “A Simple Proof of the Completeness of Temporal Logic Programming,” inIntensional Logics for Programming (Del Cerro, L. F. and Penttonen, M. eds.), pp. 51–83. Oxford University Press, 1993.

  3. Chomicki, J., “Depth-bounded Bottom-up Evaluation of Logic Programs,”The Journal of Logic Programming, 25 1, pp. 1–31, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  4. Eiter, T., Gottlob, G. and Mannila, H., “Disjunctive Datalog,”ACM Transactions on Database Systems, 22, 3, pp. 364–418, September 1997.

    Article  Google Scholar 

  5. Gelfond, M. and Lifschitz, V., “Representing Action and Change by Logic Programs,”The Journal of Logic Programming, 17, 2, 3 and 4, pp. 301–323, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  6. Gergatsoulis, M., Rondogiannis, P. and Panayiotopoulos, T., “Disjunctive Chronolog,” inProc. of the JICSLP’96 Post-Conference Workshop “Multi-Paradigm Logic Programming” (M. Chacravarty, Y. Guo, and T. Ida, eds.), pp. 129–136, Bonn, 5–6 Sept. 1996.

  7. Gergatsoulis, M., Rondogiannis, P. and Panayiotopoulos, T., “Proof Procedures for Branching-time Logic Programs,” inProc. of the Tenth International Symposium on Languages for Intensional Programming (ISLIP’97) (W. W. Wadge, ed.), May 15–17, Victoria BC, Canada, pp. 12–26, 1997.

  8. Gergatsoulis, M., Rondogiannis, P. and Panayiotopoulos, T., “Temporal Disjunctive Logic Programming,” Technical Report 15-97, Dept. of Computer Science, University of Ioannina, Greece, 1997.

    Google Scholar 

  9. Kowalski, R. and Sergot, M., “A Logic-based Calculus of Events,”New Generation Computing, 4, pp. 67–95, 1986.

    Article  Google Scholar 

  10. Lausen, G., Ludäscher, B. and May, W., “On Active Deductive Databases: the Statelog Approach,” inTansactions and Change in Logic Databases (B. Freitag, H. Decker, M. Kifer, and A. Voronkov, eds.), Lecture Notes in Computer Science (LNCS) 1472, pp. 69–106. Springer-Verlag, 1998.

  11. Levesque, H., Pirri, F. and Reiter, R., “Foundations for the Situation Calculus,”Linköping Electronic Articles in Computer and Information Science,3,18, 1998.

  12. Levesque, H., Reiter, R., Lespérance, Y., Lin, F. and Scherl, R., “GOLOG: A Logic Programming Language for Dymanic Domains,”The Journal of Logic Programming, 31, 1–3, pp 59–83, 1997.

    Article  MATH  Google Scholar 

  13. Lifschitz, V., “Action Languages, Answer Sets and Planning,” inThe Logic Programming Paradigm: A 25-Year Perspective, (K. R. Apt, V. W. Marek, M. Truszczynski, and D. S. Warren, eds.), pp. 357–373, Springer-Verlag, 1999.

  14. Lloyd, J. W.,Foundations of Logic Programming. Springer-Verlag, 1987.

  15. Lobo, J., Minker, J. and Rajasekar, A., “Extending the Semantics of Logic Programs to Disjunctive Logic Programs,” inProc. of the Sixth International Conference on Logic Programming (G. Levi and M. Martelli, eds.), pp. 255–267. MIT Press, 1989.

  16. Lobo, J., Minker, J. and Rajasekar, A.,Foundations of Disjunctive Logic Programming. MIT Press, 1992.

  17. Lobo, J. and Rajasekar, A., “Semantics of Horn and Disjunctive Logic Programs,”Theoretical Computer Science, 86, 1, pp. 93–106, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  18. Marinagi, C., Panayiotopoulos, T., Vouros, G. and Spyropoulos, C., “Advisor: A knowledge-based Planning System,”International Journal of Expert Systems, 9, 3, pp. 319–355, 1997.

    Google Scholar 

  19. McCain N. and Turner, H., “A Causal Theory of Ramifications and Qualifications,” inProc. of the Fourteenth International Conference on Artificial Intelligence (IJCAI ’95), pp. 1978–1984, 1995.

  20. McCarthy J. and Hayes, P., “Some Philosophical Problems from the Standpoint of Artificial Intelligence,”Machine Intelligence, 4, pp. 463–502, 1969.

    MATH  Google Scholar 

  21. Minker, J. and Rajasekar, A., “A Fixpoint Semantics for Disjunctive Logic Programs,”The Journal of Logic Programming, 9, 1, pp. 45–74, July 1990.

    Article  MATH  MathSciNet  Google Scholar 

  22. Minker, J. and Rajasekar, A. and Lobo, J., “Theory of Disjunctive Logic Programs,” inComputational Logic. Essays in the Honor of Alan Robinson, (J. L. Lasser and G. Plotkin, eds.), pp. 613–639. MIT Press, 1991.

  23. Orgun, M. A.,Intensional logic programming. PhD thesis, Dept. of Computer Science, University of Victoria, Canada, December 1991.

    Google Scholar 

  24. Orgun, M. A., “On Temporal Deductive Databases,”Computational Intelligence, 12, 2, pp. 235–259, 1996.

    Article  MathSciNet  Google Scholar 

  25. Orgun, M. A. and Ma, W., “An Overview of Temporal and Modal Logic Programming,” inProc. of the First International Conference on Temporal Logics (ICTL’94) (D. M. Gabbay and H. J. Ohlbach, eds.), Lecture Notes in Computer Science (LNCS) 827, pp. 445–479. Springer-Verlag, 1994.

  26. Orgun, M. A. and Wadge, W. W., “Towards a Unified Theory of Intensional Logic Programming,”The Journal of Logic Programming, 13, 4, pp. 413–440, August 1992.

    Article  MATH  MathSciNet  Google Scholar 

  27. Orgun, M. A. and Wadge, W. W., “Chronolog Admits a Complete Proof Procedure,” inProc. of the Sixth International Symposium on Lucid and Intensional Programming (ISLIP’93) pp. 120–135, 1993.

  28. Orgun, M. A., Wadge, W. W. and Du, W., “Chronolog (Z): Linear-time Logic Programming,” inProc. of the Fifth International Conference on Computing and Information (O. Abou-Rabia, C. K. Chang, and W. W. Koczkodaj, eds.), pp. 545–549. IEEE Computer Society Press, 1993.

  29. Panayiotopoulos, T. and Gergatsoulis, M., “Intelligent Information Processing Using TRLi,” in6th International Conference and Workshop on Data Base and Expert Systems Applications (DEXA’ 95), (Workshop Proceedings) (A. Min Tjoa, and N. Revell, ed.), London, UK, 4–8 September, pp. 494–501, 1995.

  30. Panayiotopoulos, T. and Gergatsoulis, M., “A Prolog like Temporal Reasoning System,” inProc. of 13th IASTED International Conference on APPLIED INFORMATICS, (M. H. Hamza, ed.), ICLS(Innsbruck), Austria 21–23 Ferbuary, pp. 123–126, 1995.

  31. Pinto, J. and Reiter, R., “Temporal Reasoning in Logic Programming: A Case for the Situation Calculus,” inProc. of the Tenth International Conference on Logic Programming, (D. S. Warren, ed.), pp. 203–221. MIT Press, 1993.

  32. Pinto, J. and Reiter, R., “Reasoning about Time in the Situation Calculus,”Annals of Mathematics and Artificial Intelligence, 14, 2–5, pp. 251–268, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  33. Rondogiannis, P., Gergatsoulis, M. and Panayiotopoulos, T., “Branching-time Logic Programming: The language Cactus and Its Applications,”Computer Languages, 24, 3, pp. 155–178, October 1998.

    Article  MATH  Google Scholar 

  34. Wadge, W. W., “Tense Logic Programming: A Respectable Alternative,” inProc. of the 1988 International Symposium on Lucid and Intensional Programming, pp. 26–32, 1988.

Download references

Author information

Authors and Affiliations

  1. Institute of Informatics & Telecommunications, N.C.S.R. ‘Demokritos’, 153 10A, Paraskevi Attikis, Greece

    Manolis Gergatsoulis

  2. Department of Computer Science, University of Ioannina, P.O. Box 1186, 45110, Ioannina, Greece

    Panos Rondogiannis

  3. Department of Informatics, University of Piraeus, 80 Karaoli & Dimitriou Str., 18534, Piraeus, Greece

    Themis Panayiotopoulos

Authors
  1. Manolis Gergatsoulis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Panos Rondogiannis
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Themis Panayiotopoulos
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Manolis Gergatsoulis.

Additional information

Manolis Gergatsoulis, Ph.D.: He received his B.Sc. in Physics in 1983, the M.Sc. and the Ph.D. degrees in Computer Science in 1986 and 1995 respectively all from the University of Athens, Greece. Since 1996 he is a Research Associate in the Institute of Informatics and Telecommunications, NCSR ‘Demokritos’, Athens. His research interests include logic and temporal programming, program transformations and synthesis, as well as theory of programming languages.

Panagiotis Rondogiannis, Ph.D.: He received his B.Sc. from the Department of Computer Engineering and Informatics, University of Patras, Greece, in 1989, and his M.Sc. and Ph.D. from the Department of Computer Science, University of Victoria, Canada, in 1991 and 1994 respectively. From 1995 to 1996 he served in the Greek army. From 1996 to 1997 he was a visiting professor in the Department of Computer Science, University of Ioannina, Greece, and since 1997 he is a Lecturer in the same Department. In January 2000 he was elected Assistant Professor in the Department of Informatics at the University of Athens. His research interests include functional, logic and temporal programming, as well as theory of programming languages.

Themis Panayiotopoulos, Ph.D.: He received his Diploma on Electrical Engineering from the Department of Electrical Engineering, National Technical Univesity of Athens, in 1984, and his Ph.D. on Artificial Intelligence from the above mentioned department in 1989. From 1991 to 1994 he was a visiting professor at the Department of Mathematics, University of the Aegean, Samos, Greece and a Research Associate at the Institute of Informatics and Telecommunications of “Democritos” National Research Center. Since 1995 he is an Assistant Prof. at the Department of Computer Science, University of Piraeus. His research interests include temporal programming, logic programming, expert systems and intelligent agent architectures.

About this article

Cite this article

Gergatsoulis, M., Rondogiannis, P. & Panayiotopoulos, T. Temporal disjunctive logic programming. New Gener Comput 19, 87–100 (2001). https://doi.org/10.1007/BF03037535

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation