Variable independence for first-order definable constraints

DOI10.1145/937555.937557zbMath1365.03024OpenAlexW2027450089MaRDI QIDQ5267438

Leonid O. 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) Logic in computer science (03B70) Decidability of theories and sets of sentences (03B25) Basic properties of first-order languages and structures (03C07) Quantifier elimination, model completeness, and related topics (03C10)

Related Items (2)

Learning union of integer hypercubes with queries (with applications to monadic decomposition) ⋮ Monadic decomposition in integer linear arithmetic

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