Matthias Horbach

Affiliations:
  • Max Planck Institute for Informatics, Saarbrücken, Germany


According to our database1, Matthias Horbach authored at least 13 papers between 2009 and 2017.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

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

On the Combination of the Bernays-Schönfinkel-Ramsey Fragment with Simple Linear Integer Arithmetic.
Proceedings of the Automated Deduction - CADE 26, 2017

2015
Decidability of Verification of Safety Properties of Spatial Families of Linear Hybrid Automata.
Proceedings of the Frontiers of Combining Systems - 10th International Symposium, 2015

2014
Locality Transfer: From Constrained Axiomatizations to Reachability Predicates.
Proceedings of the Automated Reasoning - 7th International Joint Conference, 2014

2013
Obtaining Finite Local Theory Axiomatizations via Saturation.
Proceedings of the Frontiers of Combining Systems, 2013

Geometric Quantifier Elimination Heuristics for Automatically Generating Octagonal and Max-plus Invariants.
Proceedings of the Automated Reasoning and Mathematics, 2013

2011
System Description: SPASS-FD.
Proceedings of the Automated Deduction - CADE-23 - 23rd International Conference on Automated Deduction, Wroclaw, Poland, July 31, 2011

Predicate Completion for non-Horn Clause Sets.
Proceedings of the Automated Deduction - CADE-23 - 23rd International Conference on Automated Deduction, Wroclaw, Poland, July 31, 2011

2010
Saturation-based decision procedures for fixed domain and minimal model validity.
PhD thesis, 2010

Superposition for fixed domains.
ACM Trans. Comput. Log., 2010

Disunification for Ultimately Periodic Interpretations.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

2009
Deciding the Inductive Validity of FOR ALL THERE EXISTS <sup>*</sup> Queries.
Proceedings of the Computer Science Logic, 23rd international Workshop, 2009

Decidability Results for Saturation-Based Model Building.
Proceedings of the Automated Deduction, 2009


  Loading...