Exploiting Partial Assignments for Efficient Evaluation of Answer Set Programs with External Source Access
Abstract
Answer Set Programming (ASP) is a well-known problem solving approach based on nonmonotonic logic programs and efficient solvers. HEX-programs extend ASP with external atoms for access to arbitrary external information. In this work, we extend the evaluation principles of external atoms to partial assignments, lift nogood learning to this setting, and introduce a variant of nogood minimization. This enables external sources to guide the search for answer sets akin to theory propagation. Our benchmark experiments demonstrate a clear improvement in efficiency over the state-of-the-art HEX-solver. PDF
Cite
Text
Eiter et al. "Exploiting Partial Assignments for Efficient Evaluation of Answer Set Programs with External Source Access." International Joint Conference on Artificial Intelligence, 2016.Markdown
[Eiter et al. "Exploiting Partial Assignments for Efficient Evaluation of Answer Set Programs with External Source Access." International Joint Conference on Artificial Intelligence, 2016.](https://mlanthology.org/ijcai/2016/eiter2016ijcai-exploiting/)BibTeX
@inproceedings{eiter2016ijcai-exploiting,
title = {{Exploiting Partial Assignments for Efficient Evaluation of Answer Set Programs with External Source Access}},
author = {Eiter, Thomas and Kaminski, Tobias and Redl, Christoph and Weinzierl, Antonius},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2016},
pages = {1058-1065},
url = {https://mlanthology.org/ijcai/2016/eiter2016ijcai-exploiting/}
}