Conference Paper

A Combinatorial Characterization of ResolutionWidth.

Univ. Politecnica de Catalunya, Barcelona, Spain;
Conference: 18th Annual IEEE Conference on Computational Complexity (Complexity 2003), 7-10 July 2003, Aarhus, Denmark
Source: DBLP

ABSTRACT Abstract We provide a characterization of the resolution width introduced in the context of propositional proof complexity in terms of the existential pebble game introduced in the context of finite model theory. The characterization is tight and purely combinatorial. Our first application of this result is a surprising proof that the minimum,space of refuting a 3-CNF formula is always bounded,from below by the minimum width of refuting it (minus 3). This solves a well-known open problem. The second application is the unification of several width lower bound arguments, and a new width lower bound for the dense linear order principle. Since we also show that this principle has resolution refutations of polynomial size, this provides yet another example showing that the relationship between size and width cannot be made subpolynomial.

  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: The article is a broad survey of the field of propositional proof complexity, based upon the author’s Ph.D. thesis. It starts with the Cook-Reckhow definition and Frege systems. Next the connection of resolution to satisfiability algorithms such as DLL is explained, and the relationship of the bounded arithmetic IΔ 0 (R) to constant-depth Frege is mentioned. The author gives a thorough list of proof systems below Frege (such as Res(k), constant-depth Frege, polynomial calculus, Lovász-Schrijver), including a discussion of tree-like and dag-like proofs, and a summary of known lower and upper bounds on proofs of variants of the weak pigeonhole principle and random 3-CNFs in these systems. The paper further mentions feasible interpolation, automatizability, and lower bounds for SAT algorithms on satisfiable formulas. It also discusses strong proof systems, like quantified Frege, and the question of the existence of optimal proof systems. The second part of the paper focuses on some lower bound techniques, including proofs of the main results. The first one is the Ben Sasson-Wigderson theorem relating proof size and proof width of resolution, which is then applied to show exponential resolution lower bounds for PHP n cn , and random k-CNFs. The second one is the small restriction switching lemma due to the author, S. Buss, and R. Impagliazzo, which gives Reslogn/loglogn lower bounds for PHP n cn . Next, the small restriction switching lemma is combined with the so-called expansion clean-up procedure to obtain a Reslogn/loglogn lower bound for random 3-CNFs due to M. Alekhnovich. Finally, Razborov’s pseudowidth is introduced, which is used to prove resolution lower bounds for PHP n m with large m. The author concludes with some open problems.
    Bulletin of Symbolic Logic 12/2007; 13(4). · 0.92 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: We study algorithms for ♯SAT♯SAT and its generalized version ♯GENSAT♯GENSAT, the problem of computing the number of satisfying assignments of a set of propositional clauses ΣΣ. For this purpose we consider the clauses given by their incidence graph, a signed bipartite graph SI(Σ)SI(Σ), and its derived graphs I(Σ)I(Σ) and P(Σ)P(Σ).It is well known, that, given a graph of tree-width k, a k-tree decomposition can be found in polynomial time. Very recently Oum and Seymour have shown that, given a graph of clique-width k, a (23k+2-1)(23k+2-1)-parse tree witnessing clique-width can be found in polynomial time.In this paper we present an algorithm for ♯GENSAT♯GENSAT for formulas of bounded tree-width k which runs in time 4k(n+n2·log2(n))4k(n+n2·log2(n)), where n is the size of the input. The main ingredient of the algorithm is a splitting formula for the number of satisfying assignments for a set of clauses ΣΣ where the incidence graph I(Σ)I(Σ) is a union of two graphs G1G1 and G2G2 with a shared induced subgraph H of size at most k. We also present analogue improvements for algorithms for formulas of bounded clique-width which are given together with their derivation.This considerably improves results for ♯SAT♯SAT, and hence also for SAT, previously obtained by Courcelle et al. [On the fixed parameter complexity of graph enumeration problems definable in monadic second order logic, Discrete Appl. Math. 108 (1–2) (2001) 23–52].
    Discrete Applied Mathematics 02/2008; 156(4):511–529. · 0.68 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: This project approaches the study, theoretical development, implementation, and em- pirical validation of formal concepts and the criteria for its use in the construction of predictive and descriptive models for symbolic sequences. In particular we will study the following model types: compression mechanisms (flnite- state compressors and Lempel-Ziv algorithms), generalizations of graphs (probabilistic extensions, decision trees, integration of decision trees with Markov hidden models), gram- matical models (such as categorial grammars), time series, study of subsequences (discov- ery of episodes, frequent sets and association rules; learning of patterns of behaviour). The empirical validation of models will be done through great amounts of real data: university students, oncological data from the Hospital Cl¶‡nico Universitario, biological sequences, climatology data.

Full-text (2 Sources)

Available from
Dec 11, 2014