Incomplete Information in Relational Databases
Journal of the ACM (JACM)
Artificial Intelligence
Expressing combinatorial optimization problems by linear programs
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Constraint propagation algorithms for temporal reasoning: a revised report
Readings in qualitative reasoning about physical systems
Exact and approximate reasoning about temporal relations
Computational Intelligence
Telos: representing knowledge about information systems
ACM Transactions on Information Systems (TOIS)
On the representation and querying of sets of possible worlds
Selected papers of the workshop on Deductive database theory
Artificial Intelligence - Special issue on knowledge representation
Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra
Journal of the ACM (JACM)
Efficient algorithms for qualitative reasoning about time
Artificial Intelligence
On the computational complexity of querying bounds on differences constraints
Artificial Intelligence
From local to global consistency in temporal constraint networks
Theoretical Computer Science - Special issue: principles and practice of constraint programming
The complexity of query evaluation in indefinite temporal constraint databases
Selected papers from the international workshop on Uncertainty in databases and deductive systems
The complexity of querying indefinite data about linearly ordered domains
Journal of Computer and System Sciences - Special issue: dedicated to the memory of Paris Kanellakis
Constraint query languages (preliminary report)
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Deciding Linear Inequalities by Computing Loop Residues
Journal of the ACM (JACM)
Maintaining knowledge about temporal intervals
Communications of the ACM
Problem of Incomplete Information in Relational Databases
Problem of Incomplete Information in Relational Databases
PPCP '94 Proceedings of the Second International Workshop on Principles and Practice of Constraint Programming
LaTeR: A General Purpose Manager of Temporal Information
ISMIS '94 Proceedings of the 8th International Symposium on Methodologies for Intelligent Systems
Extending Temporal Relational Databases to Deal with Imprecise and Qualitative Temporal Information
Proceedings of the International Workshop on Temporal Databases: Recent Advances in Temporal Databases
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
A linear-programming approach to temporal reasoning
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Querying Temporal Constraint Networks: A Unifying Approach
Applied Intelligence
STDBM '99 Proceedings of the International Workshop on Spatio-Temporal Database Management
The VLDB Journal — The International Journal on Very Large Data Bases
| Hi-index | 0.00 |
We start with the assumption that temporal knowledge usually cared by constraint networks can be represented and queried more effectively by using the scheme of indefinite constraint databases proposed by Koubarakis. Although query evaluation in this scheme is in general a hard computational problem, we demonstrate that there are sevral interesting cases where query evalation can be done in PTIME. These tractability results are original and subsume previous results by van Beek, Brusoni, Console and Terenziani.