browse preprints edit preprints zaik homepage
logo zaik preprint database choose year | author index | keyword index | msc index | search form 
 


"Workshop on the Satisfiability problem"  
Technical report by John Franco, Giorgio Gallo, Hans Kleine Büning, Ewald Speckenmeyer, Cosimo Spera, available as BibTeX Source.
Informatik, Universität zu Köln
 
Preprint Key: zpr96-230
Keywords: algorithms, combinatorial optimization, complexity logic, data structures, NP-completeness, programming, propositional logic, resolution, satisfiability problem, satisfiability solving
MSC codes: 03Bxx, 68Txx

This technical report was written in 1996, it has not been published.

Abstract:

Reactive Search: A History-Based Heuristic for MAX-SAT

R. Battiti and M. Protasi

Abstract: ps

On Satisfiability of Partially Defined Double and Bidual Horn Functions

T. Eiter, T. Ibaraki and K. Makino

Paper: ps

An Algorithm for the Class of Pure Implicational Formulas

J. Franco, J. Goldsmith, J. Schlipf, E. Speckenmeyer and R. P. Swaminathan

Abstract: ps

Max Horn SAT and Directed Hypergraphs: Algorithmic Enhancements and Easy Cases

G. Gallo, C. Gentile and D. Pretolani

Paper: ps

Lemma and Cut Strategies for Two-Sided Propositional Resolution

A. Van Gelder and F. Kamiya

Paper: ps

Probability of Satisfiability of Random 2-SAT Instances with Quantification

A. Goerdt

Abstract: ps

Complexity Results of Subclasses of the Pure Implicational Calculus

Peter Heusch, M.-A. Lemburg and E. Speckenmeyer

Paper: ps

Closure under Replacements Versus Run Time of Davis-Putnam Algorithms and Distribution of satisfiable Formulas

H. Kleine Büning and T. Lettmann

Paper: ps

Resolution remains Hard under Equivalence

H. Kleine Büning and T. Lettmann

Paper: ps

A Note on a Generalization of Extended Resolution

O. Kullmann

Paper: ps

Elliptic Approximations of Propositional Formulae

H. van Maaren

Paper: ps

Toward an Adequate SAT Algorithm

D. Mitchell and H. Levesque

Abstract: ps

Strengthening Lagrangian Bounds for the MAX-SAT Problem

P. Nobili and A. Sassano

Paper: ps

Probe Order Backtracking

P. Purdom

Abstract: ps

Pure Literal Look Ahead: An O(1,497n) 3-Satisfiability Algorithm

I. Schiermeyer

Paper: ps

The Symmetry Rule in Propositional Logic

A. Urquhart

Paper: ps

Back-Positioning in SAT Searching

J. Wang

Paper: ps

Schedule ps

List of Participants ps

Table of Contents ps