Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

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

Upper and Lower Bounds on the Complexity of Generalised Resolution and Generalised Constraint... 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]. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Annals of Mathematics and Artificial Intelligence Springer Journals

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

Loading next page...
 
/lp/springer-journals/upper-and-lower-bounds-on-the-complexity-of-generalised-resolution-and-gqDGZoy6la

References (56)

Publisher
Springer Journals
Copyright
Copyright © 2004 by Kluwer Academic Publishers
Subject
Computer Science; Artificial Intelligence (incl. Robotics); Mathematics, general; Computer Science, general; Complex Systems
ISSN
1012-2443
eISSN
1573-7470
DOI
10.1023/B:AMAI.0000012871.08577.0b
Publisher site
See Article on Publisher Site

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].

Journal

Annals of Mathematics and Artificial IntelligenceSpringer Journals

Published: Oct 5, 2004

There are no references for this article.