default search action
Benjamin Kiesl-Reiter
Person information
- affiliation: Amazon Web Services, Seattle, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c21]Kevin Lotz
, Amit Goel, Bruno Dutertre
Solving String Constraints Using SAT. CAV (2) 2023: 187-208 - [c20]Benjamin Kiesl-Reiter, Michael W. Whalen:
Proofs for Incremental SAT with Inprocessing. FMCAD 2023: 132-140 - [c19]Joseph E. Reeves
Propositional Proof Skeletons. TACAS (1) 2023: 329-347 - [c18]Dawn Michaelson
Unsatisfiability Proofs for Distributed Clause-Sharing SAT Solvers. TACAS (1) 2023: 348-366 - 2022
- [c17]Armin Biere, Md. Solimul Chowdhury, Marijn J. H. Heule
Migrating Solver State. SAT 2022: 27:1-27:24 - 2021
- [p1]Armin Biere, Matti Järvisalo, Benjamin Kiesl:
Preprocessing in SAT Solving. Handbook of Satisfiability 2021: 391-435 - 2020
- [j3]Marijn J. H. Heule, Benjamin Kiesl, Armin Biere
Strong Extension-Free Proof Systems. J. Autom. Reason. 64(3): 533-554 (2020) - [j2]Benjamin Kiesl
Simulating Strong Practical Proof Systems with Extended Resolution. J. Autom. Reason. 64(7): 1247-1267 (2020) - [c16]Cas Cremers, Jaiden Fairoze, Benjamin Kiesl, Aurora Naska:
Clone Detection in Secure Messaging: Improving Post-Compromise Security in Practice. CCS 2020: 1481-1495 - [c15]Cas Cremers, Benjamin Kiesl, Niklas Medinger:
A Formal Analysis of IEEE 802.11's WPA2: Countering the Kracks Caused by Cracking the Counters. USENIX Security Symposium 2020: 1-17
2010 – 2019
- 2019
- [c14]Benjamin Kiesl, Marijn J. H. Heule, Armin Biere
Truth Assignments as Conditional Autarkies. ATVA 2019: 48-64 - [c13]Marijn J. H. Heule
Clausal Proofs of Mutilated Chessboards. NFM 2019: 204-210 - [c12]Benjamin Kiesl, Martina Seidl:
QRAT Polynomially Simulates ∀ \text -Exp+Res. SAT 2019: 193-202 - [c11]Marijn J. H. Heule
Encoding Redundancy for Satisfaction-Driven Clause Learning. TACAS (1) 2019: 41-58 - 2018
- [j1]Benjamin Kiesl, Martina Seidl, Hans Tompits, Armin Biere
Local Redundancy in SAT: Generalizations of Blocked Clauses. Log. Methods Comput. Sci. 14(4) (2018) - [c10]Benjamin Kiesl, Adrián Rebola-Pardo, Marijn J. H. Heule
Extended Resolution Simulates DRAT. IJCAR 2018: 516-531 - 2017
- [c9]Marijn Heule
The Potential of Interference-Based Proof Systems. ARCADE@CADE 2017: 51-54 - [c8]Marijn J. H. Heule
Short Proofs Without New Variables. CADE 2017: 130-147 - [c7]Benjamin Kiesl, Martin Suda
A Unifying Principle for Clause Elimination in First-Order Logic. CADE 2017: 274-290 - [c6]Marijn J. H. Heule
PRuning Through Satisfaction. Haifa Verification Conference 2017: 179-194 - [c5]Benjamin Kiesl, Martina Seidl, Hans Tompits, Armin Biere:
Blockedness in Propositional Logic: Are You Satisfied With Your Neighborhood? IJCAI 2017: 4884-4888 - [c4]Benjamin Kiesl, Martin Suda, Martina Seidl, Hans Tompits, Armin Biere:
Blocked Clauses in First-Order Logic. LPAR 2017: 31-48 - [c3]Benjamin Kiesl, Marijn J. H. Heule, Martina Seidl:
A Little Blocked Literal Goes a Long Way. SAT 2017: 281-297 - [i2]Benjamin Kiesl, Martin Suda, Martina Seidl, Hans Tompits, Armin Biere:
Blocked Clauses in First-Order Logic. CoRR abs/1702.00847 (2017) - [i1]Benjamin Kiesl, Martina Seidl, Hans Tompits, Armin Biere:
Local Redundancy in SAT: Generalizations of Blocked Clauses. CoRR abs/1702.05527 (2017) - 2016
- [c2]Benjamin Kiesl, Martina Seidl, Hans Tompits, Armin Biere
Super-Blocked Clauses. IJCAR 2016: 45-61 - 2015
- [c1]Benjamin Kiesl, Peter Schüller, Hans Tompits:
On Structural Analysis of Non-Ground Answer-Set Programs. ICLP (Technical Communications) 2015
Coauthor Index
aka: Marijn J. H. Heule
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-14 22:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: