Exploiting Partial Knowledge in Declarative Domain-Specific Heuristics for ASP

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

doi:10.4204/eptcs.306.9

Cited by 2 publications

(1 citation statement)

References 41 publications

(71 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This work significantly extends a conference paper by Taupe, Schekotihin, Schüller, Weinzierl, and Friedrich (2019a) by more examples, rethought language syntax, new encodings, a more detailed evaluation, and an extensive study of state-space search with A* implemented in the suggested approach.…”

Section: Acknowledgmentsmentioning

confidence: 68%

Domain-Specific Heuristics in Answer Set Programming: A Declarative Non-Monotonic Approach

Comploi-Taupe

Friedrich

Schekotihin

et al. 2023

jair

View full text Add to dashboard Cite

Domain-specific heuristics are an essential technique for solving combinatorial problems efficiently. Current approaches to integrate domain-specific heuristics with Answer Set Programming (ASP) are unsatisfactory when dealing with heuristics that are specified non-monotonically on the basis of partial assignments. Such heuristics frequently occur in practice, for example, when picking an item that has not yet been placed in bin packing. Therefore, we present novel syntax and semantics for declarative specifications of domain-specific heuristics in ASP. Our approach supports heuristic statements that depend on the partial assignment maintained during solving, which has not been possible before. We provide an implementation in Alpha that makes Alpha the first lazy-grounding ASP system to support declaratively specified domain-specific heuristics. Two practical example domains are used to demonstrate the benefits of our proposal. Additionally, we use our approach to implement informed search with A*, which is tackled within ASP for the first time. A* is applied to two further search problems. The experiments confirm that combining lazy-grounding ASP solving and our novel heuristics can be vital for solving industrial-size problems.

show abstract

Section: Acknowledgmentsmentioning

confidence: 68%

Domain-Specific Heuristics in Answer Set Programming: A Declarative Non-Monotonic Approach

Comploi-Taupe

Friedrich

Schekotihin

et al. 2023

jair

View full text Add to dashboard Cite

show abstract

Specifying and Exploiting Non-Monotonic Domain-Specific Declarative Heuristics in Answer Set Programming

Comploi-Taupe¹,

Friedrich²,

Schekotihin³

et al. 2022

Preprint

Self Cite

View full text Add to dashboard Cite

Domain-specific heuristics are an essential technique for solving combinatorial problems efficiently. Current approaches to integrate domain-specific heuristics with Answer Set Programming (ASP) are unsatisfactory when dealing with heuristics that are specified non-monotonically on the basis of partial assignments. Such heuristics frequently occur in practice, for example, when picking an item that has not yet been placed in bin packing. Therefore, we present novel syntax and semantics for declarative specifications of domainspecific heuristics in ASP. Our approach supports heuristic statements that depend on the partial assignment maintained during solving, which has not been possible before. We provide an implementation in Alpha that makes Alpha the first lazy-grounding ASP system to support declaratively specified domain-specific heuristics. Two practical example domains are used to demonstrate the benefits of our proposal. Additionally, we use our approach to implement informed search with A*, which is tackled within ASP for the first time. A* is applied to two further search problems. The experiments confirm that combining lazy-grounding ASP solving and our novel heuristics can be vital for solving industrial-size problems. * . This work significantly extends a conference paper by Taupe, Schekotihin, Schüller, Weinzierl, and Friedrich (2019a) by more examples, rethought language syntax, new encodings, a more detailed evaluation, and an extensive study of state-space search with A* implemented in the suggested approach. †. Richard Comploi-Taupe (formerly known as Richard Taupe) is the main author of this paper; other authors contributed equally and are listed in the alphabetical order.

show abstract

Exploiting Partial Knowledge in Declarative Domain-Specific Heuristics for ASP

Cited by 2 publications

References 41 publications

Domain-Specific Heuristics in Answer Set Programming: A Declarative Non-Monotonic Approach

Domain-Specific Heuristics in Answer Set Programming: A Declarative Non-Monotonic Approach

Specifying and Exploiting Non-Monotonic Domain-Specific Declarative Heuristics in Answer Set Programming

Contact Info

Product

Resources

About