46 citations · 157 across the 30 of their papers we have counts for
3 papers · 1 filter
Specifying and Exploiting Non-Monotonic Domain-Specific Declarative Heuristics in Answer Set Programming
Richard Comploi-Taupe, Gerhard Friedrich, Konstantin Schekotihin +1
Domain-specific heuristics are an essential technique for solving combinatorial problems efficiently. Current approaches to integrate domain-specific heuristics with Answer Set Pro…
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…
Decomposition Strategies and Multi-shot ASP Solving for Job-shop Scheduling
Mohammed M. S. El-Kholany, Martin Gebser, Konstantin Schekotihin
The Job-shop Scheduling Problem (JSP) is a well-known and challenging combinatorial optimization problem in which tasks sharing a machine are to be arranged in a sequence such that…