This page: http://www.informatik.uni-muenchen.de//~_spranger/da.html"
Stephanie Spranger@informatik.uni-muenchen.de, 2002-09-25

Institut für Informatik der Ludwigs- Maximilians- Universität München

Representation of Temporal Knowledge for Web-based Applications (Diploma Thesis)

This page comprises several papers cited in this diploma thesis' survey on temporal formalism. The diploma thesis' structuring is roughly chosen for the following library.

Change-based Formalisms

Situation Calculus

  • K. Apt and M. Bezem. Acyclic programs. New Generation Computing, 9(3-4):335-363, 1991.

  • A. Baker. Nonmonotonic reasoning in the framework of the situation calculus. Artificial Intelligence, 49(1-3):5-23, 1991.

  • K.van Belleghem, M. Denecker, and D. DeSchreye. Combining situation calculus and event calculus. In Proceedings of the International Conference on Logic Programming, L.Sterling, editor, MIT Press, pages 83-97, 1995.

  • L. Bertossi, M. Arenas, and C. Ferretti. SCDBR: An automated reasoner for specifications of database updates. Journal of Intelligent Information Systems, 10(3):235-280, 1998.

  • Boutilier, C. et al. Decision-theoretic, high-level agent programming in the situation calculus. In Proceedings of the 17th AAAI / 12. IAAI 2000: Austin, TX, USA, pages 355-362, 2000.

  • Burgard, W. et al. The interactive museum tour-guide robot. In Proceedings of the 15th National Conference on Artificial Intelligence (AAAI-98), 1998.

  • C. Evans. Negation as failure as an approach for the Hanks and McDermott problem. In Proceedings of the 2nd International Symposium on Artificial Intelligence, Monterrey, Mexico, pages 1-24, 1989.

  • L. Fangzhen. Applications of the situation calculus to formalizing control and strategic information: The prolog cut. Artificial Intelligence, 103(1-2):273-294, 1998.

  • R. Fikes and N. Nilsson. STRIPS: A new approach to application of theorem proving to problem solving. Artificial Intelligence, 2(3-4):189-208, 1971.

  • R. Fikes, P. Hart, and N.J. Nilsson. Learing and executing generalized robot plans. Artificial Intelligence, 3(4):251-288, 1972.

  • J. Funge. Representing knowledge within the situation calculus using interval-valued epistemic fluents. Journal of Reliable Computing, 5(1), 1999.

  • A. Galton. A critical examination of Allen's theory of action and time. Artificial Intelligence, 42(2-3):159-188, 1990.

  • M. Gelfond, V. Lifschitz, and A. Rabinov. What are the limitations of the situation calculus? In Automated Reasoning, Essays in Honor of Woody Bledsoe, edited by S. Boyer, Kluwer Academic Publishers, pages 167-181, 1991.

  • G.de Giacomo, Y. Lespérance, and H.J. Lévesque. Reasoning about concurrent execution, prioritized interrupts, and exogenous actions in the situation calculus. In Proceedings of the 14th International Joint Conference on Artificial Intelligence, Nagoya, Japan, pages 1221-1226, 1997.

  • C. Green. Theorem proving by resolution as a basis for question - answering systems. In B. Meltzer D. Michie, editor, Machine Intelligence 4, Edinburgh University Press, New York, pages 183-205, 1969.

  • Hobbs, J. et al. DAML-S: Web service description for the Semantic Web. In the 1st International Semantic Web Conference (ISWC), to appear, 2002.

  • Jenkin, M. et al. A logical approach to portable high-level robot programming. In Proceedings of the 10th Australian Joint Conference on Artificial Intelligence, Perth, Australia. Invited paper, 1997.

  • I. Kiringa. Towards a general theory of advanced transaction models in the situation calculus. In Proceedings of the 8th International Workshop on Knowledge Representation meets Databases, Rome, Italy, 2001.

  • R. Kowalski. Database updates in the event calculus. Journal of Logic Programming, 12(1-2):121-146, 1992.

  • R. Kowalski and F. Sadri. The situation calculus and the event calculus compared. In M. Bruynooghe, editor, Proceedings of ILPS-94, pages 539-553, 1994.

  • V. Lifschitz. Towards a metatheory of action. In J.Allen, R.Fikes, E.Sandewall, editors, Proceedings of the 2nd International Conference on Principles Knowledge Representation and Reasoning (KR-91), Los Altos, Morgan Kaufmann Publishers, pages 376-386, 1991.

  • F. Lin and R. Reiter. State constraints revisited. Journal of Logic and Computation, 4(5):655-678, 1994.

  • F. Lin and Y. Shoham. Concurrent actions in the situation calculus. In Proceedings of the 10th AAAI-92, San Jose, California, pages 590-595, 1992.

  • F. Lin and Y. Shoham. Provably correct theories of actions. Journal of the ACM, 42(2):293-320, 1995.

  • H. Lévesque, F. Pirri, and R. Reiter. Foundations for the situation calculus. Linköping Electronic Articles in Computer and Information Science, 3(18), 1998.

  • H. Lévesque, Y. Lespérance, and R. Reiter. A situation calculus approach to modeling and programming agents. In In A. Rao and M.Wooldridge, editors, Foundations and Theories of Rational Agency, pages 275-299, 1999.

  • Lévesque, H. et al. GOLOG: A logic programming language for dynamic domains. Journal of Logic Programming, 31(1-3):59-83, 1997.

  • Lévesque, H, et al. Ability and knowing how in the situation calculus. Studia Logica, 66(1):165-186, 2000.

  • H. Lévesque. What is planning in the presence of sensing?. In Proceedings of the 13th National Conference on Artificial Intelligence (AAAI-96), Portland, OR, pages 1139-1146, 1996.

  • P. Mateus, A. Pacheco, and J. Pinto. Observations and the probabilistic situation calculus. In D. Fensel, et al., editors, Proceedings 8th International Conference on Principles of Knowledge Representation and Reasoning. Morgan Kaufmann, pages 327-338, 2002.

  • J. McCarthy and P. Hayes. Some philosophical problems from the standpoint of artificial intelligence. In B. Meltzer and D. Michie, editors, Machine Intelligence 4, Edinburgh University Press, Edinburgh, Scotland, pages 463-502, 1969.

  • J. McCarthy. Actions and other events in situation calculus. In to appear, 2000.

  • J. McCarthy. Situation calculus with concurrent events and narrative. Stanford University, 2001.

  • S. McIlraith, T. Son, and H. Zeng. Semantic web services. IEEE Intelligent Systems, 16(2):46-53, 2001.

  • J. Pinto and R. Reiter. Adding a time line to the situation calculus. In Proceedings of the 2nd Symposium on Logical Formalizations of Commonsense Reasoning, pages 172-177, 1993.

  • J. Pinto and R. Reiter. Temporal reasoning in logic programming: A case for the situation calculus. In Proceedings of the International Conference on Logic Programming, pages 203-221, 1993.

  • F. Pirri and R. Reiter. Some contributions to the metatheory of the situation calculus. Journal of the ACM, 46(3):261-325, 1999.

  • R. Reiter. On formalizing database updates. In Proceedings of the 3rd EDBT-92, Vienna, Austria, pages 10-20, 1992.

  • R. Reiter. Proving properties of states in the situation calculus. Artificial Intelligence, 64(2):337-351, 1993.

  • R. Reiter. On specifying database updates. Journal of Logic Programming, 25(1):53-91, 1995.

  • R. Reiter. Knowledge in action. In Logical Foundations for Specifying and Implementing Dynamical Systems. MIT Press, 2001.

  • M. Shanahan. Representing continuous change in the event calculus. In Proceedings of the European Conference on Artificial Intelligence, pages 598-603, 1990.

  • M. Shanahan. Explanation in the situation calculus. In Proceedings IJCAI-93, pages 160-165, 1993.

  • S. Shapiro, Y. Lespérance, and H. Lévesque. Goals and rational action in the situation calculus - a preliminary report. In Working Notes of the AAAI Fall Symposium on Rational Agency: Concepts, Theories, Models, and Applications, pages 117-122, 1995.

  • Y. Shoham and N. Goyal. Representing time and action in AI. revised version of: Problems in formal temporal reasoning. Artificial Intelligence, 36(1):49-61, 1988.

  • J. Weber. On the representation of concurrent actions in the situation calculus. In Proceedings of CSCSI-90, Ottawa, Ontario, pages 28-32, 1990.

    Event Calculus

  • I. Cervesato, A. Montanari, and A. Provetti. On the non-monotonic behavior of event calculus for deriving maximal time intervals. Interval Computations, 3(2):83-119, 1993.

  • I. Cervesato, L.Chittaro, and A. Montanari. A general modal framework for the event calculus and its skeptical and credulous variants. In Proceedings of the 1994 Joint Conference on Declarative Programming - GULP-PRODE'94, pages 336-350, 1994.

  • I. Cervesato, L. Chittaro, and A. Montanari. A modal calculus of partially ordered events in a logic programming framework. In Proceedings of ICLP-95: 12th International Conference on Logic Programming, L.Sterling, editor, MIT Press, pages 299-313, 1995.

  • L. Chittaro, A. Montanari, and A. Provetti. Skeptical and credulous event calculi for supporting modal queries. In Proceedings of ECAI-94: 11th European Conference on Artificial Intelligence, A.Cohn, editor, John Wiley and Sons, pages 361-365, 1994.

  • M. Denecker, L. Missiaen, and M. Bruynooghe. Temporal reasoning with abductive event calculus. In Proceedings of ECAI-92, Vienna, Austria, pages 384-388, 1992.

  • K. Eshghi. Abductive planning with event calculus. In Proceedings of the 5th International Conference on Logic Programming, MIT Press, pages 562-579, 1988.

  • A. Fernandes, M. Williams, and N. Paton. A logic-based integration of active and deductive databases. New Generation Computing, 15(2):205-244, 1997.

  • Ch. Jung, K. Fischer, and A. Burt. Multi-agent planning using an abductive event calculus. DFKI Research Report, RR-96-04, 1996.

  • R. Kowalski. Database updates in the event calculus. Journal of Logic Programming, 12(1-2):121-146, 1992.

  • R. Kowalski and M. Sergot. A logic-based calculus of events. New Generation Computing, 4(1):67-95, 1986.

  • R. Miller and M. Shanahan. The event calculus in classical logic --- alternative axiomatizations. Linköping Electronic Articles in Computer and Information Science, 4(16), 1999.

  • R. Miller. Deductive and abductive planning in the event calculus. In Proceedings of the 2nd AISB Workshop on Practical Reasoning and Rationality, Manchester, U.K., 1997.

  • L. Missiaen. Localized abductive planning with the event calculus. PhD Thesis, Department of Computer Science, K.U. Leuven, 1991.

  • J. Pinto and R. Reiter. Temporal reasoning in logic programming: A case for the situation calculus. In Proceedings of the International Conference on Logic Programming, pages 203-221, 1993.

  • R. Reiter. Natural actions, concurrency and continuous time in the situation calculus. In Proceedings of Common Sense 96: 3rd symposium on Logical Formalizations of Commonsense Reasoning, Stanford, CA, pages 2-13, 1996.

  • F. Sadri and R. Kowalski. Variants of the event calculus. In Proceedings of the International Conference on Logic Programming, L.Sterling, editor, MIT Press, pages 67-81, 1995.

  • M. Shanahan. Prediction is deduction but explanation is abduction. In Proceedings of the International Joint Conference on Artificial Intelligence, pages 1055-1060, 1989.

  • M. Shanahan. A circumscriptive calculus of events. Artificial Intelligence, 75(2):249-284, 1995.

  • M. Shanahan. Representing continuous change in the event calculus. In Proceedings of the European Conference on Artificial Intelligence, pages 598-603, 1990.

  • P. Yolum and M. Singh. Flexible protocol specification and execution: Applying event calculus planning using commitments. In Proceedings of the 1st International Joint Conference on Autonomous Agents and MultiAgent Systems (AAMAS), to appear, 2002.

    Dynamic Logic

  • M. Fisher and R. Ladner. Propositional dynamic logic of regular programs. Journal of Computer and System Sciences, 18(2):194-211, 1979.

  • D. Harel, D. Kozen, and J. Tiuryn. Dynamic Logic. MIT Press, 2000.

  • D. Harel. First-order dynamic logic. Lecture Notes in Computer Science, Vol. 68. Springer-Verlag, New York, 1979.

  • D. Harel. Dynamic logic. In D. Gabby et al., editors, Handbook of Philosophical Logic, vol. II, Extensions of Classical Logic, Publishing Company, Dordrecht (NL), 1984.

  • J. Meyer. Dynamic logic reasoning about actions and agents. In Workshop on Logic-Based Artifical Intelligence, Washington, DC, 1999.

  • R. Moore. A formal theory of knowledge and action. In J.R.Hobbs and R.C.Moore, editors, Formal theories of commonsense world. Ablex, Norwood NJ, pages 319-358, 1985.

  • V. Pratt. Semantical considerations on floyd-hoare logic. In Proceedings of the 17th FOCS, IEEF, pages 109-121, 1976.

  • Sierra, C. et al. Descriptive dynamic logic and its application to reflective architectures. In Future Generation Computer Systems 12, pages 157-171, 1996.

  • P. Spruit, R. Wieringa, and J. Meyer. Axiomatization, declarative semantics and operational semantics of passive and active updates in logic databases. Journal of Logic and Computation, 5(1):27-70, 1995.

  • I. Newton. Mathematical principles of natural philosophy. In F.Cajori, editor, 1936.

    Time-based Formalisms

    The Temporal Structure

    Point-based Formalisms

  • J.van Benthem. The logic of time. D. Reidel Publishing Company, 1983; revised and expanded edition, 1991.

  • M. Broxvall and P. Jonsson. Towards a complete classification of tractability in point algebras for nonlinear time. In Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming, pages 129-143, 1999.

  • T. Dean and M. Boddy. Reasoning about partially ordered events. Artificial Intelligence, 36(3):375-399, 1988.

  • A. Galton. A critical examination of Allen's theory of action and time. Artificial Intelligence, 42(2-3):159-188, 1990.

  • P. Ladkin. The logic of time representation. PhD Thesis, University of California, 1987.

  • D. McDermott. A temporal logic for reasoning about processes and plans. Cognitive Science, 6:101-155, 1982.

  • E. McKenzie and R. Snodgrass. An evaluation of algebras incorporating time. Technical Report, TR 89-22, Dept. of Computer Science, University of Arzona, 1989.

  • Y. Shoham. Temporal logics in AI: Semantical and ontological considerations. Artificial Intelligence, 33(1):37-63, 1987.

  • M. Vilain, H. Kautz, and P.van Beek. Constraint propagation algorithms for temporal reasoning: A revised report. In D. S. Weld and J. de Kleer, editors, Readings in Qualitative Reasoning about Physical Systems. Kaufmann, San Mateo, CA, pages 373-381, 1990.

  • R. Washington and B. Hayes-Roth. Incremental abstraction planning for limited-time situations. In M. Ghallab and A. Milani, editors, New Directions in Planning, IOS Press, Amsterdam, pages 91-102, 1996.

    Interval-based Formalisms

  • J. Allen. Maintaining knowledge about temporal intervals. Communications of the ACM, 26(11):832-843, 1983.

  • J. Allen. Towards a general theory of action and time. Artificial Intelligence, 23(2):123-154, 1984.

  • J.van Benthem. The logic of time. D. Reidel Publishing Company, 1983; revised and expanded edition, 1991.

  • T. Gruber and G. Olsen. An ontology for engineering mathematics. In Doyle and Torasso and Sandewall, editors, 4th International Conference on Principles of Knowledge Representation and Reasoning, Morgan Kaufmann, pages 258-269, 1994.

  • P. Hayes and J. Allen. A common-sense theory of time. In Proceedings of the 9th International Joint Conference on Artificial Intelligence, Los Angeles, CA, pages 528-531, 1985.

  • P. Hayes and J. Allen. Short time periods. In Proceedings of IJCAI-87, Los Angeles, CA, pages 981-983, 1987.

  • P. Hayes and J. Allen. Moments and points in an interval-based temporal logic. Computational Intelligence, 5(4):225-238, 1989.

  • P. Hayes. A catalog on temporal theories. Technical Report, UIUC-BI-AI-96-01, University of Illinois, 1995.

  • P. Ladkin. Time representation: A taxonomy of interval relations. In Proceedings AAAI-86, Philadelphia, PA, pages 360-366, 1986.

  • P. Ladkin. The logic of time representation. PhD Thesis, University of California, 1987.

    Point-Interval-based Formalisms

  • J.van Benthem. The logic of time. D. Reidel Publishing Company, 1983; revised and expanded edition, 1991.

  • A. Bochman. Concerted instance-interval temporal semantics: Temporal ontologies. Notre Dame Journal of Formal Logic, 31(3):403-414, 1990.

  • A. Galton. A critical examination of Allen's theory of action and time. Artificial Intelligence, 42(2-3):159-188, 1990.

  • P. Hayes and J. Allen. Moments and points in an interval-based temporal logic. Computational Intelligence, 5(4):225-238, 1989.

  • A. Mourelatos. Events, processes, and states. Linguistics and Philosophy, 2:415-434, 1978.

  • L. Vila. Instants, periods and the dividing instant problem. In IMACS International Workshop on Qualitative Reasoning and Decision Technologies (QUARDET-93), 1993.

  • L. Vila. IP - an instant-period-based theory of time. In R.Rodriguez, editor, Proceedings of the ECAI-94 Workshop on Spatial and Temporal Reasoning, pages 197-201, 1994.

  • L. Vila. Revisiting time and temporal incidence. In F. Anger, editor, Proceedings of the AAAI-96 Workshop on Spatial and Temporal Reasoning, 1996.

  • L. Vila and E. Schwalb. A theory of time and temporal incidence based on instants and periods. Department of Information and Computer Science, California Univ., Irvine, CA, 1996.

  • M. Vilain. A system for reasoning about time. In Proceedings of the 2nd National (US) Conference on Artificial Intelligence, AAAI-82 , Pittsburgh, PA, pages 197-201, 1982.

    Non-convex Intervals

  • W. Davis and J. Carnes. Clustering temporal intervals to generate reference hierarchies. In Proceedings of the 2nd International Conference on Principles of Knowledge Representation and reasoning, J.Allen, et al., editors, Morgan Kaufman, pages 111-117, 1991.

  • L. Khatib and R. Morris. Quantitative structural temporal constraints on repeating events. In Proceedings of TIME-98, pages 74-80, 1998.

  • L. Khatib and R. Morris. Generating scenarios for periodic events with binary constraints. In TIME-99 (IEEE press), the 6th International Workshop on Temporal Representation and Reasoning, Orlando, FL, pages 67-72, 1999.

  • L. Khatib. Reasoning with non-convex intervals. PhD Thesis, Florida Institute of Technology, 1994.

  • J. Koomen. Reasoning about recurrence. Journal of Intelligent Information Systems, 6:461-496, 1991.

  • P. Ladkin. Time representation: A taxonomy of interval relations. In Proceedings AAAI-86, Philadelphia, PA, pages 360-366, 1986.

  • P. Ladkin. The logic of time representation. PhD Thesis, University of California, 1987.

  • B. Leban, D. McDonald, and D. Foster. A representation for collections of temporal intervals. In Proceedings of the AAAI-86, pages 354-371, 1986.

  • G. Ligozat. Generalized intervals: A guided tour. In Proceedings of the ECAI-98 Workshop on Spatial and Temporal Reasoning, Brighton, UK, 1998.

  • R. Morris and L. Khatib. An interval-based temporal relational calculus for events with gaps. Journal of Experimental and Theoretical Artificial Intelligence, 3:87-107, 1991.

  • R. Morris, W. Shoaff, and L. Khatib. Domain independent reasoning about recurring events. Computational Intelligence, 12(3):450-477, 1996.

  • M. Niezette and J.-M. Stevenne. An efficient symbolic representation of periodic time. In Implementing Temporal Reasoning: Workshop Notes, AAAI-92, pages 130-140, 1992.

  • P. Terenziani. Integrating calendar dates and qualitative temporal constraints in the treatment of periodic events. IEEE Transactions on Knowledge and Data Engineering, 9(5):763-783, 1997.

  • P. Terenziani. Integrated temporal reasoning with periodic events. Computational Intelligence, 16(2):210-256, 2000.

  • A. Tuzhilin and J. Clifford. On periodicity in temporal databases. Information Systems, 30(5):619-639, 1995.

    Multidimensional Time

    Temporal Dimensions

  • J. Andany, M. Leonard, and C. Palisser. Management of schema evolution in databases. In Proceedings of the Conference on Very Large Databases, Barcelona, Spain, pages 161-170, 1991.

  • E. Bertino. A view mechanism for object-oriented databases. In Proceedings of the International Conference on Extending Database Technology, Vienna, Austria, pages 136-151, 1992.

  • W. Cellary and G. Jomier. Consistency of versions in object-oriented databases. In Proceedings of the VLDB Conference, pages 432-441, 1990.

  • S. Chakravarthy and S.-K. Kim. Resolution of time concepts in temporal databases. Information Sciences, 80(1-2):91-125, 1994.

  • J. Chomicki and G. Saake. Logics for database and information systems. Kluwer Academic Publishers, Boston/Dordrecht/London, 1998.

  • G. Copeland and D. Maier. Making smalltalk a database system. In Proceedings of the ACM SIGMOD International Conference on Management of Data, Boston, MA, pages 316-325, 1984.

  • Doucet, A., et al. Integrity constraints and versions. In Proceedings of the 6th International Workshop on Foundations of Models and Languages for Data and Objects, Integrity in Databases, Dagstuhl Castle, Germany, pages 25-39, 1996.

  • M. Dumas, M.-C. Fauvet, and P.-C. Scholl. TEMPOS: A temporal database model seamlessly extending ODMG. Research Report, 1013-ILSR -7, LSR-IMAG, Grenoble, France, 1999.

  • Dumas, M. et al. TEMPOS: managing time and histories on top of OO-DBMS. In Proceedings of EDBT'98 demo session, Valencia, Spain, 1999.

  • C. Dyreson and R. Snodgrass. Supporting valid-time indeterminacy. ACM Transactions on Database Systems, 23(1):1-57, 1998.

  • S. Gadia and C. Yeung. A generalized model for a relational temporal database. In Proceedings of the International Conference on Management of Data, Chicago, pages 251-259, 1988.

  • S. Gançarski. Database versions to represent bitemporal databases. In Proceedings of Database and Expert Systems Applications (DEXA) Conference, Florence, Italy, 1999.

  • I. Goralwalla, M. Özsu, and D. Szafron. An object-oriented framework for temporal data models. In Temporal Databases: Research and Practice, LNCS 1399, pages 1-35, 1997.

  • H. Gregersen and C. Jensen. Conceptual modeling of time-varying information. Time Center, Technical Report, TR-35, 1998.

  • S. Imfeld. Time, points, and space - towards a better analysis of wildlife data in GIS. PhD Thesis, Universität Zürich, 2000.

  • C. Jensen and C. Dyreson (editors). The consensus glossary of temporal database concepts - February 1998 version. http://cs.engr.uky.edu/ dekhtyar/685/papers/, 1998.

  • C. Jensen and R. Snodgrass. Semantics of time-varying information. Information Systems, 21(4):311-352, 1996.

  • Z. Kemp and A. Kowalczyk. Incorporating the temporal dimension in a GIS. In Michael Worboys, editor, Innovations in GIS 1. Taylor & Francis, London, UK., Innovations in GIS 1, chapter 7. Taylor and Francis, London, 1994.

  • P. Klahold, G. Schlageter, and W. Wilkes. A general model for version management in databases. In Proceedings of the 12th VLDB Conference, Kyoto, Japan, pages 319-327, 1986.

  • Lum, V. et al. Designing DBMS support for temporal dimension. In Proceedings of the ACM SIGMOD International Conference, Boston, MA, pages 115-126, 1984.

  • M. Nascimento and M. Eich. Decision time for temporal databases. In Proceedings TIME-95, Melbourne Beach, FL, pages 157-162, 1995.

  • J. Roddick. A survey of schema versioning issues for database systems. Information and Software Technology, 37(7):383-393, 1995.

  • J. Roddick. A model for schema versioning in temporal database systems. Aust. Computer Science Communication, 18(1):446-452, 1996.

  • R. Snodgrass and I. Ahn. A taxonomy of time in databases. In Proceedings of the International Conference on Management of Data, Austin, Texas, pages 236-246, 1985.

  • R. Snodgrass and I. Ahn. Temporal databases. IEEE Transactions on Computers, 19(9):35-42, 1986.

  • Yearsley, C. et al. Computational support for spatial information handling: Models and algorithms. In Michael Worboys, editor, Innovations in GIS 1, chapter 6. Taylor and Francis, London, 1994.

  • S. Zdonik. Version management in an object-oriented database. In Proceedings of the IFIP International Workshop on Advanced Programming Environments, Trondheim, Norway, pages 405-422, 1987.

    Applying Temporal Dimensions to the Web

  • J. Campos and M. Silva. Versus: A temporal Web repository. Universidade de Lisboa, 2001.

  • S.-Y. Chien, V. Tsotras, and C. Zaniolo. A Comparative study of version management schemes for XML documents. Time Center, Technical Report, TR-51, 2000.

  • F. Douglis and T. Ball. An internet difference engine and its applications. In Digest of Papers, COMPCON-96, pages 71-76, 1996.

  • Douglis, F. et al. WebGUIDE: Querying and navigating changes in web repositories. In Proceedings of the 5th International WWW Conference, Paris, France, Computer Networks 28(7-11), pages 1335-1344, 1996.

  • Douglis, F. et al. The AT&T internet difference engine: Tracking and viewing changes on the web. World Wide Web, 1(1):27-44, 1998.

  • C. Dyreson. Towards a temporal World Wide Web: A transaction-time server. In Proceedings of the Australian Database Conference, Gold Coast, Australia, pages 290-301, 2001.

  • Extensible Markup Language (XML). http://www.w3.org/XML. W3C, 2000.

  • F. Grandi and F. Mandreoli. The valid Web: It's time to go. Time Center, Technical Report, TR-46, 1999.

  • F. Grandi and F. Mandreoli. The valid web: An XML/XSL infrastructure for temporal management of web documents. In Proceedings of the ADVIS 2000 - International Conference on Advances in Information Systems , Izmir, Turkey, Lecture Notes in Computer Science, Springer Verlag, Berlin, pages 294-303, 2000.

  • J. Hunt and J. Reuter. Using the web for document versioning. an implementation report for DeltaV. In Proceedings of the 23rd International Conference on Software Engineering, Toronto, pages 507-513, 2001.

  • WebDAV. Corp. http://www.webdav.org, 2001.

  • XFront. XML Schema versioning. http://www.xfront.com/Versioning.pdf, 2001.

  • XML Schema. http://www.w3.org/XML/Schema. W3C, 2001.

    A Representation Scheme for Temporal Formalisms

    Calendar Systems

  • T. Anderson. Modeling events and processes at the conceptual level. In Proceedings of the 2nd International Conference on Databases. Ed. S.M. Deen and P. Hammersley. The British Computer Society. Cambridge, Great Britain: Wiley Heyden Ltd., pages 151-168, 1983.

  • C. Bettini, S. Jajodia, and S. Wang. Time granularities in databases, datamining, and temporal reasoning. Springer Verlag, Berlin, 2000.

  • C. Bettini, X. Wang, and S. Jajodia. Testing complex temporal relationships involving multiple granularities and its application to data mining. In Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, ACM Press, Montreal, Canada, pages 68-78, 1996.

  • C. Bettini, X. Wang, and S. Jajodia. A general framework for time granularity and its application to temporal reasoning. Annals of Mathematics and Artificial Intelligence, 22(1-2):29-58, 1998.

  • J. Clifford and A. Rao. A simple general structure for temporal domains. In C. Rolland, and M. Leonard, editors, Temporal Aspects of Information Systems, Elsevier Science Publishers B.V., IFIP, pages 17-28, 1987.

  • N. Dershowitz and E. Reingold. Calendrical calculations. Software-Practice and Experience, 20(9):899-928, 1990.

  • Dumas, M. et al. TEMPOS: managing time and histories on top of OO-DBMS. In Proceedings of EDBT'98 demo session, Valencia, Spain, 1999.

  • Dyreson, C. et al. Efficiently supporting temporal granularities. Time Center, Technical Report, TR-31, 1998.

  • C. Dyreson, R. Snodgrass, and M. Freiman. Efficiently supporting temporal granularities in a DBMS. FTP, Technical Report 95/7, James Cook University, Australia, 1995.

  • Goralwalla, I. et al. Modeling temporal primitives: Back to basics. In Proceedings of the 6th International Conference on Information and Knowledge Management (CIKM-97), pages 24-31, 1997.

  • Goralwalla, I. et al. Temporal granularity: completing the puzzle. Journal of Intelligent Information Systems, 16(1):41-63, 2001.

  • N. Kline, J. Li, and R. Snodgrass. Specifying multiple calendars, calendric systems, and field tables and functions in TimeADT. Time Center, Technical Report, TR-41, 1999.

  • S. Kraus, Y. Sagiv, and V. Subrahmanian. Representing and integrating multiple calendars. University of Maryland, Technical Report, CS-TR-3751, 1996.

  • H. Lin. Efficient conversion between temporal granularities. Time Center, Technical Report, TR-19, 1997.

  • P. Ning, X. Wang, and S. Jajodia. An algebraic representation of calendars. In the Annuals of Mathematics and Artificial Intelligence (Kluwer), to appear, 2001.

  • H. Ohlbach and D. Gabbay. Calendar logic. Journal of Applied Non-classical Logics, 8(4):291-324, 1998.

  • H. Ohlbach. About real time, calendar systems and temporal notions. In H. Barringer, et al., editors, Advances in Temporal Logic, Kluwer Academic Publishers, pages 319-338, 1999.

  • D. Randall, H. Hamilton, and R. Hilderman. Generalization for calendar attributes using domain generalization graphs. In Proceedings of the 5th International Workshop on Temporal Representation and Reasoning (TIME-98), Sanibel Island, Florida, pages 177-184, 1998.

  • E. Reingold and N. Dershowitz. Calendrical calculations, II: Three historical calendars. Software-Practice and Experience, 23(4):383-404, 1993.

  • E. Reingold and N. Dershowitz. Calendrical calculations: The millennium edition. Cambridge University Press, 2001.

  • Snodgrass, R. et al. The multical project. In http://www.eecs.wsu.edu/~cdyreson/pub/temporal/multical.htm, 1993-1997.

  • M. Soo and R. Snodgrass. Mixed calendar query language support for temporal constants. TempIS, Technical Report 29. Computer Science Department, University of Arizona, 1992.

  • X. Wang, S. Jajodia, and V. Subrahmanian. Temporal modules: An approach toward federated temporal databases. In ACM SIGMOD International Conference on Management of Data, Washington, D.C., pages 227-236, 1993.

  • X. Wang. Algebraic query languages on temporal databases with multiple time granularities. In Proceedings of the International Conference on Information and Knowledge Management (CIKM), Baltimore, Maryland, pages 304-311, 1995.

  • G. Wiederhold, S. Jajodia, and W. Litwin. Dealing with granularity of time in temporal databases. In Lecture Notes in Computer Science, vol. 498, R. Anderson et al., editors, Springer-Verlag, 1991.

  • R. Zhang and E. Unger. Calendar algebra. Kansas State University, Technical Report, 1996.

    XML Schema's Means for Representing Time and Calendars

  • Extensible Markup Language (XML). http://www.w3.org/XML. W3C, 2000.

  • XML Schema. http://www.w3.org/XML/Schema. W3C, 2001.

  • XMLSchema Part2. http://www.w3.org/TR/2001/REC-xmlschema-2. W3C, 2001.

  • ISO-8601 Representation of dates and times. http://www.iso.ch/markete/8601.pdf. International Organization for Standardization, 2000.

    Some publications about Web-based scheduling and planning systems:

  • Adytum. Adytum System. http://www.adaytum.com/, 2002.

  • DMOZ. Open directory project. Event Planning and management. http://dmoz.org/Business/Industries/Hospitality/Software/EventPlanning/, 2002.

  • EPS Software. Budget 2000 System. http://www.epssoftware.com/, 2000.

  • G. FitzPatrick. Calendaring and scheduling with XML-RDF. In XML Conference and Exposition, Orlando, Fl, 2001.

  • Geac Corp. The Smart Stream Budget System. http://www.geac.com/, 2002.

  • Helmsman Group Inc. Helmsman System. http://www.helmsmangroup.com/, 1999.

  • NetAppointment. Net Appointment Scheduler. http://www.netappointment.com/, 2001.

  • Planet Corp. Budget Maestro. http://www.budgetnow.com, 2001.

  • V. Pratt. Semantical considerations on floyd-hoare logic. In Proceedings of the 17th FOCS, IEEF, pages 109-121, 1976.

  • Appointment Quest. Online scheduling software. http://www.appointmentquest.com/, 2000.

  • Net Simplicity. Meeting Room Manager 2002. http://www.netsimplicity.com/, 2002.

  • S.Sen. An automated distributed meeting scheduler. IEEE Expert, 12(4):41-45, 1997.

  • Robert St.Amant. AI Planning Resources. NC State University, 1999.

    It has to be mentioned, that there are indeed a good deal more temporal formalisms for knowledge representation provided in the literature. We have only refered to a few of them which seem to be crucial or at least interesting.

    On the following Web pages, collected links of authors and papers concerning temporal formalisms are addressed:

    A bibliography on temporal reasoning.

    Links regarding to temporal databases.

    Planning and Scheduling in Artificial Intelligence.

    Planning in Artificial Intelligence.

    IfI Institut                n LMU Universität