Andre Schidler

Address:
Andre Schidler
Technische Universität Wien
Institute of Logic and Computation
Favoritenstraße 9–11, E192-01
1040 Wien
Austria

Room: HA0402
Phone: +43(1)58801–192136
Email: aschidler@ac.tuwien.ac.at
Web: http://www.ac.tuwien.ac.at/people/aschidler/

Publications

21 results
2025
[21]Extracting Problem Structure with LLMs for Optimized SAT Local Search
,
SOCS 2025, The 18th International Symposium on Combinatorial Search. August 12-15, 2025. University of Glasgow, Scotland, United Kingdom, 2025.
Note: to appear
[bibtex]
2024
[20]SAT-based Decision Tree Learning for Large Data Sets
,
Journal of Artificial Intelligence Research, volume 80, pages 875–918, 2024.
[bibtex]
[19]Backdoor DNFs
, ,
Journal of Computer and System Sciences, volume 144, pages 103547, 2024.
[bibtex] [doi]
[18]Structure-guided Local Improvement for Maximum Satisfiability
,
The 30th International Conference on Principles and Practice of Constraint Programming, CP 2024 (Paul Shaw, ed.), 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex]
2023
[17]Computing optimal hypertree decompositions with SAT
,
Artificial Intelligence, volume 325, pages 104015, 2023.
[bibtex] [pdf] [doi]
[16]SAT-Boosted Tabu Search for Coloring Massive Graphs
,
J. Exp. Algorithmics, volume 2825, number 1.5, pages 1–19, 2023.
[bibtex] [doi]
[15]Computing twin-width with SAT and branch & bound
,
The 32nd International Joint Conference on Artificial Intelligence (IJCAI-23), August 19–25, 2023, Macao, S.A.R. (Edith Elkind, ed.), pages 2013–2021, 2023, ijcai.org.
Note: Main Track
[bibtex] [pdf] [doi]
[14]A Dynamic MaxSAT-based Approach to Directed Feedback Vertex Sets
,
Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2023, Florence, Italy, January 22-23, 2023 (Gonzalo Navarro, Julian Shun, eds.), pages 39–52, 2023, SIAM.
[bibtex] [doi]
2022
[13]Threshold Treewidth and Hypertree Width
, , ,
Journal of Artificial Intelligence Research, volume 74, pages 1687–1713, 2022.
[bibtex] [pdf] [doi]
[12]A SAT Approach to Twin-Width
,
Proceedings of ALENEX 2022, the 24nd SIAM Symposium on Algorithm Engineering and Experiments (Cynthia A. Phillips, Bettina Speckmann, eds.), pages 67–77, 2022, Society for Industrial and Applied Mathematics (SIAM).
[bibtex] [pdf] [doi]
[11]PACE Solver Description: DAGer - Cutting out Cycles with MaxSAT
,
17th International Symposium on Parameterized and Exact Computation, IPEC 2022, September 7-9, 2022, Potsdam, Germany (Holger Dell, Jesper Nederlof, eds.), volume 249 of LIPIcs, pages 32:1–32:4, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[10]SAT-Based Local Search for Plane Subgraph Partitions (CG Challenge)

38th International Symposium on Computational Geometry, SoCG 2022, June 7-10, 2022, Berlin, Germany (Xavier Goaoc, Michael Kerber, eds.), volume 224 of LIPIcs, pages 74:1–74:8, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[9]Weighted Model Counting with Twin-Width
, , , ,
25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, August 2-5, 2022, Haifa, Israel (Kuldeep S. Meel, Ofer Strichman, eds.), volume 236 of LIPIcs, pages 15:1–15:17, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[8]Tractable Abstract Argumentation via Backdoor-Treewidth
, , , , ,
Thirty-Sixth AAAI Conference on Artificial Intelligence, AAAI 2022, Thirty-Fourth Conference on Innovative Applications of Artificial Intelligence, IAAI 2022, The Twelveth Symposium on Educational Advances in Artificial Intelligence, EAAI 2022 Virtual Event, February 22 - March 1, 2022, pages 5608–5615, 2022, AAAI Press.
[bibtex] [pdf]
2021
[7]Computing Optimal Hypertree Decompositions with SAT
,
Proceeding of IJCAI-21, the 30th International Joint Conference on Artificial Intelligence (Zhi-Hua Zhou, ed.), 2021.
[bibtex] [doi]
[6]SAT-based Decision Tree Learning for Large Data Sets
,
Proceeding of AAAI-21, the Thirty-Fifth AAAI Conference on Artificial Intelligence, pages 3904–3912, 2021, AAAI Press.
[bibtex] [pdf]
[5]Backdoor DNFs
, ,
Proceeding of IJCAI-2021, the 30th International Joint Conference on Artificial Intelligence (Zhi-Hua Zhou, ed.), pages 1403–1409, 2021.
[bibtex] [doi]
2020
[4]Computing Optimal Hypertree Decompositions
,
Proceedings of ALENEX 2020, the 22nd SIAM Symposium on Algorithm Engineering and Experiments (Guy Blelloch, Irene Finocchi, eds.), pages 1–11, 2020, Society for Industrial and Applied Mathematics (SIAM).
[bibtex] [pdf]
[3]Threshold Treewidth and Hypertree Width
, , ,
Proceeding of IJCAI-PRICAI2020, the 29th International Joint Conference on Artificial Intelligence and the 17th Pacific Rim International Conference on Artificial Intelligence, pages 1898–1904, 2020.
[bibtex] [pdf] [doi]
[2]Towards Faster Reasoners by Using Transparent Huge Pages
, , ,
Principles and Practice of Constraint Programming - 26th International Conference, CP 2020, Louvain-la-Neuve, Belgium, September 7-11, 2020, Proceedings, volume 12333 of Lecture Notes in Computer Science, pages 304–322, 2020, Springer Verlag.
[bibtex]
[1]Solving the Steiner Tree Problem with few Terminals
, ,
32nd IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2020, Baltimore, MD, USA, November 9-11, 2020, pages 293–300, 2020, IEEE.
[bibtex]