23 citations · 88 across the 36 of their papers we have counts for
3 papers · 2 filters
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…
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…