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

```@inproceedings{Voigt2017TheBF,
title={The Bernays-Sch{\"o}nfinkel-Ramsey Fragment with Bounded Difference Constraints over the Reals Is Decidable},
author={Marco Voigt},
booktitle={FroCoS},
year={2017}
}```
• Marco Voigt
• Published in FroCoS 2017
• Mathematics, Computer Science
First-order linear real arithmetic enriched with uninterpreted predicate symbols yields an interesting modeling language. However, satisfiability of such formulas is undecidable, even if we restrict the uninterpreted predicate symbols to arity one. In order to find decidable fragments of this language, it is necessary to restrict the expressiveness of the arithmetic part. One possible path is to confine arithmetic expressions to difference constraints of the form \(x - y \mathrel {\triangleleft… Expand
7 Citations

#### References

SHOWING 1-10 OF 16 REFERENCES
What's Decidable About Arrays?
• Computer Science
• VMCAI
• 2006
• 278
• PDF
Decidability and Essential Undecidability
• H. Putnam
• Mathematics, Computer Science
• J. Symb. Log.
• 1957
• 44
Refutational theorem proving for hierarchic first-order theories
• Mathematics, Computer Science
• Applicable Algebra in Engineering, Communication and Computing
• 2005
• 100
A Theory of Timed Automata
• Computer Science
• Theor. Comput. Sci.
• 1994
• 6,968
• PDF