[HTML][HTML] LARS: A logic-based framework for analytic reasoning over streams
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 …
processing tools that no longer store data for static querying but push information to …
Linear-time temporal answer set programming
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 …
its application to Knowledge Representation and Declarative Problem Solving. The syntax of …
Logic programming for deliberative robotic task planning
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 …
increasingly complex tasks and interaction in different environments including humans …
Ltlf2asp: Ltlf bounded satisfiability in ASP
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 …
Intelligence (AI). Indeed, several AI applications rely on checking the satisfiability of temporal …
telingo = ASP + Time
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 …
finite linear time and provide insights into its implementation. telingo takes temporal logic …
Temporal answer set programming on finite traces
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 …
that relies on a variation of Temporal Equilibrium Logic (TEL) for finite traces. This approach …
Time and Gödel: Fuzzy temporal reasoning in PSPACE
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 …
is Gödel–Dummett logic (which is well known both as a superintuitionistic logic and a t-norm …
[HTML][HTML] Autoepistemic answer set programming
Defined by Gelfond in 1991, epistemic specifications constitute an extension of Answer Set
Programming (ASP) that introduces subjective literals. A subjective literal allows checking …
Programming (ASP) that introduces subjective literals. A subjective literal allows checking …
Towards metric temporal answer set programming
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 …
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 …
extension of Datalog with metric operators. As a result, we obtain a rule language which …