2 citations · 2 across the 5 of their papers we have counts for
4 papers · 1 filter
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…
aspps --- an implementation of answer-set programming with propositional schemata
Deborah East. Miroslaw Truszczynski
We present an implementation of an answer-set programming paradigm, called aspps (short for answer-set programming with propositional schemata). The system aspps is designed to pro…
Propositional satisfiability in answer-set programming
Deborah East, Miroslaw Truszczynski
We show that propositional logic and its extensions can support answer-set programming in the same way stable logic programming and disjunctive logic programming do. To this end, w…
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…