Martina Seidl

From MaRDI portal
(Redirected from Person:286395)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
QMusExt: A minimal (un)satisfiable core extractor for quantified Boolean formulas2024-11-26Paper
Validation of QBF encodings with winning strategies2024-11-26Paper
Never trust your solver: certification for SAT and QBF
Lecture Notes in Computer Science
2024-02-28Paper
True crafted formula families for benchmarking quantified satisfiability solvers
Lecture Notes in Computer Science
2024-02-28Paper
OuterCount: a first-level solution-counter for quantified Boolean formulas
Lecture Notes in Computer Science
2023-06-02Paper
A family of schemes for multiplying 3 × 3 matrices with 23 coefficient multiplications
ACM Communications in Computer Algebra
2023-01-11Paper
Skolem function continuation for quantified Boolean formulas
Tests and Proofs
2022-07-01Paper
QBFFam: a tool for generating QBF families from proof complexity2022-03-22Paper
Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations
Formal Methods in System Design
2021-12-08Paper
New ways to multiply \(3 \times 3\)-matrices
Journal of Symbolic Computation
2021-02-18Paper
QRAT polynomially simulates \(\forall\)-Exp+Res2020-05-20Paper
Local search for fast matrix multiplication
(available as arXiv preprint)
2020-05-20Paper
On the maximal minimal cube lengths in distinct DNF tautologies2020-01-21Paper
On the maximal minimal cube lengths in distinct DNF tautologies
(available as arXiv preprint)
2020-01-21Paper
The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17)
Artificial Intelligence
2019-08-28Paper
Blocked clauses in first-order logic
EPiC Series in Computing
2019-01-10Paper
Local redundancy in SAT: generalizations of blocked clauses
(available as arXiv preprint)
2018-11-02Paper
Short proofs for some symmetric quantified Boolean formulas
Information Processing Letters
2018-10-19Paper
Symmetries of quantified Boolean formulas
(available as arXiv preprint)
2018-08-10Paper
Intra- and interdiagram consistency checking of behavioral multiview models
Computer Languages, Systems & Structures
2018-05-15Paper
A little blocked literal goes a long way2017-11-15Paper
Solution validation and extraction for QBF preprocessing
Journal of Automated Reasoning
2017-07-10Paper
Q-resolution with generalized axioms
Theory and Applications of Satisfiability Testing – SAT 2016
2016-09-05Paper
Super-blocked clauses
Automated Reasoning
2016-09-05Paper
The QBF Gallery: behind the scenes
Artificial Intelligence
2016-05-20Paper
Enhancing search-based QBF solving by dynamic blocked clause elimination
Logic for Programming, Artificial Intelligence, and Reasoning
2016-01-12Paper
Clause elimination for SAT and QSAT
Journal of Artificial Intelligence Research
2015-08-25Paper
SAT-Based Synthesis Methods for Safety Specs
Lecture Notes in Computer Science
2015-01-13Paper
\(\mathsf{MPIDepQBF}\): towards parallel QBF solving without knowledge sharing
Lecture Notes in Computer Science
2014-09-26Paper
A unified proof system for QBF preprocessing
Automated Reasoning
2014-09-26Paper
Blocked clause elimination for QBF
Lecture Notes in Computer Science
2011-07-29Paper
Theory and Applications of Satisfiability Testing
Lecture Notes in Computer Science
2009-07-24Paper
A solver for QBFs in negation normal form
Constraints
2009-05-29Paper


Research outcomes over time


This page was built for person: Martina Seidl