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
Decidable ∃ *∀ * First-Order Fragments of Linear Rational Arithmetic with Uninterpreted Predicates
Separation Logic with Linearly Compositional Inductive Predicates and Set Data Constraints
  • 2
  • PDF
SCL with Theory Constraints
  • 2
  • PDF
SOFSEM 2019: Theory and Practice of Computer Science
  • 1
  • PDF

References

SHOWING 1-10 OF 16 REFERENCES
The Universal Fragment of Presburger Arithmetic with Unary Uninterpreted Predicates is Undecidable
  • 9
  • PDF
What's Decidable About Arrays?
  • 278
  • PDF
Two Easy Theories Whose Combination is Hard
  • 105
  • PDF
Bernays-Schönfinkel-Ramsey with Simple Bounds is NEXPTIME-complete
  • 5
  • PDF
Decidability and Essential Undecidability
  • H. Putnam
  • Mathematics, Computer Science
  • J. Symb. Log.
  • 1957
  • 44
Hierarchic Superposition with Weak Abstraction
  • 57
  • PDF
Complete Instantiation for Quantified Formulas in Satisfiabiliby Modulo Theories
  • 211
  • PDF
Refutational theorem proving for hierarchic first-order theories
  • 100
A Theory of Timed Automata
  • 6,968
  • PDF
...
1
2
...