30 citations · 102 across the 34 of their papers we have counts for
16 papers · 1 filter
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…
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…
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…
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…
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…
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…
Deriving Conclusions From Non-Monotonic Cause-Effect Relations
Jorge Fandinno
We present an extension of Logic Programming (under stable models semantics) that, not only allows concluding whether a true atom is a cause of another atom, but also deriving new…
Justifications for Programs with Disjunctive and Causal-choice Rules
Pedro Cabalar, Jorge Fandinno
In this paper, we study an extension of the stable model semantics for disjunctive logic programs where each true atom in a model is associated with an algebraic expression (in ter…
Enablers and Inhibitors in Causal Justifications of Logic Programs
Pedro Cabalar, Jorge Fandinno
To appear in Theory and Practice of Logic Programming (TPLP). In this paper we propose an extension of logic programming (LP) where each default literal derived from the well-found…