30 citations · 102 across the 34 of their papers we have counts for
40 papers
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…
Deductive Systems for Logic Programs with Counting
Jorge Fandinno, Vladimir Lifschitz
In answer set programming, two groups of rules are considered strongly equivalent if they have the same meaning in any context. Strong equivalence of two programs can be sometimes…
Anthem 2.0: Automated Reasoning for Answer Set Programming
Jorge Fandinno, Christoph Glinzer, Zachary Hansen +5
Anthem 2.0 is a tool to aid in the verification of logic programs written in an expressive fragment of Clingo's input language named mini-gringo, which includes arithmetic operatio…
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…
External Behavior of a Logic Program and Verification of Refactoring
Jorge Fandinno, Zachary Hansen, Yuliya Lierler +2
Refactoring is modifying a program without changing its external behavior. In this paper, we make the concept of external behavior precise for a simple answer set programming langu…
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…
Verification of Locally Tight Programs
Jorge Fandinno, Vladimir Lifschitz, Nathan Temple
Program completion is a translation from the language of logic programs into the language of first-order theories. Its original definition has been extended to programs that includ…
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…
Modular Answer Set Programming as a Formal Specification Language
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) l…
eclingo: A solver for Epistemic Logic Programs
Pedro Cabalar, Jorge Fandinno, Javier Garea +2
We describe eclingo, a solver for epistemic logic programs under Gelfond 1991 semantics built upon the Answer Set Programming system clingo. The input language of eclingo uses the…
Verifying Tight Logic Programs with anthem and Vampire
Jorge Fandinno, Vladimir Lifschitz, Patrick Lühne +1
This paper continues the line of research aimed at investigating the relationship between logic programs and first-order theories. We extend the definition of program completion to…
Treewidth-Aware Complexity in ASP: Not all Positive Cycles are Equally Hard
Markus Hecher, Jorge Fandinno
It is well-know that deciding consistency for normal answer set programs (ASP) is NP-complete, thus, as hard as the satisfaction problem for classical propositional logic (SAT). Th…
A Uniform Treatment of Aggregates and Constraints in Hybrid ASP
Pedro Cabalar, Jorge Fandinno, Torsten Schaub +1
Characterizing hybrid ASP solving in a generic way is difficult since one needs to abstract from specific theories. Inspired by lazy SMT solving, this is usually addressed by treat…