Chronolog(ID:2225/men004)
Temporal version of Prolog
Temporal version of Prolog
Related languages
References:
Wadge, W. W. Tense logic programming: a respectable alternative. Department of Computer Science, University of Victoria, Victoria, B.C., Canada, 1985 view details
Rolston, D. W. Chronolog: A pure tense-logic-based infinite-object programming language. Department of Computer Science and Engineering, Arizona State University, Tempe, Arizona, Aug. 1986 view details
Rolston, D. W. Toward a tense-logic-based mitigation of the frame problem. In F. M. Brown, editor, Proc. of the 1987 Workshop on the Frame Problem in AI, Lawrence, Kansas, Apr. 1987. Morgan Kaufmann view details
Wadge, W. W. "Tense logic programming: a respectable alternative" In Proc. of the 1988 International Symposium on Lucid and Intensional Programming, pp. 26-32, Sidney, B.C., Canada, Apr. 7-8 1988 view details
Bohlen, M. and R. Marti. A Temporal Extension of the Deductive Database System ProQuel. Technical report, Departement Informatik, ETH Zurich, 1992. view details
Orgun, M. A. and W. W. Wadge "Chronolog admits a complete proof procedure" pp120-135 view details
Abstract: Chronolog(Z) is a logic programming language based on a linear-time temporal logic with unbounded past and future. It is suitable for applications involving the notion of dynamic change such as modelling periodical changes, non-terminating computations and temporal databases. The declarative semantics of Chronolog(Z) programs are given in terms of temporal Herbrand models and the operational semantics in terms of a resolution-type proof procedure called TiSLD-resolution. TiSLD-resolution is based on the axioms and the rules of inference of the underlying temporal logic. It is shown that TiSLD-resolution is sound and complete. The equivalence of the declarative and the operational semantics of Chronolog(Z) programs is also established.
in Proc. of ISLIP'93: The 6th International Symposium on Lucid and Intensional Programming (Quebec City, Canada. April 26-27). Universite Laval, 1993 view details
Bohlen, M. and R. Marti. On the Completeness of Temporal Database Query Languages. In Proceedings of the First International Conference on Temporal Logic, July 1994, pages 283-300 view details
in Proc. of ISLIP'93: The 6th International Symposium on Lucid and Intensional Programming (Quebec City, Canada. April 26-27). Universite Laval, 1993 view details
Bohlen, M. Managing Temporal Knowledge in Deductive Databases. PhD thesis, Departement Informatik, ETH Zurich, 1994. view details
in Proc. of ISLIP'93: The 6th International Symposium on Lucid and Intensional Programming (Quebec City, Canada. April 26-27). Universite Laval, 1993 view details
Orgun, Mehmet A. "Temporal and Modal Logic Programming: An Annotated Bibliography" SIGART Bulletin 1994
view details
in Proc. of ISLIP'93: The 6th International Symposium on Lucid and Intensional Programming (Quebec City, Canada. April 26-27). Universite Laval, 1993 view details
Bohlen, M. Temporal Database System Implementations. SIGMOD RECORD, 1995, 24(4), pages 53{60. view details
in Proc. of ISLIP'93: The 6th International Symposium on Lucid and Intensional Programming (Quebec City, Canada. April 26-27). Universite Laval, 1993 view details
Liu, Chuchang and Orgun, Mehmet A. "Knowledge-based simulation with Chronolog" pp273-286 view details
in Orgun, M.A. and E.A. Ashcroft, editors, Intensional Programming I, World-Scientific, Singapore, 1996 view details
Orgun, Mehmet A. Faustini, Anthony A. "The Chronolog family of languages" pp722-724 view details
in Journal of Symbolic Computation 22(5-6) Nov./Dec. 1996 Special issue: executable temporal logics view details
Resources - Intelligent Systems Group at MacQuarie
Temporal logic programming
Project coordinator: M. A. Orgun
The main objective of this project is to lay the groundwork for a new family of logic programming languages, systems, and tools based on temporal logics. The project continues and generalizes earlier work on Chronolog (a temporal version of Prolog). Applications of these new languages include:
modeling simulation tasks,
temporal deductive databases,
modeling dataflow computations.
The project also involves the investigation of fundamental problems involved in implementing these new languages efficiently on existing conventional and on new multi-processor architectures. Implementation of Chronolog has been carried out jointly with Dr. Kang Zhang.
external link
- Intensional Logic Programming
Intensional Logic Programming The main objective of this project is to lay the groundwork for a new family of logic programming languages, systems, and tools based on intensional (i.e., temporal and modal) logics. Intensional logic allows us to capture the dynamic aspects of certain problems in a natural and problem-oriented way. The project also continues and generalises earlier work on Chronolog (a temporal version of Prolog). Applications of these new languages include: knowledge-based simulation, temporal deductive databases, multi-dimensional spreadsheets, specification and animation of computations. The project also involves the investigation of fundamental problems in implementing these new languages efficiently on existing conventional and on new multi-processor architectures. Implementation of Chronolog has been carried out jointly with Dr. Kang Zhang (Macquarie University). Work on multidimensional logic spreadsheets has been carried out with Dr. Weichang Du of The University of New Brunswick, Saint John, Canada.external link
- ChronoLog at SIGMOD
ChronoLog is an interval timestamped temporal deductive database system running as a frontend to the commercial (relational) database system Oracle. Temporal requests (i.e., ChronoLog-commands) are compiled into (sequences) of SQL-commands that are executed by the commercial database backend. Special care was given to the design of a user-friendly data manipulation language that supports temporal counterparts of all relational algebra operators.
Furthermore, ChronoLog features
- ChronoLog, a logic-based data manipulation language
- facts, rules, and integrity constraints
- three time dimensions: valid time (vt), user-defined time (udt), and transaction time (tt)
- temporal join, temporal negation, temporal disjunction, temporal selection, and temporal projection
- enforcement of coalesced (i.e., maximal) valid-time intervals
- a temporally complete query language
- temporal update operations
- historical operations
- ChronoSQL, a SQL-based temporal query language
- a terminal interface
- a graphical interface (Tcl, Tk, and Tcl-DP based)
- full DBMS functionality (all data-related computations are performed by Oracle)
external link
|