activity
20002023
most citedFages' Theorem and Answer Set Programming

39 citations · 92 across the 15 of their papers we have counts for

collaborators

15 papers

cs.AI2023

Causal Laws and Multi-Valued Fluents

Enrico Giunchiglia, Joohyung Lee, Vladimir Lifschitz +1

This paper continues the line of work on representing properties of actions in nonmonotonic formalisms that stresses the distinction between being "true" and being "caused", as in…

cs.AI2023★ 2 cited

Safe Formulas in the General Theory of Stable Models

Joohyung Lee, Vladimir Lifschitz, Ravi Palla

Safe first-order formulas generalize the concept of a safe rule, which plays an important role in the design of answer set solvers. We show that any safe sentence is equivalent, in…

cs.LO2023★ 1 cited

External Behavior of a Logic Program and Verification of Refactoring

Jorge Fandinno, Zachary Hansen, Yuliya Lierler +2

Refactoring is modifying a program without changing its external behavior. In this paper, we make the concept of external behavior precise for a simple answer set programming langu…

cs.LO2023

On Program Completion, with an Application to the Sum and Product Puzzle

Vladimir Lifschitz

This paper describes a generalization of Clark's completion that is applicable to logic programs containing arithmetic operations and produces syntactically simple, natural looking…

cs.AI2022

Positive Dependency Graphs Revisited

Jorge Fandinno, Vladimir Lifschitz

Theory of stable models is the mathematical basis of answer set programming. Several results in that theory refer to the concept of the positive dependency graph of a logic program…

cs.LO2022

Strong Equivalence of Logic Programs with Counting

Vladimir Lifschitz

In answer set programming, two groups of rules are considered strongly equivalent if they have the same meaning in any context. In some cases, strong equivalence of programs in the…