The complexity of querying indefinite data about linearly ordered domains
type: Item
instance of: scholarly article
title: The complexity of querying indefinite data about linearly ordered domains
zbMATH Open document ID: 0876.68035
author: Ron van der Meyden
published in: Journal of Computer and System Sciences
publication date: 1997-03-18T00:00:00Z
Mathematics Subject Classification ID: 68P15
zbMATH DE Number: 992432
zbMATH Keywords: partial order
zbMATH Keywords: query answering
zbMATH Keywords: PTIME subproblems
MaRDI profile type: Publication
full work available at URL: jcss.1997.1455
OpenAlex ID: W2031639195
cites work: On the representation and querying of sets of possible worlds
cites work: Maintaining knowledge about temporal intervals
cites work: Alternation
cites work: Model theory
cites work: Q4079613
cites work: Nonconstructive advances in polynomial-time complexity
cites work: Nonconstructive tools for proving polynomial-time decidability
cites work: Q4198056
cites work: Complexity and algorithms for reasoning about time
cites work: Q3328583
cites work: A propositional modal logic of time intervals
cites work: On conjunctive queries containing inequalities
cites work: The theory of well-quasi-ordering: a frequently discovered concept
cites work: An Overview of Sequence Comparison: Time Warps, String Edits, and Macromolecules
cites work: Q4013779
cites work: Recursively indefinite databases
cites work: Q3691785
cites work: Q4166250
cites work: Querying logical databases
DOI: 10.1006/JCSS.1997.1455
description: scientific article; zbMATH DE number 992432