[Back]

T. Eiter, T. Kaminski, A. Weinzierl:
"Lazy-Grounding for Answer Set Programs with External Source Access";
Talk: 26th International Joint Conference on Artificial Intelligence (IJCAI 2017), Melbourne, Australia; 2017-08-19 - 2017-08-25; in: "Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, Melbourne, Australia, August 19-25, 2017", C. Sierra (ed.); ijcai.org, Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, Melbourne, Australia, August 19-25, 2017 (2017), ISBN: 978-0-9992411-0-3; 1015 - 1022.

HEX-programs enrich the well-known Answer Set Programming (ASP) paradigm. In HEX, problems are solved using nonmonotonic logic programs with bidirectional access to external sources. ASP evaluation is traditionally based on grounding the input program first, but recent advances in lazy-grounding make the latter also interesting for HEX, as the grounding bottleneck of ASP may be avoided. We explore this issue and present a new evaluation algorithm for HEX-programs based on lazy-grounding solving for ASP. Nonmonotonic dependencies and value invention (i.e., import of new constants) from external sources make an efficient solution nontrivial. However, illustrative benchmarks show a clear advantage of the new algorithm for grounding-intense programs, which is a new perspective to make HEX more suitable for real-world application needs.

Knowledge Representation and Reasoning, Answer Set Programming, External Source Access, Lazy Grounding

http://dx.doi.org/10.24963/ijcai.2017/141

Project Head Thomas Eiter:
Doppel -Kreisüberdeckungen, Bipartisierende Matchings und Snarks

Project Head Thomas Eiter:
Integrated Evaluation of Answer Set Programs and Extensions