Strides | AC Group | TU Wienhttps://ac.tuwien.ac.at/tag/strides/StridesHugo Blox Builder (https://hugoblox.com)en-usThu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.pngStrideshttps://ac.tuwien.ac.at/tag/strides/A General Theoretical Framework for Learning Smallest Interpretable Modelshttps://ac.tuwien.ac.at/publication/a-general-theoretical-framework-for-learning-smallest-interpretable-models-2/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-general-theoretical-framework-for-learning-smallest-interpretable-models-2/Agentic Neurosymbolic Collaboration for Mathematical Discovery: A Case Study in Combinatorial Designhttps://ac.tuwien.ac.at/publication/agentic-neurosymbolic-collaboration-for-mathematical-discovery-a-case-study-in-combinatorial-design/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/agentic-neurosymbolic-collaboration-for-mathematical-discovery-a-case-study-in-combinatorial-design/Algorithm Selection with Zero Domain Knowledge via Text Embeddingshttps://ac.tuwien.ac.at/publication/algorithm-selection-with-zero-domain-knowledge-via-text-embeddings/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/algorithm-selection-with-zero-domain-knowledge-via-text-embeddings/Computing Probabilistic Explanations for ML Models: Fixed-Parameter Algorithmshttps://ac.tuwien.ac.at/publication/computing-probabilistic-explanations-for-ml-models-fixed-parameter-algorithms/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/computing-probabilistic-explanations-for-ml-models-fixed-parameter-algorithms/CP-Agent: Agentic Constraint Programminghttps://ac.tuwien.ac.at/publication/cp-agent-agentic-constraint-programming/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/cp-agent-agentic-constraint-programming/From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problemhttps://ac.tuwien.ac.at/publication/from-data-completion-to-problems-on-hypercubes-a-parameterized-analysis-of-the-independent-set-problem-2/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/from-data-completion-to-problems-on-hypercubes-a-parameterized-analysis-of-the-independent-set-problem-2/LLM-Guided Graph Generation for Structure-Based Local Improvement Methodshttps://ac.tuwien.ac.at/publication/llm-guided-graph-generation-for-structure-based-local-improvement-methods/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/llm-guided-graph-generation-for-structure-based-local-improvement-methods/MaxSAT-Based Compression for Tsetlin Machineshttps://ac.tuwien.ac.at/publication/maxsat-based-compression-for-tsetlin-machines/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/maxsat-based-compression-for-tsetlin-machines/OBDDs, SDDs, and Circuits of Bounded Width: Completeness Mattershttps://ac.tuwien.ac.at/publication/obdds-sdds-and-circuits-of-bounded-width-completeness-matters/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/obdds-sdds-and-circuits-of-bounded-width-completeness-matters/Smart Cubing for Graph Search: A Comparative Studyhttps://ac.tuwien.ac.at/publication/smart-cubing-for-graph-search-a-comparative-study/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/smart-cubing-for-graph-search-a-comparative-study/Streamliners for Answer Set Programminghttps://ac.tuwien.ac.at/publication/streamliners-for-answer-set-programming/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/streamliners-for-answer-set-programming/Synthesizing Feature Extractors: An Agentic Approach for Algorithm Selectionhttps://ac.tuwien.ac.at/publication/synthesizing-feature-extractors-an-agentic-approach-for-algorithm-selection/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/synthesizing-feature-extractors-an-agentic-approach-for-algorithm-selection/VIPR Certificate Construction from Black-Box ILP Solvershttps://ac.tuwien.ac.at/publication/vipr-certificate-construction-from-black-box-ilp-solvers/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/vipr-certificate-construction-from-black-box-ilp-solvers/Analyzing Reformulation Performance in Core-Guided MaxSAT Solvinghttps://ac.tuwien.ac.at/publication/analyzing-reformulation-performance-in-core-guided-maxsat-solving/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/analyzing-reformulation-performance-in-core-guided-maxsat-solving/Balancing Latin Rectangles with LLM-Generated Streamlinershttps://ac.tuwien.ac.at/publication/balancing-latin-rectangles-with-llm-generated-streamliners/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/balancing-latin-rectangles-with-llm-generated-streamliners/Bridging Language Models and Symbolic Solvers via the Model Context Protocolhttps://ac.tuwien.ac.at/publication/bridging-language-models-and-symbolic-solvers-via-the-model-context-protocol/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/bridging-language-models-and-symbolic-solvers-via-the-model-context-protocol/Extracting Problem Structure with LLMs for Optimized SAT Local Searchhttps://ac.tuwien.ac.at/publication/extracting-problem-structure-with-llms-for-optimized-sat-local-search/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/extracting-problem-structure-with-llms-for-optimized-sat-local-search/Generating Streamlining Constraints with Large Language Modelshttps://ac.tuwien.ac.at/publication/generating-streamlining-constraints-with-large-language-models/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/generating-streamlining-constraints-with-large-language-models/Optimal Decision Tree Pruning Revisited: Algorithms and Complexityhttps://ac.tuwien.ac.at/publication/optimal-decision-tree-pruning-revisited-algorithms-and-complexity/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/optimal-decision-tree-pruning-revisited-algorithms-and-complexity/StreamLLM: Enhancing Constraint Programming with Large Language Model-Generated Streamlinershttps://ac.tuwien.ac.at/publication/streamllm-enhancing-constraint-programming-with-large-language-model-generated-streamliners/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/streamllm-enhancing-constraint-programming-with-large-language-model-generated-streamliners/Uncovering and Verifying Optimal Community Structure in Complex Networks: A MaxSAT Approachhttps://ac.tuwien.ac.at/publication/uncovering-and-verifying-optimal-community-structure-in-complex-networks-a-maxsat-approach/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/uncovering-and-verifying-optimal-community-structure-in-complex-networks-a-maxsat-approach/A General Theoretical Framework for Learning Smallest Interpretable Modelshttps://ac.tuwien.ac.at/publication/a-general-theoretical-framework-for-learning-smallest-interpretable-models/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-general-theoretical-framework-for-learning-smallest-interpretable-models/Backdoor DNFshttps://ac.tuwien.ac.at/publication/backdoor-dnfs-3/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/backdoor-dnfs-3/Compilation and Fast Model Counting beyond CNFhttps://ac.tuwien.ac.at/publication/compilation-and-fast-model-counting-beyond-cnf/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/compilation-and-fast-model-counting-beyond-cnf/eSLIM: Circuit Minimization with SAT Based Local Improvementhttps://ac.tuwien.ac.at/publication/eslim-circuit-minimization-with-sat-based-local-improvement/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/eslim-circuit-minimization-with-sat-based-local-improvement/Hardness of Random Reordered Encodings of Parity for Resolution and CDCLhttps://ac.tuwien.ac.at/publication/hardness-of-random-reordered-encodings-of-parity-for-resolution-and-cdcl/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/hardness-of-random-reordered-encodings-of-parity-for-resolution-and-cdcl/Learning Small Decision Trees for Data of Low Rank-Widthhttps://ac.tuwien.ac.at/publication/learning-small-decision-trees-for-data-of-low-rank-width/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/learning-small-decision-trees-for-data-of-low-rank-width/Revisiting Causal Discovery from a Complexity-Theoretic Perspectivehttps://ac.tuwien.ac.at/publication/revisiting-causal-discovery-from-a-complexity-theoretic-perspective/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/revisiting-causal-discovery-from-a-complexity-theoretic-perspective/SAT backdoors: Depth beats sizehttps://ac.tuwien.ac.at/publication/sat-backdoors-depth-beats-size-2/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/sat-backdoors-depth-beats-size-2/SAT-based Decision Tree Learning for Large Data Setshttps://ac.tuwien.ac.at/publication/sat-based-decision-tree-learning-for-large-data-sets-3/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/sat-based-decision-tree-learning-for-large-data-sets-3/SAT-Based Tree Decomposition with Iterative Cascading Policy Selectionhttps://ac.tuwien.ac.at/publication/sat-based-tree-decomposition-with-iterative-cascading-policy-selection/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/sat-based-tree-decomposition-with-iterative-cascading-policy-selection/Small unsatisfiable k-CNFs with bounded literal occurrencehttps://ac.tuwien.ac.at/publication/small-unsatisfiable-k-cnfs-with-bounded-literal-occurrence/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/small-unsatisfiable-k-cnfs-with-bounded-literal-occurrence/Structure-guided Local Improvement for Maximum Satisfiabilityhttps://ac.tuwien.ac.at/publication/structure-guided-local-improvement-for-maximum-satisfiability/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/structure-guided-local-improvement-for-maximum-satisfiability/From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problemhttps://ac.tuwien.ac.at/publication/from-data-completion-to-problems-on-hypercubes-a-parameterized-analysis-of-the-independent-set-problem/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/from-data-completion-to-problems-on-hypercubes-a-parameterized-analysis-of-the-independent-set-problem/Proven optimally-balanced Latin rectangles with SAThttps://ac.tuwien.ac.at/publication/proven-optimally-balanced-latin-rectangles-with-sat/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/proven-optimally-balanced-latin-rectangles-with-sat/