Definition
Temporal Constraints describe relationships among variables that refer somehow to time. A set of temporal constraints can be stored in a temporal database, which is queried by temporal queries during problem solving. For example, a set of temporal constraints may form some requirements, all of which must be satisfied during some scheduling problem.
Most interesting temporal constraints derive from references to time in natural language. Such references typically compare two time points, two sets of time points, or two time intervals. The literature on temporal constraints and this entry focuses on the study of these types of comparative or binary constraints.
Historical Background
The seminal work on temporal intervals is by Allen [1]. Difference Bounded Matrices (see the Section on Scientific Fundamentals) were introduced by Dill [3]. A graph representation of difference constraints and efficient constraint satisfaction problem-based solutions for consistency of difference...
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Recommended Reading
Allen J.F. Maintaining knowledge about temporal intervals. Commun. ACM, 26(11):832–843, 1983.
Dechter R., Meiri I., and Pearl J. Temporal constraint networks. Artif. Intell., 49(1-3):61–95, 1991.
Dill D.L. Timing assumptions and verification of finite-state concurrent systems. In Proc. Automatic Verification Methods for Finite State Systems, 1989, pp. 197–212.LNCS 407.
Kabanza F., Stevenne J.-M., and Wolper P. Handling infinite temporal data. J. Comput. Syst. Sci., 51(1):1–25, 1995.
Kanellakis P.C., Kuper G.M., and Revesz P. Constraint query languages. J. Comput. Syst. Sci., 51(1):26–52, 1995.
Koubarakis M. The complexity of query evaluation in indefinite temporal constraint databases. Theor. Comput. Sci., 171(1-2):25–60, 1997.
Kuncak V., Nguyen H.H., and Rinard M.C. An algorithm for deciding BAPA: Boolean Algebra with Presburger Arithmetic. In Proc. 20th Int. Conf. on Automated Deduction, 2005, pp. 260–277.
G.M., Kuper L., and Libkin J. (eds.). Paredaens Constraint Databases. Springer, Berlin Heidelberg New York, 2000.
Lahiri S.K. and Musuvathi M. An efficient decision procedure for UTVPI constraints. In Proc. 5th Int. Workshop on Frontiers of Combining Systems, 2005, pp. 168–183.LNCS 3717.
Péron M. and Halbwachs N. An abstract domain extending difference-bound matrices with disequality constraints. In Proc. 8th Int. Conf. on Verification, Model Checking, and Abstract Interpretation, 2007, pp. 268–282.LNCS 4349.
Revesz P. A closed-form evaluation for Datalog queries with integer (gap)-order constraints. Theor. Comput. Sci., 116(1):117–49, 1993.
Revesz P. Introduction to Constraint Databases. Springer, Berlin Heidelberg New York, 2002.
Revesz P. Quantifier-elimination for the first-order theory of Boolean algebras with linear cardinality constraints. In Proc. 8th Conf. on Advances in Databases and Information Systems, 2004, pp. 1–21.LNCS 3255.
Rosenkrantz D.J. and Hunt H.B. Processing conjunctive predicates and queries. In Proc. 6th Int. Conf. on Very Data Bases, 1980, pp. 64–72.
Toman D. and Chomicki J. Datalog with integer periodicity constraints. J. Logic Program., 35(3):263–290, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer Science+Business Media, LLC
About this entry
Cite this entry
Revesz, P. (2009). Temporal Constraints. In: LIU, L., ÖZSU, M.T. (eds) Encyclopedia of Database Systems. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-39940-9_391
Download citation
DOI: https://doi.org/10.1007/978-0-387-39940-9_391
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-35544-3
Online ISBN: 978-0-387-39940-9
eBook Packages: Computer ScienceReference Module Computer Science and Engineering