The complexity of query evaluation in indefinite temporal constraint databases
type: Item
instance of: scholarly article
title: The complexity of query evaluation in indefinite temporal constraint databases
zbMATH Open document ID: 0887.68029
DOI: 10.1016/S0304-3975(96)00124-7
author: Manolis Koubarakis
published in: Theoretical Computer Science
publication date: 1997-10-19T00:00:00Z
Mathematics Subject Classification ID: 68P15
zbMATH DE Number: 1075628
zbMATH Keywords: \(\mathcal L\)-constraint databases
zbMATH Keywords: constraint database
zbMATH Keywords: query evaluation
MaRDI profile type: Publication
cites work: On the representation and querying of sets of possible worlds
cites work: Principles and practice of constraint programming. 2nd international workshop, PPCP '94, Rosario, Orcas Island, Washington, DC, USA, May 2-4, 1994. Proceedings
cites work: The complexity of logical theories
cites work: On time-space classes and their relation to the theory of real addition
cites work: Structure and complexity of relational queries
cites work: Model theory
cites work: Q4518442
cites work: Q4288820
cites work: Temporal constraint networks
cites work: Intuitionistic interpretation of deductive databases with incomplete information
cites work: Q4052071
cites work: An efficient decision procedure for the theory of rational order
cites work: A Decision Procedure for the First Order Theory of Real Addition with Order
cites work: The computational complexity of logical theories
cites work: Q4082296
cites work: The complexity of Presburger arithmetic with bounded quantifier alternation depth
cites work: The problem of incomplete information in relational databases
cites work: Incomplete Information in Relational Databases
cites work: Q4385525
cites work: Q4490722
cites work: Tractable disjunctions of linear constraints: Basic results and applications to temporal reasoning
cites work: Q4764422
cites work: Foundations of a functional approach to knowledge representation
cites work: Presburger arithmetic with bounded quantifier alternation
cites work: Q5203719
cites work: Q4694689
cites work: A closed-form evaluation for Datalog queries with integer (gap)-order constraints
cites work: Q3818127
cites work: Real addition and the polynomial hierarchy
cites work: The polynomial-time hierarchy
cites work: Querying logical databases
full work available at URL: s0304-3975(96)00124-7
OpenAlex ID: W2091084325
description: scientific article; zbMATH DE number 1075628