30 citations · 102 across the 34 of their papers we have counts for
7 papers · 1 filter
Proceedings of the twelfth Workshop on Answer Set Programming and Other Computing Paradigms 2019
Jorge Fandinno, Johannes Fichte
This is the Proceedings of the twelfth Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP) 2019, which was held in Philadelphia, USA, June 3rd , 2019.
On the Relation between Weak Completion Semantics and Answer Set Semantics
Emmanuelle-Anna Dietz Saldanha, Jorge Fandinno
The Weak Completion Semantics (WCS) is a computational cognitive theory that has shown to be successful in modeling episodes of human reasoning. As the WCS is a recently developed…
A Rule-Based System for Explainable Donor-Patient Matching in Liver Transplantation
Felicidad Aguado, Pedro Cabalar, Jorge Fandinno +3
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 pol…
Revisiting Explicit Negation in Answer Set Programming
Felicidad Aguado, Pedro Cabalar, Jorge Fandinno +3
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. This explici…
Founded (Auto)Epistemic Equilibrium Logic Satisfies Epistemic Splitting
Jorge Fandinno
In a recent line of research, two familiar concepts from logic programming semantics (unfounded sets and splitting) were extrapolated to the case of epistemic logic programs. The p…
Dynamic Epistemic Logic with ASP Updates: Application to Conditional Planning
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. In this logic, the agent's knowledge…
Founded World Views with Autoepistemic Equilibrium Logic
Pedro Cabalar, Jorge Fandinno, Luis Fariñas
Defined by Gelfond in 1991 (G91), epistemic specifications (or programs) are an extension of logic programming under stable models semantics that introducessubjective literals. A s…