9 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…
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…
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…
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…