Search Results for author:
Found 28 papers, 4 papers with code
Metric Dynamic Equilibrium Logic
In temporal extensions of Answer Set Programming (ASP) based on linear-time, the behavior of dynamic systems is captured by sequences of states.
Past-present temporal programs over finite traces
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.
Metric Temporal Equilibrium Logic over Timed Traces
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.
Explainable Machine Larning for liver transplantation
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.
Automata for dynamic answer set solving: Preliminary report
On the one hand, we elaborate upon a transformation of dynamic formulas into alternating automata that relies on meta-programming in ASP.
Towards a Semantics for Hybrid ASP systems
Over the last decades the development of ASP has brought about an expressive modeling language powered by highly performant systems.
Multi-Context Systems: Dynamics and Evolution (Pre-Print of "Multi-context systems in dynamic environments")
Multi-Context Systems (MCS) model in Computational Logic distributed systems composed of heterogeneous sources, or "contexts", interacting via special rules called "bridge rules".
A System for Explainable Answer Set Programming
We present xclingo, a tool for generating explanations from ASP programs annotated with text and labels.
Temporal Answer Set Programming
We present an overview on Temporal Logic Programming under the perspective of its application for Knowledge Representation and declarative problem solving.
eclingo: A solver for Epistemic Logic Programs
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.
Modular Answer Set Programming as a Formal Specification Language
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.
Towards Metric Temporal Answer Set Programming
We elaborate upon the theoretical foundations of a metric temporal extension of Answer Set Programming.
A Uniform Treatment of Aggregates and Constraints in Hybrid ASP
Characterizing hybrid ASP solving in a generic way is difficult since one needs to abstract from specific theories.
An ASP semantics for Constraints involving Conditional Aggregates
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.
Implementing Dynamic Answer Set Programming
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.
A Rule-Based System for Explainable Donor-Patient Matching in Liver Transplantation
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.
Revisiting Explicit Negation in Answer Set Programming
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.
Dynamic Epistemic Logic with ASP Updates: Application to Conditional Planning
Dynamic Epistemic Logic (DEL) is a family of multimodal logics that has proved to be very successful for epistemic reasoning in planning tasks.
Founded World Views with Autoepistemic Equilibrium Logic
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.
Heuristics, Answer Set Programming and Markov Decision Process for Solving a Set of Spatial Puzzles
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.
Splitting Epistemic Logic Programs
In this paper, we propose an extension of the well-known splitting property for logic programs to the epistemic case.
Functional ASP with Intensional Sets: Application to Gelfond-Zhang Aggregates
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.
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.
Temporal Logic Programs with Variables
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.
Equilibrium Graphs
In this paper we present an extension of Peirce's existential graphs to provide a diagrammatic representation of expressions in Quantified Equilibrium Logic (QEL).
Enablers and Inhibitors in Causal Justifications of Logic Programs
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).
Causal Graph Justifications of Logic Programs
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.
An Algebra of Causal Chains
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.
