Follow
Lorenz Leutgeb
Lorenz Leutgeb
Doctoral Researcher, Max Planck Institute for Informatics
Verified email at mpi-inf.mpg.de - Homepage
Title
Cited by
Cited by
Year
Techniques for efficient lazy-grounding ASP solving
L Leutgeb, A Weinzierl
Declarative Programming and Knowledge Management: Conference on Declarative …, 2018
182018
Type-based analysis of logarithmic amortised complexity
M Hofmann, L Leutgeb, D Obwaller, G Moser, F Zuleger
Mathematical Structures in Computer Science 32 (6), 794-826, 2022
122022
ATLAS: automated amortised complexity analysis of self-adjusting data structures
L Leutgeb, G Moser, F Zuleger
Computer Aided Verification: 33rd International Conference, CAV 2021 …, 2021
62021
An Efficient Subsumption Test Pipeline for BS (LRA) Clauses
M Bromberger, L Leutgeb, C Weidenbach
Automated Reasoning: 11th International Joint Conference, IJCAR 2022, Haifa …, 2022
42022
A Two-Watched Literal Scheme for First-Order Logic
M Bromberger, T Gehl, L Leutgeb, C Weidenbach
Practical Aspects of Automated Reasoning 2022, 2022
32022
The Alpha Solver for Lazy-Grounding Answer-Set Programming
A Weinzierl, B Bogaerts, J Bomanson, T Eiter, G Friedrich, T Janhunen, ...
22019
Symbolic Model Construction for Saturated Constrained Horn Clauses
M Bromberger, L Leutgeb, C Weidenbach
International Symposium on Frontiers of Combining Systems, 137-155, 2023
12023
Three Watched Literals: Efficient Propagation for Lazy-Grounding Answer Set Programming Systems
L Leutgeb
TU Wien, 2017
2017
The system can't perform the operation now. Try again later.
Articles 1–8