Benjamin Kiesl
Benjamin Kiesl
SAP SE
Bestätigte E-Mail-Adresse bei sap.com - Startseite
Titel
Zitiert von
Zitiert von
Jahr
Short proofs without new variables
MJH Heule, B Kiesl, A Biere
International Conference on Automated Deduction, 130-147, 2017
242017
Extended resolution simulates DRAT
B Kiesl, A Rebola-Pardo, MJH Heule
International Joint Conference on Automated Reasoning, 516-531, 2018
202018
PRuning through satisfaction
MJH Heule, B Kiesl, M Seidl, A Biere
Haifa Verification Conference, 179-194, 2017
172017
Super-blocked clauses
B Kiesl, M Seidl, H Tompits, A Biere
International Joint Conference on Automated Reasoning, 45-61, 2016
162016
Blocked clauses in first-order logic
B Kiesl, M Suda, M Seidl, H Tompits, A Biere
arXiv preprint arXiv:1702.00847, 2017
102017
Encoding redundancy for satisfaction-driven clause learning
MJH Heule, B Kiesl, A Biere
International Conference on Tools and Algorithms for the Construction and …, 2019
92019
Strong extension-free proof systems
MJH Heule, B Kiesl, A Biere
Journal of Automated Reasoning 64 (3), 533-554, 2020
82020
A unifying principle for clause elimination in first-order logic
B Kiesl, M Suda
International Conference on Automated Deduction, 274-290, 2017
82017
A little blocked literal goes a long way
B Kiesl, MJH Heule, M Seidl
International Conference on Theory and Applications of Satisfiability …, 2017
72017
Blockedness in propositional logic: are you satisfied with your neighborhood?
B Kiesl, M Seidl, H Tompits, A Biere
IJCAI, 4884-4888, 2017
52017
Truth Assignments as Conditional Autarkies
B Kiesl, MJH Heule, A Biere
International Symposium on Automated Technology for Verification and …, 2019
32019
Clausal proofs of mutilated chessboards
MJH Heule, B Kiesl, A Biere
NASA Formal Methods Symposium, 204-210, 2019
32019
The Potential of Interference-Based Proof Systems.
M Heule, B Kiesl
ARCADE@ CADE, 51-54, 2017
32017
A Formal Analysis of {IEEE} 802.11's WPA2: Countering the Kracks Caused by Cracking the Counters
C Cremers, B Kiesl, N Medinger
29th {USENIX} Security Symposium ({USENIX} Security 20), 1-17, 2020
22020
Local Redundancy in SAT: Generalizations of Blocked Clauses
B Kiesl, M Seidl, H Tompits, A Biere
arXiv preprint arXiv:1702.05527, 2017
22017
QRAT Polynomially Simulates
B Kiesl, M Seidl
International Conference on Theory and Applications of Satisfiability …, 2019
12019
Structural reasoning methods for satisfiability solving and beyond
B Kiesl
Wien, 2019
12019
Clone Detection in Secure Messaging: Improving Post-Compromise Security in Practice
C Cremers, J Fairoze, B Kiesl, A Naska
Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications …, 2020
2020
Simulating Strong Practical Proof Systems with Extended Resolution
B Kiesl, A Rebola-Pardo, MJH Heule, A Biere
Journal of Automated Reasoning 64 (7), 1247-1267, 2020
2020
QRAT Polynomially Simulates\forall-Exp+ Res
B Kiesl, M Seidl
2019
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20