Towards a general theory of action and time
Artificial Intelligence
Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
A temporally oriented data model
ACM Transactions on Database Systems (TODS)
Automata-Theoretic techniques for modal logics of programs
Journal of Computer and System Sciences
Making believers out of computers
Artificial Intelligence
Adding time dimension to relational model and extending relational algebra
Information Systems
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Horn tables-an efficient tool for handling incomplete information in databases
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Temporal logic programming is complete and expressive
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proceedings of the first international conference on Principles of knowledge representation and reasoning
Temporal deductive databases and infinite objects
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Checking that finite state concurrent programs satisfy their linear specification
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Formal semantics for time in databases
ACM Transactions on Database Systems (TODS)
Maintaining knowledge about temporal intervals
Communications of the ACM
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Reasoning about change: time and causation from the standpoint of artificial intelligence
Reasoning about change: time and causation from the standpoint of artificial intelligence
On the representation of infinite temporal data and queries (extended abstract)
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Finite representation of infinite query answers
ACM Transactions on Database Systems (TODS)
On completeness of historical relational query languages
ACM Transactions on Database Systems (TODS)
Database querying and constraint programming
ACM SIGACT News
Constraint programming and database languages: a tutorial
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Strategic directions in constraint programming
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
Constraint databases: promising technology or just intellectual exercise?
ACM Computing Surveys (CSUR) - Special issue: position statements on strategic directions in computing research
Logical design for temporal databases with multiple granularities
ACM Transactions on Database Systems (TODS)
Constraint Programming: Strategic Directions
Constraints
Integrating Calendar Dates and Qualitative Temporal Constraints in the Treatment of Periodic Events
IEEE Transactions on Knowledge and Data Engineering
Temporal Semantic Assumptions and Their Use in Databases
IEEE Transactions on Knowledge and Data Engineering
Symbolic User-Defined Periodicity in Temporal Relational Databases
IEEE Transactions on Knowledge and Data Engineering
Representation & Querying of Temporal Conflict
FQAS '02 Proceedings of the 5th International Conference on Flexible Query Answering Systems
A Temporal Relational Algebra as Basis for Temporal Relational Completeness
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Factual and Temporal Imperfection
ADVIS '00 Proceedings of the First International Conference on Advances in Information Systems
Representation of Temporal Unawareness
ADVIS '02 Proceedings of the Second International Conference on Advances in Information Systems
An effective decision procedure for linear arithmetic over the integers and reals
ACM Transactions on Computational Logic (TOCL)
Spatiotemporal Connectives for Security Policy in the Presence of Location Hierarchy
TrustBus '08 Proceedings of the 5th international conference on Trust, Privacy and Security in Digital Business
Supporting temporal reasoning by mapping calendar expressions to minimal periodic sets
Journal of Artificial Intelligence Research
Evaluating Exceptions on Time Slices
ER '09 Proceedings of the 28th International Conference on Conceptual Modeling
Querying multi-granular compact representations
DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
Foundations of data-aware process analysis: a database theory perspective
Proceedings of the 32nd symposium on Principles of database systems
| Hi-index | 0.00 |
In this paper, we present a powerful framework for describing, storing, and reasoning about infinite temporal information. This framework is an extension of classical relational databases. It represents infinite temporal information by generalized tuples defined by linear repeating points and constraints on these points. We prove that relations formed from generalized tuples are closed under the operations of relational algebra. A characterization of the expressiveness of generalized relations is given in terms of predicates definable in Presburger arithmetic. Finally, we provide some complexity results.