Publications Katalin Fazekas

2020

Katalin Fazekas, Markus Sinnl, Armin Biere, Sophie Parragh. Duplex Encoding of Staircase At-Most-One Constraints for the Antibandwidth Problem. In Proc.  17th Intl. Conf. on Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR'20), Lecture Notes in Computer Science (LNCS) vol. 12296, pages 186-204, Springer 2020.
[ preprint | bibtex | experiments ]

Katalin Fazekas. On SAT-based Solution Methods for Computational Problems. Dissertation Technische Wissenschaften, Informatik, Johannes Kepler University, Linz, 2020.
[ thesis | bibtex ]

Armin Biere, Katalin Fazekas, Mathias Fleury, Maximillian Heisinger. CaDiCaL, Kissat, Paracooba, Plingeling and Treengeling Entering the SAT Competition 2020. In Proc. of SAT Competition 2020 - Solver and Benchmark Descriptions, Tomas Balyo, Nils Froleyks, Marijn Heule, Markus Iser, Matti J√§rvisalo, Martin Suda (editors), vol. B-2020-1 of Department of Computer Science Report Series B, pages 50-53, University of Helsinki, 2020.
[ paper | bibtex | kissat | cadical | paracooba | plingeling | treengeling ]

Katalin Fazekas, Markus Sinnl, Armin Biere, Sophie Parragh. Duplex Encoding of Antibandwidth Feasibility. In Proc. of SAT Competition 2020 - Solver and Benchmark Descriptions, Tomas Balyo, Nils Froleyks, Marijn Heule, Markus Iser, Matti J√§rvisalo, Martin Suda (editors), vol. B-2020-1 of Department of Computer Science Report Series B, 2020. pages 81-82, University of Helsinki, 2020.
[ paper | bibtex | benchmarks ]

2019

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 ]

2018

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 ]

2017

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 ]

2016

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 ]