no code implementations • 19 Jan 2024 • Arvid Becker, Pedro Cabalar, Martín Diéguez, Luis Fariñas, Torsten Schaub, Anna Schuhmann
In temporal extensions of Answer Set Programming (ASP) based on linear-time, the behavior of dynamic systems is captured by sequences of states.
no code implementations • 24 Jul 2023 • Pedro Cabalar, Martín Diéguez, François Laferrière, Torsten Schaub
Extensions of Answer Set Programming with language constructs from temporal logics, such as temporal equilibrium logic over finite traces (TELf), provide an expressive computational framework for modeling dynamic applications.
no code implementations • 28 Apr 2023 • Arvid Becker, Pedro Cabalar, Martín Diéguez, Torsten Schaub, Anna Schuhmann
We address this by developing a metric extension of linear-time temporal equilibrium logic, in which temporal operators are constrained by intervals over natural numbers.
1 code implementation • 28 Sep 2021 • Pedro Cabalar, Brais Muñiz, Gilberto Pérez, Francisco Suárez
In this work, we present a flexible method for explaining, in human readable terms, the predictions made by decision trees used as decision support in liver transplantation.
1 code implementation • 4 Sep 2021 • Pedro Cabalar, Martín Diéguez, Susana Hahn, Torsten Schaub
On the one hand, we elaborate upon a transformation of dynamic formulas into alternating automata that relies on meta-programming in ASP.
no code implementations • 6 Aug 2021 • Pedro Cabalar, Jorge Fandinno, Torsten Schaub, Philipp Wanko
Over the last decades the development of ASP has brought about an expressive modeling language powered by highly performant systems.
no code implementations • 12 Jun 2021 • Pedro Cabalar, Stefania Costantini, Giovanni De Gasperis, Andrea Formisano
Multi-Context Systems (MCS) model in Computational Logic distributed systems composed of heterogeneous sources, or "contexts", interacting via special rules called "bridge rules".
1 code implementation • 22 Sep 2020 • Pedro Cabalar, Jorge Fandinno, Brais Muñiz
We present xclingo, a tool for generating explanations from ASP programs annotated with text and labels.
no code implementations • 14 Sep 2020 • Felicidad Aguado, Pedro Cabalar, Martin Dieguez, Gilberto Perez, Torsten Schaub, Anna Schuhmann, Concepcion Vidal
We present an overview on Temporal Logic Programming under the perspective of its application for Knowledge Representation and declarative problem solving.
no code implementations • 5 Aug 2020 • Pedro Cabalar, Martin Dieguez, Torsten Schaub, Anna Schuhmann
We elaborate upon the theoretical foundations of a metric temporal extension of Answer Set Programming.
no code implementations • 5 Aug 2020 • Pedro Cabalar, Jorge Fandinno, Javier Garea, Javier Romero, Torsten Schaub
The input language of eclingo uses the syntax extension capabilities of clingo to define subjective literals that, as usual in epistemic logic programs, allow for checking the truth of a regular literal in all or in some of the answer sets of a program.
no code implementations • 5 Aug 2020 • Pedro Cabalar, Jorge Fandinno, Yuliya Lierler
In this paper, we study the problem of formal verification for Answer Set Programming (ASP), namely, obtaining a formal proof showing that the answer sets of a given (non-ground) logic program P correctly correspond to the solutions to the problem encoded by P, regardless of the problem instance.
no code implementations • 9 Mar 2020 • Pedro Cabalar, Jorge Fandinno, Torsten Schaub, Philipp Wanko
Characterizing hybrid ASP solving in a generic way is difficult since one needs to abstract from specific theories.
no code implementations • 17 Feb 2020 • Pedro Cabalar, Jorge Fandinno, Torsten Schaub, Philipp Wanko
We elaborate upon the formal foundations of hybrid Answer Set Programming (ASP) and extend its underlying logical framework with aggregate functions over constraint values and variables.
no code implementations • 17 Feb 2020 • Pedro Cabalar, Martín Diéguez, Torsten Schaub, François Laferrière
We introduce an implementation of an extension of Answer Set Programming (ASP) with language constructs from dynamic (and temporal) logic that provides an expressive computational framework for modeling dynamic applications.
no code implementations • 18 Sep 2019 • Felicidad Aguado, Pedro Cabalar, Jorge Fandinno, Brais Muñiz, Gilberto Pérez, Francisco Suárez
In this paper we present web-liver, a rule-based system for decision support in the medical domain, focusing on its application in a liver transplantation unit for implementing policies for donor-patient matching.
no code implementations • 26 Jul 2019 • Felicidad Aguado, Pedro Cabalar, Jorge Fandinno, David Pearce, Gilberto Perez, Concepcion Vidal
A common feature in Answer Set Programming is the use of a second negation, stronger than default negation and sometimes called explicit, strong or classical negation.
no code implementations • 25 May 2019 • Pedro Cabalar, Jorge Fandinno, Luis Fariñas del Cerro
Dynamic Epistemic Logic (DEL) is a family of multimodal logics that has proved to be very successful for epistemic reasoning in planning tasks.
no code implementations • 20 Feb 2019 • Pedro Cabalar, Jorge Fandinno, Luis Fariñas
We define when a world view is founded with respect to some program and propose the foundedness property for any semantics whose world views are always founded.
1 code implementation • 16 Feb 2019 • Thiago Freitas dos Santos, Paulo E. Santos, Leonardo A. Ferreira, Reinaldo A. C. Bianchi, Pedro Cabalar
The goal of this work is to investigate the automated solution of this kind of puzzles adapting an algorithm that combines Answer Set Programming (ASP) with Markov Decision Process (MDP), algorithm oASP(MDP), to use heuristics accelerating the learning process.
no code implementations • 20 Dec 2018 • Pedro Cabalar, Jorge Fandinno, Luis Fariñas del Cerro
In this paper, we propose an extension of the well-known splitting property for logic programs to the epistemic case.
no code implementations • 2 May 2018 • Pedro Cabalar, Jorge Fandinno, Luis Fariñas del Cerro, David Pearce
First, while other semantics for aggregates depend on some syntactic transformation (either via a reduct or a formula translation), the QELF interpretation treats them as regular evaluable functions, providing a compositional semantics and avoiding any kind of syntactic restriction.
no code implementations • 26 Apr 2018 • Pedro Cabalar, Roland Kaminski, Torsten Schaub, Anna Schuhmann
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.
no code implementations • 19 Sep 2016 • Felicidad Aguado, Pedro Cabalar, Martín Diéguez, Gilberto Pérez, Concepción Vidal
In this note we consider the problem of introducing variables in temporal logic programs under the formalism of "Temporal Equilibrium Logic" (TEL), an extension of Answer Set Programming (ASP) for dealing with linear-time modal operators.
no code implementations • 7 Sep 2016 • Pedro Cabalar, Carlos Pérez, Gilberto Pérez
In this paper we present an extension of Peirce's existential graphs to provide a diagrammatic representation of expressions in Quantified Equilibrium Logic (QEL).
no code implementations • 22 Feb 2016 • Pedro Cabalar, Jorge Fandinno
The most important result is a formal comparison to the recent algebraic approaches for justifications in LP: "Why-not Provenance" (WnP) and "Causal Graphs" (CG).
no code implementations • 25 Sep 2014 • Pedro Cabalar, Jorge Fandinno, Michael Fink
Finally, for programs with negation, we define the concept of causal stable model by introducing an analogous transformation to Gelfond and Lifschitz's program reduct.
no code implementations • 20 Dec 2013 • Pedro Cabalar, Jorge Fandinno
In this work we propose a multi-valued extension of logic programs under the stable models semantics where each true atom in a model is associated with a set of justifications, in a similar spirit than a set of proof trees.