The Complexity of Querying Indefinite Data about Linearly Ordered Domains
- 1 February 1997
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 54 (1), 113-135
- https://doi.org/10.1006/jcss.1997.1455
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Constraint Query LanguagesJournal of Computer and System Sciences, 1995
- Complexity and algorithms for reasoning about timeJournal of the ACM, 1993
- A propositional modal logic of time intervalsJournal of the ACM, 1991
- On the representation and querying of sets of possible worldsTheoretical Computer Science, 1991
- Exact and approximate reasoning about temporal relations1Computational Intelligence, 1990
- Nonconstructive tools for proving polynomial-time decidabilityJournal of the ACM, 1988
- Nonconstructive advances in polynomial-time complexityInformation Processing Letters, 1987
- Maintaining knowledge about temporal intervalsCommunications of the ACM, 1983
- AlternationJournal of the ACM, 1981
- Optimal implementation of conjunctive queries in relational data basesPublished by Association for Computing Machinery (ACM) ,1977