Heuristics for Hard ASP Programs
نویسندگان
چکیده
We define a new heuristic hDS for ASP, and implement it in the (disjunctive) ASP system DLV. The new heuristic improves the evaluation of Σ2 /Π P 2 hard ASP programs while maintaining the benign behaviour of the well-assessed heuristic of DLV on NP problems. We experiment with the new heuristic on QBFs. hDS significantly outperforms the heuristic of DLV on hard 2QBF problems. We compare also the DLV system (with the new heuristic hDS) to three prominent QBF solvers. The results of the comparison, performed on instances used in the last QBF competition, indicate that ASP systems can be faster than QBF systems on Σ2 /Π P 2 -hard problems.
منابع مشابه
Experimenting with Look-Back Heuristics for Hard ASP Programs
Competitive native solvers for Answer Set Programming (ASP) perform a backtracking search by assuming the truth of literals. The choice of literals (the heuristic) is fundamental for the performance of these systems. Most of the efficient ASP systems employ a heuristic based on look-ahead, that is, a literal is tentatively assumed and its heuristic value is based on its deterministic consequenc...
متن کاملSolving Hard Problems for the Second Level of the Polynomial Hierarchy: Heuristics and Benchmarks
Recent research on answer set programming (ASP) systems, has mainly focused on solving problems more efficiently. Yet, disjunctive logic programs allow for expressing every problem in the complexity classes and . These classes are widely believed to be strictly larger than , and several important AI problems, like conformant and conditional planning, diagnosis and more are located in these clas...
متن کاملLook-back Techniques for ASP Programs with Aggregates
The introduction of aggregates has been one of the most relevant language extensions to Answer Set Programming (ASP). Aggregates are very expressive, they allow to represent many problems in a more succint and elegant way compared to aggregate-free programs. A significant amount of research work has been devoted to aggregates in the ASP community in the last years, and relevant research results...
متن کاملCombining Answer Set Programming and domain heuristics for solving hard industrial problems (Application Paper)
Answer Set Programming (ASP) is a popular logic programming paradigm that has been applied for solving a variety of complex problems. Among the most challenging real-world applications of ASP are two industrial problems defined by Siemens: the Partner Units Problem (PUP) and the Combined Configuration Problem (CCP). The hardest instances of PUP and CCP are out of reach for state-of-the-art ASP ...
متن کاملSolving Hard ASP Programs Efficiently
Recent research on answer set programming (ASP) systems, has mainly focused on solving NP problems more efficiently. Yet, disjunctive logic programs allow for expressing every problem in the complexity classes Σ 2 and Π P 2 . These classes are widely believed to be strictly larger than NP, and several important AI problems, like conformant and conditional planning, diagnosis and more are locate...
متن کامل