The Bernays-Schönfinkel-Ramsey Fragment with Bounded Difference Constraints over the Reals Is Decidable.

Published in: FroCoS (2017)

Keyphrases

automata theoretic
constraint databases
transitive closure
datalog queries
datalog programs
linear constraints
global constraints
constraint satisfaction
constrained optimization
databases
temporal logic
first order logic
function symbols
regular path queries
constraint language
upper bound
data model