Martina Seidl
Johannes Kepler Universität Linz
H-index: 32
Europe-Austria
Top articles of Martina Seidl
Title | Journal | Author(s) | Publication Date |
|---|---|---|---|
From Decision Models To User-Guiding Configurators Using SMT | Maximilian Heisinger Florian Piminger Martina Seidl | 2024/2/7 | |
Symbolic Reasoning for Industrial-Scale Variant Configuration | Florian Alexander Martina Seidl | 2023/12 | |
Enumerative Level-2 Solution Counting for Quantified Boolean Formulas (Short Paper) | Andreas Plank Sibylle Möhle Martina Seidl | 2023 | |
True Crafted Formula Families for Benchmarking Quantified Satisfiability Solvers | Simone Heisinger Martina Seidl | 2023/8/28 | |
QMusExt: A Minimal (Un) satisfiable Core Extractor for Quantified Boolean Formulas | Andreas Plank Martina Seidl | 2023 | |
Never Trust Your Solver: Certification for SAT and QBF | Martina Seidl | 2023/8/28 | |
Validation of QBF Encodings with Winning Strategies | Irfansha Shaik Maximilian Heisinger Martina Seidl Jaco van de Pol | 2023 | |
ParaQooba: A Fast and Flexible Framework for Parallel and Distributed QBF Solving | Maximilian Heisinger Martina Seidl Armin Biere | 2023/4/22 | |
Search-Space Pruning with Int-Splits for Faster QBF Solving | arXiv preprint arXiv:2304.08308 | Maximilian Heisinger Irfansha Shaik Martina Seidl Jaco van de Pol | 2023/4/17 |
FERPModels: a certification framework for expansion-based QBF solving | Vedad Hadžić Roderick Bloem Ankit Shukla Martina Seidl | 2022/9/12 | |
Reproducible Cluster (less) Speedup Analysis | RRRR | Maximilian Heisinger Martina Seidl | 2022 |
Outercount: A first-level solution-counter for quantified boolean formulas | Ankit Shukla Sibylle Möhle Manuel Kauers Martina Seidl | 2022/9/17 | |
QuAPI: Adding Assumptions to Non-Assuming SAT & QBF Solvers. | Maximilian Heisinger Martina Seidl Armin Biere | 2022/9/14 | |
What’s New In QBF Solving?:(Invited Talk) | Martina Seidl | 2022/9/12 | |
Quantified boolean formulas | Olaf Beyersdorff Mikoláš Janota Florian Lonsing Martina Seidl | 2021 | |
Two SAT solvers for solving quantified boolean formulas with an arbitrary number of quantifier alternations | Formal Methods in System Design | Roderick Bloem Nicolas Braud-Santoni Vedad Hadzic Uwe Egly Florian Lonsing | 2021/8 |
Qbffam: A tool for generating QBF families from proof complexity | Olaf Beyersdorff Luca Pulina Martina Seidl Ankit Shukla | 2021/7/2 | |
New ways to multiply 3× 3-matrices | Journal of Symbolic Computation | Marijn JH Heule Manuel Kauers Martina Seidl | 2021/5/1 |
Beyond uniform equivalence between answer-set programs | ACM Transactions on Computational Logic (TOCL) | Johannes Oetsch Martina Seidl Hans Tompits Stefan Woltran | 2020/12/2 |
Theory and Applications of Satisfiability Testing-SAT 2020 | Carsten Sinz Uwe Egly | 2014/7/2 |
