Marco Voigt

According to our database, Marco Voigt authored at least 13 papers between 2013 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2021

Decidable ∃ ^*∀ ^* First-Order Fragments of Linear Rational Arithmetic with Uninterpreted Predicates.

Marco Voigt

J. Autom. Reason., 2021

2019

Decidable fragments of first-order logic and of first-order linear arithmetic with uninterpreted predicates.

Marco Voigt

PhD thesis, 2019

Separateness of Variables - A Novel Perspective on Decidable First-Order Fragments.

Marco Voigt

CoRR, 2019

On the Expressivity and Applicability of Model Representation Formalisms.

Andreas Teucke, Marco Voigt, Christoph Weidenbach

Proceedings of the Frontiers of Combining Systems - 12th International Symposium, 2019

2017

On Generalizing Decidable Standard Prefix Classes of First-Order Logic.

Marco Voigt

CoRR, 2017

The Universal Fragment of Presburger Arithmetic with Unary Uninterpreted Predicates is Undecidable.

Matthias Horbach, Marco Voigt, Christoph Weidenbach

CoRR, 2017

Towards Elimination of Second-Order Quantifiers in the Separated Fragment.

Marco Voigt

Proceedings of the Workshop on Second-Order Quantifier Elimination and Related Topics (SOQE 2017), 2017

A fine-grained hierarchy of hard problems in the separated fragment.

Marco Voigt

Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

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

Marco Voigt

Proceedings of the Frontiers of Combining Systems - 11th International Symposium, 2017

On the Combination of the Bernays-Schönfinkel-Ramsey Fragment with Simple Linear Integer Arithmetic.

Matthias Horbach, Marco Voigt, Christoph Weidenbach

Proceedings of the Automated Deduction - CADE 26, 2017

2016

Deciding First-Order Satisfiability when Universal and Existential Variables are Separated.

Thomas Sturm, Marco Voigt, Christoph Weidenbach

Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

2015

Bernays-Schönfinkel-Ramsey with Simple Bounds is NEXPTIME-complete.

Marco Voigt, Christoph Weidenbach

CoRR, 2015

2013

Lower bounds for the runtime of a global multi-objective evolutionary algorithm.

Benjamin Doerr, Bojana Kodric, Marco Voigt

Proceedings of the IEEE Congress on Evolutionary Computation, 2013