16 citations · 16 across the 4 of their papers we have counts for
4 papers · 1 filter
On the Expressibility of Stable Logic Programming
Victor W. Marek, Jeffrey B. Remmel
(We apologize for pidgin LaTeX) Schlipf \cite{sch91} proved that Stable Logic Programming (SLP) solves all decision problems. We extend Schlipf's result to prove that…
Ultimate approximations in nonmonotonic knowledge representation systems
Marc Denecker, Victor W. Marek, Miroslaw Truszczynski
We study fixpoints of operators on lattices. To this end we introduce the notion of an approximation of an operator. We order approximations by means of a precision ordering. We sh…
Annotated revision programs
Victor Marek, Inna Pivkina, Miroslaw Truszczynski
Revision programming is a formalism to describe and enforce updates of belief sets and databases. That formalism was extended by Fitting who assigned annotations to revision atoms.…
Uniform semantic treatment of default and autoepistemic logics
Marc Denecker, Victor W. Marek, Miroslaw Truszczynski
We revisit the issue of connections between two leading formalisms in nonmonotonic reasoning: autoepistemic logic and default logic. For each logic we develop a comprehensive seman…