3 citations · 7 across the 9 of their papers we have counts for
Showing cs.LOShow all
3 papers · 1 filter
cs.LO2002
Computing stable models: worst-case performance estimates
Zbigniew Lonc, Miroslaw Truszczynski
We study algorithms for computing stable models of propositional logic programs and derive estimates on their worst-case performance that are asymptotically better than the trivial…
cs.LO2001
Fixed-parameter complexity of semantics for logic programs
Zbigniew Lonc, Miroslaw Truszczynski
A decision problem is called parameterized if its input is a pair of strings. One of these strings is referred to as a parameter. The problem: given a propositional logic program P…
cs.LO2001
On the problem of computing the well-founded semantics
Zbigniew Lonc, Miroslaw Truszczynski
The well-founded semantics is one of the most widely studied and used semantics of logic programs with negation. In the case of finite propositional programs, it can be computed in…