16 citations · 16 across the 4 of their papers we have counts for
3 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…
Satisfiability and computing van der Waerden numbers
Michael R. Dransfield, Victor W. Marek, Miroslaw Truszczynski
In this paper we bring together the areas of combinatorics and propositional satisfiability. Many combinatorial theorems establish, often constructively, the existence of positive…
Logic programs with monotone cardinality atoms
Victor W. Marek, Ilkka Niemela, Miroslaw Truszczynski
We investigate mca-programs, that is, logic programs with clauses built of monotone cardinality atoms of the form kX, where k is a non-negative integer and X is a finite set of pro…