23 citations · 44 across the 24 of their papers we have counts for
7 papers · 1 filter
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…