1 citations · 2 across the 4 of their papers we have counts for
4 papers
Index sets for Finite Normal Predicate Logic Programs
D. Cenzer, V. W. Marek, J. B. Remmel
<Q>_e is the effective list of all finite predicate logic programs. <T_e> is the list of recursive trees. We modify constructions of Marek, Nerode, and Remmel [25] to construct rec…
Expressing Preferences using Preference Set Constraint Atoms
Alex Brik, Jeffrey B. Remmel
This paper introduces an extension of Answer Set Programming called Preference Set Constraint Programming which is a convenient and general formalism to reason with preferences. PS…
An Application of Proof-Theory in Answer Set Programming
V. W. Marek, J. B. Remmel
We apply proof-theoretic techniques in answer Set Programming. The main results include: 1. A characterization of continuity properties of Gelfond-Lifschitz operator for logic prog…
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…