Variable independence for first-order definable constraints

DOI10.1145/937555.937557MaRDI QIDQ5267438zbMATH OpenOpenAlexFDO

Authors Leonid Libkin

Publication date 13 June 2017

Published in ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/937555.937557

zbMATH Keywords

first-order logiclinear constraintspolynomial constraintsdefinable setsspatio-temporal databasesvariable independence

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Database theory (68P15) Decidability of theories and sets of sentences (03B25) Logic in computer science (03B70) Basic properties of first-order languages and structures (03C07) Quantifier elimination, model completeness, and related topics (03C10)

Recommendations

• scientific article; zbMATH DE number 1670829
• Independent database schemas
• Querying temporal and spatial constraint networks in PTIME
• Constrained dependencies
• scientific article; zbMATH DE number 2080302

Cited in

(6)

• Learning union of integer hypercubes with queries (with applications to monadic decomposition)
• Monadic decomposition in integer linear arithmetic
• Integer linear-exponential programming in NP by quantifier elimination
• Ramsey quantifiers over automatic structures: complexity and applications to verification
• scientific article; zbMATH DE number 1670829 (Why is no real title available?)
• Querying temporal and spatial constraint networks in PTIME

This page was built for publication: Variable independence for first-order definable constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5267438)