Reichl, Franz-Xaver; Slivovsky, Friedrich; Szeider, Stefan Certified DQBF solving by definition extraction. (English) Zbl 07495594 Li, Chu-Min (ed.) et al., Theory and applications of satisfiability testing – SAT 2021. 24th international conference, Barcelona, Spain, July 5–9, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12831, 499-517 (2021). MSC: 68Q25 68R07 68T20 PDFBibTeX XMLCite \textit{F.-X. Reichl} et al., Lect. Notes Comput. Sci. 12831, 499--517 (2021; Zbl 07495594) Full Text: DOI arXiv
Peitl, Tomáš; Szeider, Stefan Finding the hardest formulas for resolution. (English) Zbl 1519.68314 J. Artif. Intell. Res. (JAIR) 72, 69-97 (2021). MSC: 68V15 68R07 68T20 PDFBibTeX XMLCite \textit{T. Peitl} and \textit{S. Szeider}, J. Artif. Intell. Res. (JAIR) 72, 69--97 (2021; Zbl 1519.68314) Full Text: DOI
Shukla, Ankit; Slivovsky, Friedrich; Szeider, Stefan Short Q-resolution proofs with homomorphisms. (English) Zbl 07331036 Pulina, Luca (ed.) et al., Theory and applications of satisfiability testing – SAT 2020. 23rd international conference, Alghero, Italy, July 3–10, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12178, 412-428 (2020). MSC: 68Q25 68R07 68T20 PDFBibTeX XMLCite \textit{A. Shukla} et al., Lect. Notes Comput. Sci. 12178, 412--428 (2020; Zbl 07331036) Full Text: DOI
Slivovsky, Friedrich; Szeider, Stefan A faster algorithm for propositional model counting parameterized by incidence treewidth. (English) Zbl 07331026 Pulina, Luca (ed.) et al., Theory and applications of satisfiability testing – SAT 2020. 23rd international conference, Alghero, Italy, July 3–10, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12178, 267-276 (2020). MSC: 68Q25 68R07 68T20 PDFBibTeX XMLCite \textit{F. Slivovsky} and \textit{S. Szeider}, Lect. Notes Comput. Sci. 12178, 267--276 (2020; Zbl 07331026) Full Text: DOI
Lodha, Neha; Ordyniak, Sebastian; Szeider, Stefan A SAT approach to branchwidth. (English) Zbl 1433.68412 ACM Trans. Comput. Log. 20, No. 3, Article No. 15, 24 p. (2019). MSC: 68T20 05C65 05C78 05C85 68R07 PDFBibTeX XMLCite \textit{N. Lodha} et al., ACM Trans. Comput. Log. 20, No. 3, Article No. 15, 24 p. (2019; Zbl 1433.68412) Full Text: DOI Link
Fichte, Johannes K.; Lodha, Neha; Szeider, Stefan SAT-based local improvement for finding tree decompositions of small width. (English) Zbl 1496.68154 Gaspers, Serge (ed.) et al., Theory and applications of satisfiability testing – SAT 2017. 20th international conference, Melbourne, VIC, Australia, August 28 – September 1, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10491, 401-411 (2017). MSC: 68Q17 68R10 68T20 PDFBibTeX XMLCite \textit{J. K. Fichte} et al., Lect. Notes Comput. Sci. 10491, 401--411 (2017; Zbl 1496.68154) Full Text: DOI
Ganian, Robert; Szeider, Stefan Community structure inspired algorithms for SAT and #SAT. (English) Zbl 1471.68322 Heule, Marijn (ed.) et al., Theory and applications of satisfiability testing – SAT 2015. 18th international conference, Austin, TX, USA, September 24–27, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9340, 223-237 (2015). MSC: 68W05 68Q25 68Q27 68R07 68R10 68T20 PDFBibTeX XMLCite \textit{R. Ganian} and \textit{S. Szeider}, Lect. Notes Comput. Sci. 9340, 223--237 (2015; Zbl 1471.68322) Full Text: DOI
Fichte, Johannes Klaus; Szeider, Stefan Backdoors to tractable answer set programming. (English) Zbl 1328.68040 Artif. Intell. 220, 64-103 (2015). MSC: 68N17 68Q25 68T20 PDFBibTeX XMLCite \textit{J. K. Fichte} and \textit{S. Szeider}, Artif. Intell. 220, 64--103 (2015; Zbl 1328.68040) Full Text: DOI
de Haan, Ronald; Kanj, Iyad; Szeider, Stefan On the subexponential-time complexity of CSP. (English) Zbl 1323.68325 J. Artif. Intell. Res. (JAIR) 52, 203-234 (2015). MSC: 68Q25 68Q17 68T20 PDFBibTeX XMLCite \textit{R. de Haan} et al., J. Artif. Intell. Res. (JAIR) 52, 203--234 (2015; Zbl 1323.68325) Full Text: DOI
Gaspers, Serge; Szeider, Stefan Guarantees and limits of preprocessing in constraint satisfaction and reasoning. (English) Zbl 1405.68139 Artif. Intell. 216, 1-19 (2014). MSC: 68Q25 68R05 68T20 PDFBibTeX XMLCite \textit{S. Gaspers} and \textit{S. Szeider}, Artif. Intell. 216, 1--19 (2014; Zbl 1405.68139) Full Text: DOI arXiv
Dvořák, Wolfgang; Ordyniak, Sebastian; Szeider, Stefan Augmenting tractable fragments of abstract argumentation. (English) Zbl 1251.68225 Artif. Intell. 186, 157-173 (2012). MSC: 68T27 68Q25 PDFBibTeX XMLCite \textit{W. Dvořák} et al., Artif. Intell. 186, 157--173 (2012; Zbl 1251.68225) Full Text: DOI
Kim, Eun Jung; Ordyniak, Sebastian; Szeider, Stefan Algorithms and complexity results for persuasive argumentation. (English) Zbl 1230.68189 Artif. Intell. 175, No. 9-10, 1722-1736 (2011). MSC: 68T27 68Q25 PDFBibTeX XMLCite \textit{E. J. Kim} et al., Artif. Intell. 175, No. 9--10, 1722--1736 (2011; Zbl 1230.68189) Full Text: DOI
Ordyniak, Sebastian; Paulusma, Daniel; Szeider, Stefan Satisfiability of acyclic and almost acyclic CNF formulas. (English) Zbl 1245.68112 Lodaya, Kamal (ed.) et al., IARCS annual conference on foundations of software technology and theoretical computer science (FSTTCS 2010), December 15–18, 2010, Chennai, India. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-23-1). LIPIcs – Leibniz International Proceedings in Informatics 8, 84-95, electronic only (2010). MSC: 68Q25 68Q17 68R10 68T20 PDFBibTeX XMLCite \textit{S. Ordyniak} et al., LIPIcs -- Leibniz Int. Proc. Inform. 8, 84--95 (2010; Zbl 1245.68112) Full Text: DOI Link
Samer, Marko; Szeider, Stefan Backdoor sets of quantified Boolean formulas. (English) Zbl 1191.68353 J. Autom. Reasoning 42, No. 1, 77-97 (2009). MSC: 68Q25 68Q17 68T20 PDFBibTeX XMLCite \textit{M. Samer} and \textit{S. Szeider}, J. Autom. Reasoning 42, No. 1, 77--97 (2009; Zbl 1191.68353) Full Text: DOI
Szeider, Stefan Matched formulas and backdoor sets. (English) Zbl 1187.68254 J. Satisf. Boolean Model. Comput. 6, No. 1-3, 1-12 (2009). MSC: 68Q17 68Q25 68T20 PDFBibTeX XMLCite \textit{S. Szeider}, J. Satisf. Boolean Model. Comput. 6, No. 1--3, 1--12 (2009; Zbl 1187.68254)
Samer, Marko; Szeider, Stefan Backdoor sets of quantified Boolean formulas. (English) Zbl 1214.68372 Marques-Silva, João (ed.) et al., Theory and applications of satisfiability testing – SAT 2007. 10th international conference, Lisbon, Portugal, May 28–31, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-72787-3/pbk). Lecture Notes in Computer Science 4501, 230-243 (2007). MSC: 68T20 68Q17 68Q25 PDFBibTeX XMLCite \textit{M. Samer} and \textit{S. Szeider}, Lect. Notes Comput. Sci. 4501, 230--243 (2007; Zbl 1214.68372) Full Text: DOI
Szeider, Stefan Matched formulas and backdoor sets. (English) Zbl 1187.68253 Marques-Silva, João (ed.) et al., Theory and applications of satisfiability testing – SAT 2007. 10th international conference, Lisbon, Portugal, May 28–31, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-72787-3/pbk). Lecture Notes in Computer Science 4501, 94-99 (2007). MSC: 68Q17 68Q25 68T15 68T20 PDFBibTeX XMLCite \textit{S. Szeider}, Lect. Notes Comput. Sci. 4501, 94--99 (2007; Zbl 1187.68253) Full Text: DOI