A technique for proving decidability of containment and equivalence of linear constraint queries (Q1807671): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4864249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalences among Relational Expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reversal-bounded multipushdown machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relational expressive power of constraint query languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable queries for relational data bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A relational model of data for large shared data banks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conjunctive query containment with respect to views and constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An application of games to the completeness problem for formalized theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4052071 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite-model theory -- A personal perspective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4082296 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Decision Procedure for the First Order Theory of Real Addition with Order / rank
 
Normal rank
Property / cites work
 
Property / cites work: On monadic NP vs monadic co-NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of Presburger arithmetic with bounded quantifier alternation depth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3666827 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An NP-Complete Number-Theoretic Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of decision problems for finite-turn multicounter machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Way Counter Machines and Diophantine Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finitely representable databases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Queries with arithmetical constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5551141 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reversal-Bounded Multicounter Machines and Their Decision Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Decidability Results Concerning Two-Way Counter Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4490722 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On conjunctive queries containing inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Query languages for bags and aggregate functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive unsolvability of Post's problem of ''Tag'' und other topics in theory of Turing machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: First-Order Queries on Finite Structures Over the Reals / rank
 
Normal rank
Property / cites work
 
Property / cites work: A closed-form evaluation for Datalog queries with integer (gap)-order constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Presburger arithmetic with bounded quantifier alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The comparison of the expressive power of first-order dynamic logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5807665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5797034 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of querying indefinite data about linearly ordered domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic one-counter automata / rank
 
Normal rank

Latest revision as of 10:33, 29 May 2024

scientific article
Language Label Description Also known as
English
A technique for proving decidability of containment and equivalence of linear constraint queries
scientific article

    Statements

    A technique for proving decidability of containment and equivalence of linear constraint queries (English)
    0 references
    0 references
    0 references
    23 November 1999
    0 references
    counter machines
    0 references
    queries
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers