Upper and Lower Bounds on the Complexity of Generalised Resolution and Generalised Constraint Satisfaction Problems

  • Authors:

  • Oliver Kullmann

  • Affiliations:

  • Computer Science Department, University of Wales Swansea, Swansea, SA2 8PP, UK E-mail: o.kullmann@swansea.ac.uk

  • Venue:
  • Annals of Mathematics and Artificial Intelligence
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

Capturing propositional logic, constraint satisfaction problems and systems of polynomial equations, we introduce the notion of systems with finite instantiation by partial assignments, fipa-systems for short, which are independent of special representations of problem instances, but which are based on an axiomatic approach with instantiation (or substitution) by partial assignments as the fundamental notion. Fipa-systems seem to constitute the most general framework allowing for a theory of resolution with nontrivial upper and lower bounds. For every fipa-system we generalise relativised hierarchies originating from generalised Horn formulas [14,26,33,43], and obtain hierarchies of problem instances with recognition and satisfiability decision in polynomial time and linear space, quasi-automatising relativised and generalised tree resolution and utilising a general “quasi-tight” lower bound for tree resolution. And generalising width-restricted resolution from [7,14,25,33], for every fipa-system a (stronger) family of hierarchies of unsatisfiable instances with polynomial time recognition is introduced, weakly automatising relativised and generalised full resolution and utilising a general lower bound for full resolution generalising [7,17,25,33].