Florentina Voboril | AC Group | TU Wien

Streamliners for Answer Set Programming

Thu, 01 Jan 2026 00:00:00 +0000

Balancing Latin Rectangles with LLM-Generated Streamliners

Wed, 01 Jan 2025 00:00:00 +0000

Generating Streamlining Constraints with Large Language Models

Wed, 01 Jan 2025 00:00:00 +0000

StreamLLM: Enhancing Constraint Programming with Large Language Model-Generated Streamliners

Wed, 01 Jan 2025 00:00:00 +0000

ASK-SAT: Alternating Symmetry-Breaking Combinatorial Search with SAT

Mon, 01 Jan 2024 00:00:00 +0000

Project Acronym: ASK-SAT (Alternating Symmetry-Breaking Combinatorial Search with SAT)

Funding organization: Austrian Science Fund (FWF)

Project number: P 36688

Grant DOI: 10.55776/P36688

Project Team

Topic

Many unsolved problems in discrete mathematics and extremal combinatorics can be stated as whether a combinatorial object with a particular property and size exists.

The project focuses on developing novel methods for answering such questions using the innovative Satisfiability Modulo Symmetries (SMS) technique. This approach departs from traditional exhaustive search strategies by dynamically identifying and excluding redundant sub-configurations, thus streamlining the search process while utilizing the power of solvers for the propositional satisfiability problem (SAT).

The project aims to extend the capabilities of SMS to effectively tackle the existence of objects whose defining property requires alternating quantifiers, which present unique challenges beyond the scope of conventional SAT methods. This involves integrating advanced computational tools, including quantified Boolean formulas and symmetry-reasoning technologies.

Through this research, the project aspires to advance the fields of automated reasoning and discrete mathematics.

Software

The software tool developed through the project is available via GitHub, the documentation via Read the Docs.

STRIDES: Structure Identification with SAT

Mon, 01 Jan 2024 00:00:00 +0000

Project Acronym: STRIDES (Structure Identification with SAT)

Funding organization: Austrian Science Fund (FWF)

Project number: P 36420

Grant DOI: 10.55776/P36420

Project Team

Stefan Szeider (PI)
André Schidler
P.R. Vaidyanathan
Florentina Voboril

Topic

SAT is the famous propositional satisfiability problem. It asks to assign the variables of a propositional formula with truth values 0 and 1 such that the entire formula becomes true. SAT is generally considered intractable, but over the last twenty years, computer programs (SAT solvers) have been engineered that can solve the problem surprisingly fast. Numerous other hard problems can be translated to SAT and solved via SAT solvers. However, the translation to SAT often causes a significant increase in size, which limits the application of SAT solvers to small problem inputs.

The project aims at scaling the use of SAT solvers to large problem inputs by utilizing the recently introduced SAT-based Local Improvement Method (SLIM). It starts with an initial heuristic solution and repeatedly applies a SAT solver to small local parts of the input, overcoming the size limitation. The project will investigate using SLIM for problems that ask to find a specific hard-to-find structure in given data. Such structure identification problems arise in text data, large graphs and networks, and logical circuits. It will focus on methods for making the SLIM approach more efficient and finding general insights into its workings. The research is expected to lead to new theoretical and practical results.

Algorithms for Satisfiability Testing

Sun, 01 Jan 2023 00:00:00 +0000

Computing Treewidth with Constraint Programming

Sat, 01 Jan 2022 00:00:00 +0000

Initial Learning of Textual Programming at School: Evolution of Outreach Activities

Sat, 01 Jan 2022 00:00:00 +0000