39 citations · 102 across the 28 of their papers we have counts for
28 papers
EZSMT Version 3, Matured
Keeran Dhakal, Yuliya Lierler
Constraint Answer Set Programming (CASP) is a hybrid reasoning paradigm that combines Answer Set Programming (ASP) with Constraint Processing and Satisfiability Modulo Theories (SM…
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…
SM-based Semantics for Answer Set Programs Containing Conditional Literals and Arithmetic
Zachary Hansen, Yuliya Lierler
Modern answer set programming solvers such as CLINGO support advanced language constructs that improve the expressivity and conciseness of logic programs. Conditional literals are…
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…
A Community-driven vision for a new Knowledge Resource for AI
Vinay K Chaudhri, Chaitan Baru, Brandon Bennett +29
The long-standing goal of creating a comprehensive, multi-purpose knowledge resource, reminiscent of the 1984 Cyc project, still persists in AI. Despite the success of knowledge re…
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…