TY  - JOUR
A1  - Gebser, Martin
A1  - Obermeier, Philipp
A1  - Otto, Thomas
A1  - Schaub, Torsten
A1  - Sabuncu, Orkunt
A1  - Van Nguyen, 
A1  - Tran Cao Son, 
T1  - Experimenting with robotic intra-logistics domains
JF  - Theory and practice of logic programming
N2  - We introduce the asprilo1 framework to facilitate experimental studies of approaches addressing complex dynamic applications. For this purpose, we have chosen the domain of robotic intra-logistics. This domain is not only highly relevant in the context of today's fourth industrial revolution but it moreover combines a multitude of challenging issues within a single uniform framework. This includes multi-agent planning, reasoning about action, change, resources, strategies, etc. In return, asprilo allows users to study alternative solutions as regards effectiveness and scalability. Although asprilo relies on Answer Set Programming and Python, it is readily usable by any system complying with its fact-oriented interface format. This makes it attractive for benchmarking and teaching well beyond logic programming. More precisely, asprilo consists of a versatile benchmark generator, solution checker and visualizer as well as a bunch of reference encodings featuring various ASP techniques. Importantly, the visualizer's animation capabilities are indispensable for complex scenarios like intra-logistics in order to inspect valid as well as invalid solution candidates. Also, it allows for graphically editing benchmark layouts that can be used as a basis for generating benchmark suites.
Y1  - 2018
U6  - https://doi.org/10.1017/S1471068418000200
SN  - 1471-0684
SN  - 1475-3081
VL  - 18
IS  - 3-4
SP  - 502
EP  - 519
PB  - Cambridge Univ. Press
CY  - New York
ER  - 
TY  - JOUR
A1  - Gebser, Martin
A1  - Sabuncu, Orkunt
A1  - Schaub, Torsten
T1  - An incremental answer set programming based system for finite model computation
JF  - AI communications : AICOM ; the European journal on artificial intelligence
N2  - 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 2009 Automated Theorem Proving (ATP) competition on the respective benchmark collection.
KW  - Incremental answer set programming
KW  - finite model computation
Y1  - 2011
U6  - https://doi.org/10.3233/AIC-2011-0496
SN  - 0921-7126
VL  - 24
IS  - 2
SP  - 195
EP  - 212
PB  - IOS Press
CY  - Amsterdam
ER  -