Asksat | AC Group | TU Wienhttps://ac.tuwien.ac.at/tag/asksat/AsksatHugo Blox Builder (https://hugoblox.com)en-usThu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.pngAsksathttps://ac.tuwien.ac.at/tag/asksat/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/ASP-Bench: From Natural Language to Logic Programshttps://ac.tuwien.ac.at/publication/asp-bench-from-natural-language-to-logic-programs/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/asp-bench-from-natural-language-to-logic-programs/Backdoors to Satisfaction Continuedhttps://ac.tuwien.ac.at/publication/backdoors-to-satisfaction-continued/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/backdoors-to-satisfaction-continued/ContReAct: A Feedback-Based Architecture for Continuous Agentic Operationhttps://ac.tuwien.ac.at/publication/contreact-a-feedback-based-architecture-for-continuous-agentic-operation/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/contreact-a-feedback-based-architecture-for-continuous-agentic-operation/Neurosymbolic Discovery of Algebraic Graph Constructionshttps://ac.tuwien.ac.at/publication/neurosymbolic-discovery-of-algebraic-graph-constructions/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/neurosymbolic-discovery-of-algebraic-graph-constructions/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/Breaking Symmetries in Quantified Graph Search: A Comparative Studyhttps://ac.tuwien.ac.at/publication/breaking-symmetries-in-quantified-graph-search-a-comparative-study/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/breaking-symmetries-in-quantified-graph-search-a-comparative-study/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/SAT Modulo Symmetries: A Surveyhttps://ac.tuwien.ac.at/publication/sat-modulo-symmetries-a-survey/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/sat-modulo-symmetries-a-survey/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/The 3-Decomposition Conjecture: A SAT-Based Approach with Specialized Propagatorshttps://ac.tuwien.ac.at/publication/the-3-decomposition-conjecture-a-sat-based-approach-with-specialized-propagators/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-3-decomposition-conjecture-a-sat-based-approach-with-specialized-propagators/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/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/Computing small Rainbow Cycle Numbers with SAT modulo Symmetrieshttps://ac.tuwien.ac.at/publication/computing-small-rainbow-cycle-numbers-with-sat-modulo-symmetries/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/computing-small-rainbow-cycle-numbers-with-sat-modulo-symmetries/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 Modulo Symmetries for Graph Generation and Enumerationhttps://ac.tuwien.ac.at/publication/sat-modulo-symmetries-for-graph-generation-and-enumeration/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/sat-modulo-symmetries-for-graph-generation-and-enumeration/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/