Skip to Main content Skip to Navigation

tel-02406821v1  Theses
Marco Voigt. Decidable Fragments of First-Order Logic and of First-Order Linear Arithmetic with Uninterpreted Predicates
Logic in Computer Science [cs.LO]. Universität des Saarlandes, 2019. English
hal-01592169v1  Conference papers
Marco Voigt. The Bernays–Schönfinkel–Ramsey Fragment with Bounded Difference Constraints over the Reals Is Decidable
FroCoS 2017 - 11th International Symposium on Frontiers of Combining Systems, Sep 2017, Brasilia, Brazil. pp.244-261, ⟨10.1007/978-3-319-66167-4_14⟩
hal-02406605v1  Conference papers
Andreas TeuckeMarco VoigtChristoph Weidenbach. On the Expressivity and Applicability of Model Representation Formalisms
FroCoS 2019 - 12th International Symposium on Frontiers of Combining Systems, 2019, London, United Kingdom. pp.22-39, ⟨10.1007/978-3-030-29007-8_2⟩
hal-01592160v1  Conference papers
Matthias HorbachMarco VoigtChristoph Weidenbach. On the Combination of the Bernays–Schönfinkel–Ramsey Fragment with Simple Linear Integer Arithmetic
CADE 26 - 26th International Conference on Automated Deduction, Aug 2017, Gothenburg, Sweden. pp.77-94, ⟨10.1007/978-3-319-63046-5_6⟩
hal-01592172v1  Conference papers
Marco Voigt. A fine-grained hierarchy of hard problems in the separated fragment
LICS 2017 - 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, Jun 2017, Reykjavik, Iceland. pp.1 - 12, ⟨10.1109/LICS.2017.8005094⟩