Completion of Disjunctive Logic Programs
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence. Pages 886-891.
Abstract
Clark's completion plays an important role in ASP computation:it discards unsupported models via unit resolution; hence, it improves the performance of ASP solvers, and at the same time it simplifies their implementation.In the disjunctive case, however, Clark's completion is usually preceded by another transformation known as shift, whose size is quadratic in general. A different approach is proposed in this paper: Clark's completion is extended to disjunctive programs without the need of intermediate program rewritings such as the shift.As in the non-disjunctive case, the new completion is linear in size, and discards unsupported models via unit resolution. Moreover, an ad-hoc propagator for supported model search is presented.
@inproceedings{ijcai2016p130,
title = {Completion of Disjunctive Logic Programs},
author = {Alviano, Mario and Dodaro, Carmine},
booktitle = {Proceedings of the Twenty-Fifth International Joint Conference on
Artificial Intelligence, {IJCAI-16}},
publisher = {AAAI Press / International Joint Conferences on Artificial Intelligence},
editor = {Subbarao Kambhampati},
pages = {886--891},
year = {2016},
month = {7},
url = {https://ijcai.org/proceedings/2016/130},
}
TY - CPAPER TI - Completion of Disjunctive Logic Programs AU - Alviano, Mario AU - Dodaro, Carmine T2 - Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI-16 PB - AAAI Press / International Joint Conferences on Artificial Intelligence PY - 2016 SP - 886 EP - 891 UR - https://ijcai.org/proceedings/2016/130 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
