Exploiting partial knowledge in declarative domain-specific heuristics for ASP

Richard Taupe, Konstantin Schekotihin, Peter Schüller, Antonius Weinzierl, Gerhard Friedrich

Research output: Contribution to journalConference articleScientificpeer-review

4 Citations (Scopus)


Domain-specific heuristics are an important technique for solving combinatorial problems efficiently. We propose a novel semantics for declarative specifications of domain-specific heuristics in Answer Set Programming (ASP). Decision procedures that are based on a partial solution are a frequent ingredient of existing domain-specific heuristics, e.g., for placing an item that has not been placed yet in bin packing. Therefore, in our novel semantics negation as failure and aggregates in heuristic conditions are evaluated on a partial solver state. State-of-the-art solvers do not allow such a declarative specification. Our implementation in the lazy-grounding ASP system Alpha supports heuristic directives under this semantics. By that, we also provide the first implementation for incorporating declaratively specified domain-specific heuristics in a lazy-grounding setting. Experiments confirm that the combination of ASP solving with lazy grounding and our novel heuristics can be a vital ingredient for solving industrial-size problems.

Original languageEnglish
Pages (from-to)22-35
Number of pages14
JournalElectronic Proceedings in Theoretical Computer Science, EPTCS
Publication statusPublished - 19 Sept 2019
MoE publication typeA4 Conference publication
EventInternational Conference on Logic Programming - Las Cruces, United States
Duration: 20 Sept 201925 Sept 2019
Conference number: 35


Dive into the research topics of 'Exploiting partial knowledge in declarative domain-specific heuristics for ASP'. Together they form a unique fingerprint.

Cite this