Publications Katalin Fazekas


Best student paper
Katalin Fazekas, Armin Biere, Christoph Scholl. Incremental Inprocessing SAT Solving. In Proc. 22nd Intl. Conf. on Theory and Applications of Satisfiability Testing (SAT'19), Lecture Notes in Computer Science (LNCS) vol. 11628, pages 136-154, Springer 2019.
[ preprint | bibtex | experiments | pictures ]


Katalin Fazekas, Fahiem Bacchus, Armin Biere. Implicit Hitting Set Algorithms for Maximum Satisfiability Modulo Theories. In Proc. 9th Intl. Joint Conf. on Automated Reasoning (IJCAR'18), Lecture Notes in Computer Science (LNCS), vol. 10900, pages 134-151, Springer 2018.
[ paper | bibtex ]


Katalin Fazekas, Marijn J. H. Heule, Martina Seidl, Armin Biere. Skolem Function Continuation for Quantified Boolean Formulas. Proc. 11th Intl. Conf. on Tests and Proofs (TAP'17). Lecture Notes in Computer Science vol. 10375, Springer, pages 129-138, 2017.
[ paper | bibtex | tool ]


Katalin Fazekas, Martina Seidl, Armin Biere. A Duality-Aware Calculus for Quantified Boolean Formulas. In Proc. 18th Intl. Symp. on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC'16), pages 181-186, IEEE Computer Society, 2016.
[ paper | bibtex ]