An incremental answer set programming based system for finite model computation

Authors:
Martin Gebser;Orkunt Sabuncu;Torsten Schaub
Affiliations:
Universität Potsdam;Universität Potsdam;Simon Fraser University, Canada, and Griffith University, Australia
Venue:
JELIA'10 Proceedings of the 12th European conference on Logics in artificial intelligence
Year:
2010

Citing 4
Cited 3

Extending and implementing the stable model semantics

Artificial Intelligence
Knowledge Representation, Reasoning, and Declarative Problem Solving

Knowledge Representation, Reasoning, and Declarative Problem Solving
SEM: a system for enumerating models

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Reducing Symmetries to Generate Easier SAT Instances

Electronic Notes in Theoretical Computer Science (ENTCS)

Potassco: The Potsdam Answer Set Solving Collection

AI Communications - Answer Set Programming
Finite model computation via answer set programming

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Agent-supported collaboration and interoperability for networked enterprises: Modeling interactions and service compositions

Computers in Industry

Quantified Score

Hi-index	0.00

Visualization

Abstract

We address the problem of Finite Model Computation (FMC) of first-order theories and show that FMC can efficiently and transparently be solved by taking advantage of a recent extension of Answer Set Programming (ASP), 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 implemented a system based on the iASP solver iClingo and demonstrate its competitiveness by showing that it slightly outperforms the winner of the FNT division of CADE's Automated Theorem Proving (ATP) competition.