The complexity of query evaluation in indefinite temporal constraint databases
- 15 January 1997
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 171 (1-2) , 25-60
- https://doi.org/10.1016/s0304-3975(96)00124-7
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Temporal constraint networksArtificial Intelligence, 1991
- On the representation and querying of sets of possible worldsTheoretical Computer Science, 1991
- The Problem of Incomplete Information in Relational DatabasesPublished by Springer Nature ,1991
- Structure and complexity of relational queriesJournal of Computer and System Sciences, 1982
- The complexity of presburger arithmetic with bounded quantifier alternation depthTheoretical Computer Science, 1982
- The complexity of logical theoriesTheoretical Computer Science, 1980
- On time-space classes and their relation to the theory of real additionTheoretical Computer Science, 1980
- The Computational Complexity of Logical TheoriesLecture Notes in Mathematics, 1979
- An efficient decision procedure for the theory of rational orderTheoretical Computer Science, 1977
- A Decision Procedure for the First Order Theory of Real Addition with OrderSIAM Journal on Computing, 1975