141 citations · 303 across the 30 of their papers we have counts for
10 papers · 1 filter
A Measure of Arbitrariness in Abductive Explanations
Luciano Caroprese, Irina Trubitsyna, Miroslaw Truszczynski +1
We study the framework of abductive logic programming extended with integrity constraints. For this framework, we introduce a new measure of the simplicity of an explanation based…
Strong Equivalence of Qualitative Optimization Problems
Wolfgang Faber, Mirosław Truszczyński, Stefan Woltran
We introduce the framework of qualitative optimization problems (or, simply, optimization problems) to represent preference theories. The formalism uses separate modules to describ…
Trichotomy and Dichotomy Results on the Complexity of Reasoning with Disjunctive Logic Programs
Miroslaw Truszczynski
We present trichotomy results characterizing the complexity of reasoning with disjunctive logic programs. To this end, we introduce a certain definition schema for classes of progr…
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…