Finite Model Computation via Answer Set Programming
Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence. Pages 2626-2630.
Abstract
We show how Finite Model Computation (FMC) of first-order theories can efficiently and transparentlybe solved by taking advantage of an extension of Answer Set Programming, called incremental Answer Set Programming (iASP). The idea is to use the incremental parameter in iASP programs to account for the domain size of a model. The FMC problem is then successively addressed for increasing domain sizes until an answer set, representing a finite model of the original first-order theory, is found. We developed a system based on the iASP solver iClingo and demonstrate its competitiveness.
@inproceedings{ijcai2011p437,
title = {Finite Model Computation via Answer Set Programming},
author = {Gebser, Martin and Sabuncu, Orkunt and Schaub, Torsten},
booktitle = {Proceedings of the Twenty-Second International Joint Conference on
Artificial Intelligence, {IJCAI-11}},
publisher = {AAAI Press/International Joint Conferences on Artificial Intelligence},
editor = {Toby Walsh},
pages = {2626--2630},
year = {2011},
month = {7},
doi = {10.5591/978-1-57735-516-8/IJCAI11-437},
url = {https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-437},
}
TY - CPAPER TI - Finite Model Computation via Answer Set Programming AU - Gebser, Martin AU - Sabuncu, Orkunt AU - Schaub, Torsten T2 - Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence, IJCAI-11 PB - AAAI Press/International Joint Conferences on Artificial Intelligence PY - 2011 SP - 2626 EP - 2630 DO - 10.5591/978-1-57735-516-8/IJCAI11-437 UR - https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-437 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: