default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatthias Horbach
Person information
- affiliation: Max Planck Institute for Informatics, Saarbrücken, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[c11]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- [i4]Matthias Horbach, Marco Voigt, Christoph Weidenbach:
The Universal Fragment of Presburger Arithmetic with Unary Uninterpreted Predicates is Undecidable. CoRR abs/1703.01212 (2017) - [i3]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) - 2016
- [i2]Werner Damm, Matthias Horbach, Viorica Sofronie-Stokkermans:
Decidability of Verification of Safety Properties of Spatial Families of Linear Hybrid Automata. CoRR abs/1601.01648 (2016) - 2015
- [c10]Werner Damm, Matthias Horbach, Viorica Sofronie-Stokkermans:
Decidability of Verification of Safety Properties of Spatial Families of Linear Hybrid Automata. FroCos 2015: 186-202 - 2014
- [c9]Matthias Horbach, Viorica Sofronie-Stokkermans:
Locality Transfer: From Constrained Axiomatizations to Reachability Predicates. IJCAR 2014: 192-207 - 2013
- [c8]Deepak Kapur, Zhihai Zhang, Matthias Horbach, Hengjun Zhao, Qi Lu, ThanhVu Nguyen:
Geometric Quantifier Elimination Heuristics for Automatically Generating Octagonal and Max-plus Invariants. Automated Reasoning and Mathematics 2013: 189-228 - [c7]Matthias Horbach, Viorica Sofronie-Stokkermans:
Obtaining Finite Local Theory Axiomatizations via Saturation. FroCos 2013: 198-213 - [e1]Matthias Horbach:
43. Jahrestagung der Gesellschaft für Informatik, Informatik angepasst an Mensch, Organisation und Umwelt, INFORMATIK 2013, Koblenz, Germany, September 16-20, 2013. LNI P-220, GI 2013, ISBN 978-3-88579-614-5 [contents] - 2011
- [c6]Matthias Horbach:
Predicate Completion for non-Horn Clause Sets. CADE 2011: 315-330 - [c5]Matthias Horbach:
System Description: SPASS-FD. CADE 2011: 331-337 - 2010
- [b1]Matthias Horbach:
Saturation-based decision procedures for fixed domain and minimal model validity. Saarland University, 2010 - [j1]Matthias Horbach, Christoph Weidenbach:
Superposition for fixed domains. ACM Trans. Comput. Log. 11(4): 27:1-27:35 (2010) - [c4]Matthias Horbach:
Disunification for Ultimately Periodic Interpretations. LPAR (Dakar) 2010: 290-311
2000 – 2009
- 2009
- [c3]Matthias Horbach, Christoph Weidenbach:
Decidability Results for Saturation-Based Model Building. CADE 2009: 404-420 - [c2]Matthias Horbach, Christoph Weidenbach:
Deciding the Inductive Validity of FOR ALL THERE EXISTS * Queries. CSL 2009: 332-347 - 2008
- [c1]Matthias Horbach, Christoph Weidenbach:
Superposition for Fixed Domains. CSL 2008: 293-307 - [i1]Matthias Horbach, Christoph Weidenbach:
Superposition for Fixed Domains. CoRR abs/0809.0922 (2008)
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-25 05:47 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:
