default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarco Voigt
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j1]Marco Voigt
:
Decidable ∃ *∀ * First-Order Fragments of Linear Rational Arithmetic with Uninterpreted Predicates. J. Autom. Reason. 65(3): 357-423 (2021)
2010 – 2019
- 2019
- [b1]Marco Voigt:
Decidable fragments of first-order logic and of first-order linear arithmetic with uninterpreted predicates. Saarland University, Saarbrücken, Germany, 2019 - [c7]Andreas Teucke, Marco Voigt, Christoph Weidenbach:
On the Expressivity and Applicability of Model Representation Formalisms. FroCos 2019: 22-39 - [i9]Andreas Teucke, Marco Voigt, Christoph Weidenbach:
On the Expressivity and Applicability of Model Representation Formalisms. CoRR abs/1905.03651 (2019) - [i8]Marco Voigt:
Separateness of Variables - A Novel Perspective on Decidable First-Order Fragments. CoRR abs/1911.11500 (2019) - 2017
- [c6]Matthias Horbach, Marco Voigt, Christoph Weidenbach:
On the Combination of the Bernays-Schönfinkel-Ramsey Fragment with Simple Linear Integer Arithmetic. CADE 2017: 77-94 - [c5]Marco Voigt:
The Bernays-Schönfinkel-Ramsey Fragment with Bounded Difference Constraints over the Reals Is Decidable. FroCoS 2017: 244-261 - [c4]Marco Voigt:
A fine-grained hierarchy of hard problems in the separated fragment. LICS 2017: 1-12 - [c3]Marco Voigt:
Towards Elimination of Second-Order Quantifiers in the Separated Fragment. SOQE 2017: 67-81 - [i7]Matthias Horbach, Marco Voigt, Christoph Weidenbach:
The Universal Fragment of Presburger Arithmetic with Unary Uninterpreted Predicates is Undecidable. CoRR abs/1703.01212 (2017) - [i6]Marco Voigt:
A Fine-Grained Hierarchy of Hard Problems in the Separated Fragment. CoRR abs/1704.02145 (2017) - [i5]Matthias Horbach, Marco Voigt, Christoph Weidenbach:
On the Combination of the Bernays-Schönfinkel-Ramsey Fragment with Simple Linear Integer Arithmetic. CoRR abs/1705.08792 (2017) - [i4]Marco Voigt:
On Generalizing Decidable Standard Prefix Classes of First-Order Logic. CoRR abs/1706.03949 (2017) - [i3]Marco Voigt:
The Bernays-Schönfinkel-Ramsey Fragment with Bounded Difference Constraints over the Reals is Decidable. CoRR abs/1706.08504 (2017) - 2016
- [c2]Thomas Sturm, Marco Voigt, Christoph Weidenbach:
Deciding First-Order Satisfiability when Universal and Existential Variables are Separated. LICS 2016: 86-95 - 2015
- [i2]Marco Voigt, Christoph Weidenbach:
Bernays-Schönfinkel-Ramsey with Simple Bounds is NEXPTIME-complete. CoRR abs/1501.07209 (2015) - [i1]Thomas Sturm, Marco Voigt, Christoph Weidenbach:
Deciding First-Order Satisfiability when Universal and Existential Variables are Separated. CoRR abs/1511.08999 (2015) - 2013
- [c1]Benjamin Doerr, Bojana Kodric, Marco Voigt:
Lower bounds for the runtime of a global multi-objective evolutionary algorithm. IEEE Congress on Evolutionary Computation 2013: 432-439
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
