2 citations · 2 across the 5 of their papers we have counts for
7 papers · 1 filter
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…
Propositional satisfiability in declarative programming
Deborah East, Miroslaw Truszczynski
Answer-set programming (ASP) paradigm is a way of using logic to solve search problems. Given a search problem, to solve it one designs a theory in the logic so that models of this…
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…
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…
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…
Computing large and small stable models
Miroslaw Truszczynski
In this paper, we focus on the problem of existence and computing of small and large stable models. We show that for every fixed integer k, there is a linear-time algorithm to deci…