Alexander Bentkamp

Orcid: 0000-0002-7158-3595

Affiliations:
  • Heinrich Heine University of Düsseldorf, Mathematical Institute, Germany
  • Vrije Universiteit Amsterdam, The Netherlands (former, PhD 2021)


According to our database1, Alexander Bentkamp authored at least 20 papers between 2015 and 2023.

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

2023
Complete and Efficient Higher-Order Reasoning via Lambda-Superposition.
ACM SIGLOG News, October, 2023

An Impossible Asylum.
Am. Math. Mon., May, 2023

Superposition for Higher-Order Logic.
J. Autom. Reason., March, 2023

Mechanical Mathematicians.
Commun. ACM, 2023

Verified reductions for optimization.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2023

HHLPy: Practical Verification of Hybrid Systems Using Hoare Logic.
Proceedings of the Formal Methods - 25th International Symposium, 2023

2022
Privacy accounting εconomics: Improving differential privacy composition via a posteriori bounds.
Proc. Priv. Enhancing Technol., 2022

Making Higher-Order Superposition Work.
J. Autom. Reason., 2022

2021
Efficient Full Higher-Order Unification.
Log. Methods Comput. Sci., 2021

Superposition for Lambda-Free Higher-Order Logic.
Log. Methods Comput. Sci., 2021

Superposition with Lambdas.
J. Autom. Reason., 2021

The Embedding Path Order for Lambda-Free Higher-Order Terms.
FLAP, 2021

Verified Optimization.
CoRR, 2021

Verified Optimization (work in progress).
Proceedings of the Joint Proceedings of the FMM, FVPS, MathUI,NatFoM, and OpenMath Workshops, Doctoral Program, and Work in Progress at the Conference on Intelligent Computer Mathematics 2021 co-located with the 14th Conference on Intelligent Computer Mathematics (CICM 2021), Virtual Event, Timisoara, Romania, July 26, 2021

Superposition with First-class Booleans and Inprocessing Clausification.
Proceedings of the Automated Deduction - CADE 28, 2021

Superposition for Full Higher-order Logic.
Proceedings of the Automated Deduction - CADE 28, 2021

2019
A Formal Proof of the Expressiveness of Deep Learning.
J. Autom. Reason., 2019

2018
Formalization of the Embedding Path Order for Lambda-Free Higher-Order Terms.
Arch. Formal Proofs, 2018

2016
Expressiveness of Deep Learning.
Arch. Formal Proofs, 2016

2015
Latin Square.
Arch. Formal Proofs, 2015


  Loading...