2.8k citations
- Max Planck SocietyDE261 papers
- Saarland UniversityDE124 papers
- Technische Universität BerlinDE55 papers
- Centre National de la Recherche ScientifiqueFR41 papers
- Korea UniversityKR41 papers
- Stanford UniversityUS25 papers
- Institut national de recherche en sciences et technologies du numériqueFR24 papers
- ETH ZurichCH21 papers
- Helmholtz Center for Information SecurityDE20 papers
- Technical University of MunichDE20 papers
- Université de LorraineFR17 papers
- University of LuxembourgLU16 papers
41 papers · 1 filter
Non-Ground Congruence Closure
Hendrik Leidinger, Christoph Weidenbach
Congruence closure on ground equations is a well-established and efficient algorithm for deciding ground equalities. It constructs an explicit representation of ground equivalence…
SCL(FOL) Can Simulate Non-Redundant Superposition Clause Learning
Martin Bromberger, Chaahat Jain, Christoph Weidenbach
We show that SCL(FOL) can simulate the derivation of non-redundant clauses by superposition for first-order logic without equality. Superposition-based reasoning is performed with…
Symbolic Model Construction for Saturated Constrained Horn Clauses
Martin Bromberger, Lorenz Leutgeb, Christoph Weidenbach
Clause sets saturated by hierarchic ordered resolution do not offer a model representation that can be effectively queried, in general. They only offer the guarantee of the existen…
SCL(FOL) Revisited
Martin Bromberger, Simon Schwarz, Christoph Weidenbach
This paper presents an up-to-date and refined version of the SCL calculus for first-order logic without equality. The refinement mainly consists of the following two parts: First,…
SAT-Inspired Higher-Order Eliminations
Jasmin Blanchette, Petar Vukmirović
We generalize several propositional preprocessing techniques to higher-order logic, building on existing first-order generalizations. These techniques eliminate literals, clauses,…
Automated Expected Amortised Cost Analysis of Probabilistic Data Structures
Lorenz Leutgeb, Georg Moser, Florian Zuleger
In this paper, we present the first fully-automated expected amortised cost analysis of self-adjusting data structures, that is, of randomised splay trees, randomised splay heaps a…