[HTML][HTML] LARS: A logic-based framework for analytic reasoning over streams

H Beck, M Dao-Tran, T Eiter - Artificial Intelligence, 2018 - Elsevier
The increasing availability of streaming data has accelerated advances in information
processing tools that no longer store data for static querying but push information to …

Linear-time temporal answer set programming

F Aguado, P Cabalar, M Diéguez, G Pérez… - Theory and Practice of …, 2023 - cambridge.org
In this survey, we present an overview on (Modal) Temporal Logic Programming in view of
its application to Knowledge Representation and Declarative Problem Solving. The syntax of …

Logic programming for deliberative robotic task planning

D Meli, H Nakawala, P Fiorini - Artificial Intelligence Review, 2023 - Springer
Over the last decade, the use of robots in production and daily life has increased. With
increasingly complex tasks and interaction in different environments including humans …

Ltlf2asp: Ltlf bounded satisfiability in ASP

V Fionda, A Ielo, F Ricca - International Conference on Logic …, 2024 - Springer
Abstract Finite variant of Linear Temporal Logic (LTL f) is increasingly popular in Artificial
Intelligence (AI). Indeed, several AI applications rely on checking the satisfiability of temporal …

telingo = ASP + Time

P Cabalar, R Kaminski, P Morkisch… - … Conference on Logic …, 2019 - Springer
We describe telingo, an extension of the ASP system clingo with temporal operators over
finite linear time and provide insights into its implementation. telingo takes temporal logic …

Temporal answer set programming on finite traces

P Cabalar, R Kaminski, T Schaub… - Theory and Practice of …, 2018 - cambridge.org
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 …

Time and Gödel: Fuzzy temporal reasoning in PSPACE

JP Aguilera, M Diéguez, D Fernández-Duque… - … Workshop on Logic …, 2022 - Springer
We investigate a non-classical version of linear temporal logic whose propositional fragment
is Gödel–Dummett logic (which is well known both as a superintuitionistic logic and a t-norm …

[HTML][HTML] Autoepistemic answer set programming

P Cabalar, J Fandinno, LF del Cerro - Artificial Intelligence, 2020 - Elsevier
Defined by Gelfond in 1991, epistemic specifications constitute an extension of Answer Set
Programming (ASP) that introduces subjective literals. A subjective literal allows checking …

Towards metric temporal answer set programming

P Cabalar, M Dieguez, T Schaub… - Theory and Practice of …, 2020 - cambridge.org
We elaborate upon the theoretical foundations of a metric temporal extension of Answer Set
Programming. In analogy to previous extensions of ASP with constructs from Linear …

DatalogMTL with negation under stable models semantics

PA Wałęga, DJ Tena Cucala, EV Kostylev… - 2021 - ora.ox.ac.uk
We introduce negation under stable models semantics in DatalogMTL—a temporal
extension of Datalog with metric operators. As a result, we obtain a rule language which …