Marco Voigt

18 papers A* 2A 1B 1Journal 10Unranked 3

Year	Rank	Type	Title / Venue / Authors
2021	J	`jnl`	Decidable ∃ J. Autom. Reason. Marco Voigt
2019	—	`—`	Decidable fragments of first-order logic and of first-order linear arithmetic with uninterpreted predicates. Marco Voigt
2019	—	`conf`	On the Expressivity and Applicability of Model Representation Formalisms. FroCos Andreas Teucke, Marco Voigt, Christoph Weidenbach
2019	J	`jnl`	On the Expressivity and Applicability of Model Representation Formalisms. CoRR Andreas Teucke, Marco Voigt, Christoph Weidenbach
2019	J	`jnl`	Separateness of Variables - A Novel Perspective on Decidable First-Order Fragments. CoRR Marco Voigt
2017	J	`jnl`	A Fine-Grained Hierarchy of Hard Problems in the Separated Fragment. CoRR Marco Voigt
2017	A*	`conf`	A fine-grained hierarchy of hard problems in the separated fragment. LICS Marco Voigt
2017	J	`jnl`	On Generalizing Decidable Standard Prefix Classes of First-Order Logic. CoRR Marco Voigt
2017	A	`conf`	On the Combination of the Bernays-Schönfinkel-Ramsey Fragment with Simple Linear Integer Arithmetic. CADE Matthias Horbach, Marco Voigt, Christoph Weidenbach
2017	J	`jnl`	On the Combination of the Bernays-Schönfinkel-Ramsey Fragment with Simple Linear Integer Arithmetic. CoRR Matthias Horbach, Marco Voigt, Christoph Weidenbach
2017	—	`conf`	The Bernays-Schönfinkel-Ramsey Fragment with Bounded Difference Constraints over the Reals Is Decidable. FroCoS Marco Voigt
2017	J	`jnl`	The Bernays-Schönfinkel-Ramsey Fragment with Bounded Difference Constraints over the Reals is Decidable. CoRR Marco Voigt
2017	J	`jnl`	The Universal Fragment of Presburger Arithmetic with Unary Uninterpreted Predicates is Undecidable. CoRR Matthias Horbach, Marco Voigt, Christoph Weidenbach
2017	—	`conf`	Towards Elimination of Second-Order Quantifiers in the Separated Fragment. SOQE Marco Voigt
2016	A*	`conf`	Deciding First-Order Satisfiability when Universal and Existential Variables are Separated. LICS Thomas Sturm, Marco Voigt, Christoph Weidenbach
2015	J	`jnl`	Bernays-Schönfinkel-Ramsey with Simple Bounds is NEXPTIME-complete. CoRR Marco Voigt, Christoph Weidenbach
2015	J	`jnl`	Deciding First-Order Satisfiability when Universal and Existential Variables are Separated. CoRR Thomas Sturm, Marco Voigt, Christoph Weidenbach
2013	B	`conf`	Lower bounds for the runtime of a global multi-objective evolutionary algorithm. IEEE Congress on Evolutionary Computation Benjamin Doerr, Bojana Kodric, Marco Voigt