2 citations · 3 across the 3 of their papers we have counts for
3 papers
cs.LO2025
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…
cs.LO2025★ 1 cited
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…
cs.LO2022★ 2 cited
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…