23 citations · 39 across the 11 of their papers we have counts for
22 papers
Strong Equivalence in Answer Set Programming with Constraints
Pedro Cabalar, Jorge Fandinno, Torsten Schaub +1
We investigate the concept of strong equivalence within the extended framework of Answer Set Programming with constraints. Two groups of rules are considered strongly equivalent if…
Abstract argumentation and answer set programming: two faces of Nelson's logic
Jorge Fandinno, Luis Fariñas del Cerro
In this work, we show that both logic programming and abstract argumentation frameworks can be interpreted in terms of Nelson's constructive logic N4. We do so by formalizing, in t…
Planning with Incomplete Information in Quantified Answer Set Programming
Jorge Fandinno, François Laferrière, Javier Romero +2
We present a general approach to planning with incomplete information in Answer Set Programming (ASP). More precisely, we consider the problems of conformant and conditional planni…
Towards a Semantics for Hybrid ASP systems
Pedro Cabalar, Jorge Fandinno, Torsten Schaub +1
Over the last decades the development of ASP has brought about an expressive modeling language powered by highly performant systems. At the same time, it gets more and more difficu…
Thirty years of Epistemic Specifications
Jorge Fandinno, Wolfgang Faber, Michael Gelfond
The language of epistemic specifications and epistemic logic programs extends disjunctive logic programs under the stable model semantics with modal constructs called subjective li…
A System for Explainable Answer Set Programming
Pedro Cabalar, Jorge Fandinno, Brais Muñiz
We present xclingo, a tool for generating explanations from ASP programs annotated with text and labels. These annotations allow tracing the application of rules or the atoms deriv…