Dr. rer. nat. Ashlin Iser
- Post-Doctoral Researcher
- Automated Reasoning and Optimization, Empirical Algorithmics, Explainable Artificial Intelligence, Algorithm Visualization and Sonification
- Raum: 219
- Tel.: +49 721 608-44209
- Fax: +49 721 608-43088
- ashlin iser ∂does-not-exist.kit edu
- GitHub
Projects and Teaching
Open and Running Theses
- Fast Parallel Unit Propagation (Master Thesis)
- Localized Clause Scores for Parallel SAT Solvers (Bachelor Thesis)
Heuristic scoring of clauses plays an important role in clause-learning SAT solvers. In sequential SAT solvers, such scoring heuristics decide in periodic cleanup steps which of the learned clauses are forgotten. In parallel SAT solver portfolios, such heuristics are used when exchanging clauses between solvers to decide which clauses to reject. The use of these heuristics in parallel SAT solvers is not necessarily meaningful due to their state dependency, i.e., at the time of exchange, a clause may be important in one solver but useless in another solver. The goal of this thesis is to explore different state-dependent ways to locally re-evaluate and discard clauses when necessary. - Data-Driven Automatic and Optimal Evaluation of SAT Solvers (Bachelor / Master Thesis)
The project was successfully completed by Tobias Fuchs (see original project description) and resulted in a publication; further projects based on this are possible and can be discussed and defined upon request. - Explaining Tree Ensembles with SAT-based Automated Reasoning (Master Thesis)
Efficient automated reasoning tools are key to some of the most promising rigorous approaches to explainability of machine learning (ML) models, and thus a central component of the young but rapidly growing field of Explainable Artificial Intelligence (XAI). SAT-based automated reasoning for XAI can help debug AI systems, prevent accidents, and ensure that AI systems are not used in a discriminatory manner [1]. Most existing approaches aim to explain the cause of a single prediction, and few deal with enumerating them. However, due to the exponential number of explanations in the worst case, enumeration is often infeasible. The goal of this work is to formalize some objective functions of the problem taxonomy specified in [1] as a MaxSAT objective function, and to enumerate optimal explanations with respect to this function.
[1] https://arxiv.org/pdf/2407.17454
Courses
| Title | Type | Semester |
|---|---|---|
| Practical SAT Solving | Lecture and Exercises | SS 2026 |
| Advanced Topics in SAT Solving | Seminar | WS 2025/26 |
| Practical SAT Solving | Lecture and Exercises | SS 2025 |
| Advanced Topics in SAT Solving | Seminar | WS 2024/25 |
| Practical SAT Solving | Lecture and Exercises | SS 2024 |
| Advanced Topics in SAT Solving | Seminar | WS 2023/24 |
| Practical SAT Solving | Lecture and Exercises | SS 2023 |
| Advanced Topics in SAT Solving | Seminar | WS 2022/23 |
| Practical SAT Solving | Lecture and Exercises | SS 2022 |
| Automating SAT Solver Research | Praxis der Forschung | SS 2022 |
| Animating Propositional Proofs | Praxis der Softwareentwicklung | WS 2021/22 |
| Automating SAT Solver Research | Praxis der Forschung | WS 2021/22 |
Publications
| Title | Authors | Publication | Year |
|---|---|---|---|
| Proceedings of SAT Competition 2024: Solver, Benchmark and Proof Checker Descriptions | Editors: Marijn Heule, Ashlin Iser, Matti Järvisalo, Martin Suda | University of Helsinki, Department of Computer Science | 2024 |
| Automated Explanation Selection for Scientific Discovery | Ashlin Iser | Workshop on Composite AI (CompAI), Co-located with ECAI 2024 | 2024 |
| Global Benchmark Database | Ashlin Iser, Christoph Jabs | International Conference on Theory and Applications of Satisfiability Testing (SAT 2024) | 2024 |
| Oracle-Based Local Search for Pseudo-Boolean Optimization | Ashlin Iser, Jeremias Berg, Matti Järvisalo | Proceedings of the 26th European Conference on Artificial Intelligence (ECAI 2023) | 2023 |
| Proceedings of SAT Competition 2023: Solver, Benchmark and Proof Checker Descriptions | Editors: Tomáš Balyo, Marijn Heule, Ashlin Iser, Matti Järvisalo, Martin Suda | University of Helsinki, Department of Computer Science | 2023 |
| Active Learning for SAT Solver Benchmarking | Tobias Fuchs, Jakob Bach, Ashlin Iser | International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2023) | 2023 |
| A Comprehensive Study of k-Portfolios of Recent SAT Solvers | Jakob Bach, Ashlin Iser, Klemens Böhm | International Conference on Theory and Applications of Satisfiability Testing (SAT 2022) | 2022 |
| Dinosat: A SAT Solver with Native DNF Support | Thomas Bartel, Tomáš Balyo, Ashlin Iser | Pragmatics of SAT (POS 2022) | 2022 |
| SATViz: Real-Time Visualization of Clausal Proofs | Tim Holzenkamp, Kevin Kuryshev, Thomas Oltmann, Lucas Wäldele, Johann Zuber, Tobias Heuer, and Ashlin Iser |
Pragmatics of SAT (POS 2022) | 2022 |
| Unit Propagation with Stable Watches (+Video) | Ashlin Iser, Tomáš Balyo | 27th International Conference on Principles and Practice of Constraint Programming (CP 2021) | 2021 |
| Fast Approximate Calculation of Valid Domains in a Satisfiability-based Product Configurator | Johannes Werner, Tomáš Balyo, Ashlin Iser, Michael Klein | 23rd Configuration Workshop (ConfWS 2021) | 2021 |
| SAT Competition 2020 | Nils Froleyks, Marijn Heule, Ashlin Iser, Matti Järvisalo, Martin Suda | Artificial Intelligence Journal (AIJ) | 2021 |
| Collaborative Management of Benchmark Instances and their Attributes | Ashlin Iser, Luca Springer, Carsten Sinz | arXiv preprint | 2020 |
| Proceedings of SAT Competition 2020: Solver and Benchmark Descriptions | Editors: Tomáš Balyo, Nils Froleyks, Marijn Heule, Ashlin Iser, Matti Järvisalo, Martin Suda | University of Helsinki, Department of Computer Science | 2020 |
| Recognition and Exploitation of Gate Structure in SAT Solving (Dissertation) | Ashlin Iser | Karlsruhe Institute of Technology, Germany | 2020 |
| Memory Efficient Parallel SAT Solving with Inprocessing | Ashlin Iser, Tomáš Balyo, Carsten Sinz | IEEE 31st International Conference on Tools with Artificial Intelligence (ICTAI 2019) | 2019 |
| Candy for SAT Race 2019 | Ashlin Iser, Felix Kutzner | SAT RACE 2019 | 2019 |
| Systematic Analysis of Experiments in Solving Boolean Satisfiability Problems | Ashlin Iser | Deduktionstreffen | 2019 |
| Integrating Static Code Analysis Toolchains | Matthias Kern, Ferhat Erata, Ashlin Iser, Carsten Sinz, Frederic Loiret, Stefan Otten, Eric Sax | IEEE 43rd Annual Computer Software and Applications Conference (COMPSAC) | 2019 |
| A Problem Meta-Data Library for Research in SAT | Ashlin Iser, Carsten Sinz | Proceedings of Pragmatics of SAT | 2019 |
| Using Gate Recognition and Random Simulation for Under-Approximation and Optimized Branching in SAT Solvers | Ashlin Iser, Felix Kutzner, Carsten Sinz | IEEE 29th International Conference on Tools with Artificial Intelligence (ICTAI 2017) | 2017 |
| System Description of Candy Kingdom - A Sweet Family of SAT Solvers | Ashlin Iser, Felix Kutzner | SAT COMPETITION 2017 | 2017 |
| SAT Race 2015 | Tomáš Balyo, Armin Biere, Ashlin Iser, Carsten Sinz | Journal of Artificial Intelligence | 2016 |
| Beans and Eggs - Proteins for Glucose 3.0 | Ashlin Iser | SAT COMPETITION 2016 | 2016 |
| Recognition of Nested Gates in CNF Formulas | Ashlin Iser, Norbert Manthey, Carsten Sinz | International Conference on Theory and Applications of Satisfiability Testing (SAT 2015) | 2015 |
| Minimizing Models for Tseitin-Encoded SAT Instances | Ashlin Iser, Carsten Sinz, Mana Taghdiri | International Conference on Theory and Applications of Satisfiability Testing (SAT 2013) | 2013 |
| Optimizing MiniSAT Variable Orderings for the Relational Model Finder Kodkod | Ashlin Iser, Mana Taghdiri, Carsten Sinz | International Conference on Theory and Applications of Satisfiability Testing (SAT 2012) | 2012 |
| MiniSAT 09z for SAT-Competition 2009 | Ashlin Iser | SAT 2009 competitive events booklet | 2009 |
| Problem-Sensitive Restart Heuristics for the DPLL Procedure | Carsten Sinz, Ashlin Iser | International Conference on Theory and Applications of Satisfiability Testing (SAT 2009) | 2009 |
Supervised Theses
| Title | Student | Date | Type |
|---|---|---|---|
| Automated Tuning and Portfolio Selection for SAT Solvers | Tobias Fuchs | Mai 2023 | Master Thesis |
| Product Configuration as a MaxSMT Problem | Björn Ehrlinspiel | Apr. 2023 | Master Thesis (external) |
| Fuzzy Clause Weights Through Trail Sampling | Achim Kriso | Mar. 2023 | Master Thesis |
| Construction of Binary Decision Diagrams | Maxim Popov | Nov. 2022 | Master Thesis (external) |
| Predicting Hardness and Runtime of SAT Instances | Sajjad Ahmad | Nov. 2022 | Master Thesis (external) |
| Feature Importance in SAT Instance Classification | Elizaveta Danilova | Aug. 2022 | Bachelor Thesis |
| Decision Heuristics in a Constraint-based Product Configurator | Matthias Gorenflo | Jun. 2022 | Master Thesis (external) |
| A Novel SAT Solver Architecture | Thomas Barthel | Jun. 2022 | Master Thesis (external) |
| Cluster Analysis for SAT Instances | Paul Ferdinand Heinen | Feb. 2022 | Bachelor Thesis |
| Asynchronous Clause Exchange for Malleable SAT Solving | Malte Sönnichsen | Feb. 2022 | Master Thesis |
| Selecting SAT Instances to Evaluate Solvers | Youheng Lü | Jul. 2021 | Bachelor Thesis |
| Massively Parallel Software Verification with Mallob and LLBMC | Christian Solomon | Feb. 2021 | Bachelor Thesis |
| Integer Arithmetic in SAT-based Product Configuration | Nik Böttger | Jun. 2020 | Master Thesis (external) |
| Explainable k-Portfolios of SAT-Solvers | Luc Mercatoris | Apr. 2021 | Bachelor Thesis |
| Efficient Approximation of Implicated Literals Applied in SAT-based Product Configuration | Johannes Werner | Dec. 2020 | Master Thesis (external) |
| Recognition of Constraints in CNF Formulas | Robin Link | Oct. 2020 | Bachelor Thesis |
| Controlling Heuristics in CDCL SAT Solving with Adaptive Centrality Computations | Norbert Blümle | Jan. 2020 | Master Thesis |
| Automated Analysis of Runtime Experiments in SAT Solving | Benjamin-Philipp Roth | Nov. 2019 | Bachelor Thesis |
| Exploiting Gate Structure to Direct CDCL Search via Variable Selection and Approximation | Felix Kutzner | Jun. 2016 | Diploma Thesis |
| Kodierungen zur Lösung von Ressourcen-abhängigen Terminplanungsproblemen mittels Integer Linear Programming | Norbert Blümle | Nov. 2015 | Bachelor Thesis |
| SAT-based Solutions to the Resource-constrained Project Scheduling Problem | Christian Ammann | Nov. 2015 | Bachelor Thesis |
| SAT-basierte Lösungsverfahren für das Discrete Tomography Problem: Eine vergleichende Untersuchung | Rosina Kazokova | Jan. 2015 | Bachelor Thesis |