Complexity Dichotomies for CSP-related Problems
2007 (English)Doctoral thesis, comprehensive summary (Other academic)
Ladner’s theorem states that if P ≠ NP, then there are problems in NP that are neither in P nor NP-complete. Csp(Γ) is a class of problems containing many well-studied combinatorial problems in NP. Csp(Γ) problems are of the form: given a set of variables constrained by a set of constraints from the set of allowed constraints Γ, is there an assignment to the variables satisfying all constraints? A famous, and in the light of Ladner’s theorem, surprising conjecture states that there is a complexity dichotomy for Csp(Γ); that is, for any fixed finite Γ, the Csp(Γ) problem is either in P or NP-complete.
In this thesis we focus on problems expressible in the Csp(Γ) framework with different computational goals, such as: counting the number of solutions, deciding whether two sets of constraints have the same set of solutions, deciding whether all minimal solutions of a set of constraints satisfies an additional constraint etc. By doing so, we capture a host of problems ranging from fundamental problems in nonmonotonic logics, such as abduction and circumscription, to problems regarding the equivalence of systems of linear equations. For several of these classes of problem, we are able to give complete complexity classifications and rule out the possibility of problems of intermediate complexity. For example, we prove that the inference problem in propositional variable circumscription, parameterized by the set of allowed constraints Γ, is either in P, coNP-complete, or ΠP/2-complete. As a by-product of these classifications, new tractable cases and hardness results for well-studied problems are discovered.
The techniques we use to obtain these complexity classifications are to a large extent based on connections between algebraic clone theory and the complexity of Csp(Γ). We are able to extend these powerful algebraic techniques to several of the problems studied in this thesis. Hence, this thesis also contributes to the understanding of when these algebraic techniques are applicable and not.
Place, publisher, year, edition, pages
Institutionen för datavetenskap , 2007. , 36 p.
Linköping Studies in Science and Technology. Dissertations, ISSN 0345-7524 ; 1091
Complexity, Constraint Satisfaction Problem, System of Equations, Nonmonotonic Logic, Circumscription, Abduction, Isomorphism
IdentifiersURN: urn:nbn:se:liu:diva-8822ISBN: 978–91–85715–20–6OAI: oai:DiVA.org:liu-8822DiVA: diva2:23528
2007-06-01, Visionen, Hus B, Campus Valla, Linköping University, Linköping, 13:15 (English)
Jonsson, Peter, Professor
List of papers