Guided tour through some extensions of the Event Calculus

Computational Intelligence

Volumn 16, Issue 2, 2000, Pages 307-347

  Cervesato, Iliano ^a   Franceschet, Massimo ^b   Montanari, Angelo ^b  

^a Stanford University   (United States)

^b UNIVERSITY OF UDINE   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL LINGUISTICS; LOGIC PROGRAMMING; PROLOG (PROGRAMMING LANGUAGE);

EVENT CALCULUS;

ARTIFICIAL INTELLIGENCE;

EID: 0033902739     PISSN: 08247935     EISSN: None     Source Type: Journal    
DOI: 10.1111/0824-7935.00115     Document Type: Article

References (30)

1. CERVESATO, I., L. CHITTARO, and A. MONTANARI. 1995. A modal calculus of partially ordered events in a logic programming framework. In Proceedings of the Twelfth International Conference on Logic Programming - ICLP'95, Kanagawa, Japan. Edited by L. Sterling. MIT Press, Cambridge, MA, pp. 299-313.
2. CERVESATO, I., L. CHITTARO, and A. MONTANARI. 1996. A general modal framework for the event calculus and its skeptical and credulous variants. In Proceedings of the Twelfth European Conference on Artificial Intelligence - ECAI'96, Budapest. Edited by W. Wahlster. John Wiley & Sons, New York, pp. 33-37.
3. CERVESATO, I., M. FRANCESCHET, and A. MONTANARI. 1997a. A hierarchy of modal event calculi: Expressiveness and complexity. In Proceedings of the Second International Conference on Temporal Logic - ICTL'97, Manchester. Edited by H. Barringer, M. Fisher, D. Gabbay, and G. Gough. Kluwer Academic Publishers, Dordrecht.
4. CERVESATO, I., M. FRANCESCHET, and A. MONTANARI. 1997b. Modal event calculi with preconditions. In Proceedings of the Fourth International Workshop on Temporal Representation and Reasoning - TIME'97, Daytona Beach. Edited by R. Morris and L. Khatib. IEEE Computer Society Press, New York, pp. 38-45.
5. CERVESATO, I., M. FRANCESCHET, and A. MONTANARI. 1998a. The complexity of model checking in modal event calculi with quantifiers. In Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning - KR'98, Trento. Italy. Edited by T. Cohn and L. Schubert. Morgan Kaufmann, San Mateo, CA, pp. 361-365.
6. CERVESATO, I., M. FRANCESCHET, and A. MONTANARI. 1998b. The complexity of model checking in modal event calculi with quantifiers. Journal of Electronic Transactions on Artificial Intelligence, 2:1-23. [Extended and revised version of Cervesato et al. (1998a).]
7. CERVESATO, I., M. FRANCESCHET, and A. MONTANARI. 1998c. Event calculus with explicit quantifiers. In Proceedings of the Fifth International Workshop on Temporal Representation and Reasoning - TIME'98, Sanibel Island, FL. Edited by R. Morris and L. Khatib. IEEE Computer Society Press, New York, pp. 81-88.
8. CERVESATO, I., and A. MONTANARI. 1999. A general modal framework for the event calculus and its skeptical and credulous variants. Journal of Logic Programming, 38(2):111-164. [Extended and revised version of Cervesato et al. (1996).]
9. CERVESATO, I., A. MONTANARI, and A. PROVETTI. 1993. On the non-monotonic behavior of the event calculus for deriving maximal time intervals. International Journal on Interval Computations, 2:83-119.
10. CHITTARO, L., A. MONTANARI, and I. CERVESATO. 1995. Speeding up temporal reasoning by exploiting the notion of kernel of an ordering relation. In Proceedings of the Second International Workshop on Temporal Representation and Reasoning - TIME'95, Melbourne Beach, FL. Edited by S. Goodwin and H. Hamilton, pp. 73-80.
11. CHITTARO, L., A. MONTANARI, and A. PROVETTI. 1994. Skeptical and credulous event calculi for supporting modal queries. In Proceedings of the Eleventh European Conference on Artificial Intelligence - ECAI'94. Edited by A. Cohn. John Wiley & Sons, New York, pp. 361-365.
12. DEAN, T., and M. BODDY. 1988. Reasoning about partially ordered events. Artificial Intelligence, 36:375-399.
13. DENECKER, M., L. MISSIAEN, and M. BRUYNOOGHE. 1992. Temporal reasoning with abductive event calculus. In Proceedings of the Tenth European Conference on Artificial Intelligence - ECAI'92. Edited by B. Neumann. John Wiley & Sons, New York, pp. 384-388.
14. ESHGHI, K. 1988. Abductive planning with event calculus. In Proceedings of the Fifth International Conference on Logic Programming - ICLP'88, Seattle. MIT Press, Cambridge, MA, pp. 562-579.
15. EVANS, C. 1990. The macro-event calculus: Representing temporal granularity. In Proceedings of the Pacific Rim International Conference on Artificial Intelligence - PRICAI'90, Nagoya, Japan. IOS Press, Amsterdam.
16. FRANCESCHET, M., and A. MONTANARI. 1999a. A graph-theoretic approach to efficiently reasoning about partially ordered events in the event calculus. In Proceedings of the Sixth International Workshop on Temporal Representation and Reasoning - TIME'99, Orlando, FL. Edited by C. Dixon and M. Fisher. IEEE Computer Society Press, New York, pp. 55-66.
17. FRANCESCHET, M., and A. MONTANARI. 1999b. Pairing transitive closure and reduction to efficiently reason about partially ordered events. In Proceedings of the Third International Workshop on Nonmonotonic Reasoning, Action and Change at IJCAI'99 - NRAC'99. Edited by M. Thielscher. pp. 79-86.
18. KERAVNOU, E., and J. WASHBROOK. 1990. A temporal reasoning framework used in the diagnosis of skeletal dysplasias. Artificial Intelligence in Medicine, 2:239-265.
19. KOWALSKI, R., and M. SERGOT. 1986. A logic-based calculus of events. New Generation Computing, 4:67-95.
20. MC CARTHY, J., and P. J. HAYES. 1969. Some philosophical problems from the standpoint of artificial intelligence. In Machine Intelligence, vol. 4. Edited by B. Meltzer and D. Michie. Edinburgh University Press, Edinburgh, pp. 463-502.
21. MILLER, D. 1996. Lambda Prolog: An introduction to the language and its logic. Current draft available from http://cse.psu.edu/~dale/lProlog.
22. MILLER, D., G. NADATHUR, F. PFENNING, and A. SCEDROV. 1991. Uniform proofs as a foundation for logic programming. Annals of Pure and Applied Logic, 51:125-157.
23. MONTANARI, A., E. MAIM, E. CIAPESSONI, and E. RATTO. 1992. Dealing with time granularity in the event calculus. In Proceedings of the International Conference on Fifth Generation Computer Systems - FGCS'92, Tokyo, Institute for New Generation Computer Technology, Tokyo, pp. 702-712.
24. NÖKEL, K. 1991. Temporarily Distributed Symptoms in Technical Diagnosis. Springer-Verlag, LNAI 517, Berlin.
25. PAPADIMITRIOU, C. 1994. Computational Complexity. Addison-Wesley, Reading, MA.
26. SANDEWALL, E. 1994. Features and Fluents: A Systematic Approach to the Representation of Knowledge about Dynamical Systems. Oxford University Press.
27. SCHROEDER, D. 1995. Staying Healthy in Asia, Africa and Latin America. Moon Publications.
28. SHANAHAN, M. 1989. Prediction is deduction but explanation is abduction. In Proceedings of the Eleventh International Joint Conference on Artificial Intelligence - IJCAI'89, Detroit. Morgan Kauffman, San Mateo, CA, pp. 1050-1055.
29. SHANAHAN, M. 1990. Representation of continuous change in the event calculus. In Proceedings of the Nineth Conference on Artificial Intelligence - ECAI'90, Stockholm. John Wiley & Sons, New York, pp. 598-603.
30. STERLING, L., and E. SHAPIRO. 1994. The Art of Prolog: Advanced Programming Techniques. MIT Press, Cambridge, MA.