Finite Model Computation via Answer Set Programming

Thumbnail
View/Open
File version
Version of Record (VoR)
Author(s)
Gebser, Martin
Sabuncu, Orkunt
Schaub, Torsten
Griffith University Author(s)
Year published
2011
Metadata
Show full item record
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.
Conference Title
Twenty-Second International Joint Conference on Artificial Intelligence Proceedings
DOI
Copyright Statement
© 2011 International Joint Conference on Artificial Intelligence. The attached file is reproduced here in accordance with the copyright policy of the publisher. Please refer to the Conference's website for access to the definitive, published version.
Publication URI
Collection