The complexity of querying indefinite data about linearly ordered domains (Q676427): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1006/jcss.1997.1455 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2031639195 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the representation and querying of sets of possible worlds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maintaining knowledge about temporal intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonconstructive advances in polynomial-time complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonconstructive tools for proving polynomial-time decidability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity and algorithms for reasoning about time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A propositional modal logic of time intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: On conjunctive queries containing inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: The theory of well-quasi-ordering: a frequently discovered concept / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Overview of Sequence Comparison: Time Warps, String Edits, and Macromolecules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4013779 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursively indefinite databases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3691785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4166250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Querying logical databases / rank
 
Normal rank

Latest revision as of 11:52, 27 May 2024

scientific article
Language Label Description Also known as
English
The complexity of querying indefinite data about linearly ordered domains
scientific article

    Statements

    The complexity of querying indefinite data about linearly ordered domains (English)
    0 references
    0 references
    18 March 1997
    0 references
    0 references
    partial order
    0 references
    query answering
    0 references
    PTIME subproblems
    0 references
    0 references