3 citations · 5 across the 4 of their papers we have counts for
4 papers
Streamliners for Answer Set Programming
Florentina Voboril, Martin Gebser, Stefan Szeider +1
Streamliner constraints reduce the search space of combinatorial problems by ruling out portions of the solution space. We adapt the StreamLLM approach, which uses Large Language M…
A Model-Oriented Approach for Lifting Symmetries in Answer Set Programming
Alice Tarzariol
When solving combinatorial problems, pruning symmetric solution candidates from the search space is essential. Most of the existing approaches are instance-specific and focus on th…
Efficient lifting of symmetry breaking constraints for complex combinatorial problems
Alice Tarzariol, Martin Gebser, Mark Law +1
Many industrial applications require finding solutions to challenging combinatorial problems. Efficient elimination of symmetric solution candidates is one of the key enablers for…
Lifting Symmetry Breaking Constraints with Inductive Logic Programming
Alice Tarzariol, Martin Gebser, Konstantin Schekotihin
Efficient omission of symmetric solution candidates is essential for combinatorial problem-solving. Most of the existing approaches are instance-specific and focus on the automatic…