PPaperPicks

Stefan Szeider

13 papers at tracked venues · 9 at CORE A* · active 20242026

Venues

Frequent coauthors

Papers

  1. Computing Probabilistic Explanations for ML Models: Fixed-Parameter Algorithms
  2. Generating Streamlining Constraints with Large Language Models (Abstract Reprint)
  3. Graph Choosability via SAT: Beyond the Nullstellensatz
  4. Breaking Symmetries in Quantified Graph Search: A Comparative Study
  5. Optimal Decision Tree Pruning Revisited: Algorithms and Complexity
  6. A General Theoretical Framework for Learning Smallest Interpretable Models
  7. ASP-QRAT: A Conditionally Optimal Dual Proof System for ASP
  8. Compilation and Fast Model Counting beyond CNF
  9. Explaining Decisions in ML Models: A Parameterized Complexity Analysis
  10. Hardness of Random Reordered Encodings of Parity for Resolution and CDCL
  11. Learning Small Decision Trees for Data of Low Rank-Width
  12. Revisiting Causal Discovery from a Complexity-Theoretic Perspective
  13. SAT-Based Tree Decomposition with Iterative Cascading Policy Selection