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.
翻译:特定域的外观是有效解决组合问题的一种必要技术。 将特定域的外观与回答设置编程( ASP) 整合成特定域域的外观与响应设置编程( ASP) (ASP) (ASP) (ASP) (ASP) (ASP) (ASP) (ASP) (ASP) (ASP) (ASP) (ASP) (ASP) (ASP) (ASP) (ASP) (ASP) (ASP) (ASP) (ASP) (ASP) (ASP) (ASP) (ASP) (ASP) (ASP) (ASP) (ASP) (ASP) (ASP) (ASP) (ASP) (ASP) (A) (ASP) (ASP) (ASP) (ASP) (ASP) (ASP) (ASP) (ASP) (A(ASP) (ASP) (ASP) (A) (APSP) (A(A) (A) (ASP) (A) (APSP) (A) (A(APSP) (A(ASP) (ASP) (A) (ASP) (ASP) (A) (A) (A) (A) (A) (ASP) (A) (ASP) (A) (ASP) (ASP) (ASP) (ASP) (A) (A) (ASP) (ASP) (A) (ASP) (ASP) (的当前在部分任务中, 部分任务中, 部分处理非非单外的当前的方法并不令人满意。在部分分配中, 部分性地外的当前方法中, ) (A) (A) (A) (A) (A) (A) (A) (A) (A) (A) (AP) (AP) (AP) (A) (APSP) (ASP) (ASP) (ASP) (ASP) (ASP) (A) (AP) (ASP) (ASP) (ASP) (ASP) (AP) (ASP) (A) (ASP) (ASP)