A technique for proving decidability of containment and equivalence of linear constraint queries
From MaRDI portal
(Redirected from Publication:1807671)
Recommendations
Cites work
- scientific article; zbMATH DE number 3819693 (Why is no real title available?)
- scientific article; zbMATH DE number 3467028 (Why is no real title available?)
- scientific article; zbMATH DE number 3501006 (Why is no real title available?)
- scientific article; zbMATH DE number 1479611 (Why is no real title available?)
- scientific article; zbMATH DE number 839556 (Why is no real title available?)
- scientific article; zbMATH DE number 3266604 (Why is no real title available?)
- scientific article; zbMATH DE number 3057871 (Why is no real title available?)
- scientific article; zbMATH DE number 3068536 (Why is no real title available?)
- A Decision Procedure for the First Order Theory of Real Addition with Order
- A closed-form evaluation for Datalog queries with integer (gap)-order constraints
- A relational model of data for large shared data banks
- An NP-Complete Number-Theoretic Problem
- An application of games to the completeness problem for formalized theories
- Computable queries for relational data bases
- Conjunctive query containment with respect to views and constraints
- Deterministic one-counter automata
- Equivalences among Relational Expressions
- Finite-model theory -- A personal perspective
- Finitely representable databases
- First-Order Queries on Finite Structures Over the Reals
- Model theory
- New Decidability Results Concerning Two-Way Counter Machines
- On conjunctive queries containing inequalities
- On monadic NP vs monadic co-NP
- Presburger arithmetic with bounded quantifier alternation
- Queries with arithmetical constraints
- Query languages for bags and aggregate functions
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- Relational expressive power of constraint query languages
- Reversal-Bounded Multicounter Machines and Their Decision Problems
- Reversal-bounded multipushdown machines
- The comparison of the expressive power of first-order dynamic logics
- The complexity of Presburger arithmetic with bounded quantifier alternation depth
- The complexity of decision problems for finite-turn multicounter machines
- The complexity of querying indefinite data about linearly ordered domains
- Two-Way Counter Machines and Diophantine Equations
Cited in
(7)- VERIFICATION IN QUEUE-CONNECTED MULTICOUNTER MACHINES
- On strong reversibility in P systems and related problems
- On reachability and safety in infinite-state systems
- scientific article; zbMATH DE number 1953141 (Why is no real title available?)
- scientific article; zbMATH DE number 1836416 (Why is no real title available?)
- CHARACTERIZATIONS OF BOUNDED SEMILINEAR LANGUAGES BY ONE-WAY AND TWO-WAY DETERMINISTIC MACHINES
- Verification in loosely synchronous queue-connected discrete timed automata.
This page was built for publication: A technique for proving decidability of containment and equivalence of linear constraint queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1807671)
