30 citations · 102 across the 34 of their papers we have counts for
24 papers · 1 filter
Bound-Founded Semantics for Answer Set Programming with Difference Constraints: Preliminary Report
Pedro Cabalar, Jorge Fandinno, Nicolas Rühling +3
While the integration of linear constraints has significantly expanded the reach of Answer Set Programming (ASP), existing hybrid solvers often rely on disparate semantic underpinn…
Parametric Modular Answer Set Programs Made Declarative
Jorge Fandinno, Yuliya Lierler, Torsten Schaub
In this paper, we explore the concept of modularity in first-order answer set programming (ASP). We introduce a new formalism called parametric modular logic programs, which allows…
FLINGO -- Instilling ASP Expressiveness into Linear Integer Constraints
Jorge Fandinno, Pedro Cabalar, Philipp Wanko +1
Constraint Answer Set Programming (CASP) is a hybrid paradigm that enriches Answer Set Programming (ASP) with numerical constraint processing, a crucial requirement for many real-w…
Splitting Answer Set Programs with respect to Intensionality Statements (Extended Version)
Jorge Fandinno, Yuliya Lierler
Splitting a logic program allows us to reduce the task of computing its stable models to similar tasks for its subprograms. This can be used to increase solving performance and pro…
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…
Recursive Aggregates as Intensional Functions in Answer Set Programming: Semantics and Strong Equivalence
Jorge Fandinno, Zachary Hansen
This paper shows that the semantics of programs with aggregates implemented by the solvers clingo and dlv can be characterized as extended First-Order formulas with intensional fun…
Solving Epistemic Logic Programs using Generate-and-Test with Propagation
Jorge Fandinno, Lute Lillo
This paper introduces a general framework for generate-and-test-based solvers for epistemic logic programs that can be instantiated with different generator and tester programs, an…
Embracing Background Knowledge in the Analysis of Actual Causality: An Answer Set Programming Approach
Michael Gelfond, Jorge Fandinno, Evgenii Balai
This paper presents a rich knowledge representation language aimed at formalizing causal knowledge. This language is used for accurately and directly formalizing common benchmark e…
Positive Dependency Graphs Revisited
Jorge Fandinno, Vladimir Lifschitz
Theory of stable models is the mathematical basis of answer set programming. Several results in that theory refer to the concept of the positive dependency graph of a logic program…
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…
Answer Set Programming Made Easy
Jorge Fandinno, Seemran Mishra, Javier Romero +1
We take up an idea from the folklore of Answer Set Programming, namely that choices, integrity constraints along with a restricted rule format is sufficient for Answer Set Programm…
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…
An ASP semantics for Constraints involving Conditional Aggregates
Pedro Cabalar, Jorge Fandinno, Torsten Schaub +1
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 vari…
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…
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…
Splitting Epistemic Logic Programs
Pedro Cabalar, Jorge Fandinno, Luis Fariñas del Cerro
Epistemic logic programs constitute an extension of the stable models semantics to deal with new constructs called subjective literals. Informally speaking, a subjective literal al…
Proceedings of the eleventh Workshop on Answer Set Programming and Other Computing Paradigms 2018
Jorge Fandinno, Johannes Fichte
This is the Proceedings of the eleventh Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP) 2018, which was held in Oxford, UK, July 18th, 2018.
Answering the "why" in Answer Set Programming - A Survey of Explanation Approaches
Jorge Fandinno, Claudia Schulz
Artificial Intelligence (AI) approaches to problem-solving and decision-making are becoming more and more complex, leading to a decrease in the understandability of solutions. The…
Functional ASP with Intensional Sets: Application to Gelfond-Zhang Aggregates
Pedro Cabalar, Jorge Fandinno, Luis Fariñas del Cerro +1
In this paper, we propose a variant of Answer Set Programming (ASP) with evaluable functions that extends their application to sets of objects, something that allows a fully logica…
An Algebra of Causal Chains
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…