TY  - JOUR
A1  - Cabalar, Pedro
A1  - Kaminski, Roland
A1  - Schaub, Torsten H.
A1  - Schuhmann, Anna
T1  - Temporal answer set programming on finite traces
JF  - Theory and practice of logic programming
N2  - In this paper, we introduce an alternative approach to Temporal Answer Set Programming that relies on a variation of Temporal Equilibrium Logic (TEL) for finite traces. This approach allows us to even out the expressiveness of TEL over infinite traces with the computational capacity of (incremental) Answer Set Programming (ASP). Also, we argue that finite traces are more natural when reasoning about action and change. As a result, our approach is readily implementable via multi-shot ASP systems and benefits from an extension of ASP's full-fledged input language with temporal operators. This includes future as well as past operators whose combination offers a rich temporal modeling language. For computation, we identify the class of temporal logic programs and prove that it constitutes a normal form for our approach. Finally, we outline two implementations, a generic one and an extension of the ASP system clingo.

Under consideration for publication in Theory and Practice of Logic Programming (TPLP)
Y1  - 2018
U6  - https://doi.org/10.1017/S1471068418000297
SN  - 1471-0684
SN  - 1475-3081
VL  - 18
IS  - 3-4
SP  - 406
EP  - 420
PB  - Cambridge Univ. Press
CY  - New York
ER  - 
TY  - JOUR
A1  - Gebser, Martin
A1  - Obermeier, Philipp
A1  - Otto, Thomas
A1  - Schaub, Torsten H.
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  -