Workshop on Satisfiability

Certosa di Pontignano
Universita Degli Studi Di Siena
Siena, Italy
April 28 - May 3, 1996

Abstracts

T. J. Park and A. VanGelder.

Partitioning Methods for Satisfiability Testing on Large Formulas.

T. Eiter, T. Ibaraki, K. Makino.

On the Satisfiability of Partially Defined Double and Bidual Horn Functions.

R. Battiti, and M. Protasi.

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

Hans van Maaren.

Discriminative Properties of the Smooth Convex Quadratic Approximation

of a 3-SAT Problem.

Ingo Schiermeyer.

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

A. Van Gelder, and F. Kamiya.

Lemma and Cut Strategies for Two-Sided Propositional Resolution.

P.Nobili, and A. Sassano.

Strengthening Lagrangian Bounds for the MAX-SAT Problem.