Ausgabe 1-3/2005
Inhalt (12 Artikel)
Heuristic-Based Backtracking Relaxation for Propositional Satisfiability
Ateet Bhalla, Inês Lynce, José T. de Sousa, João Marques-Silva
Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas
Michael Alekhnovich, Edward A. Hirsch, Dmitry Itsykson
Solving Non-Boolean Satisfiability Problems with Stochastic Local Search: A Comparison of Encodings
Alan M. Frisch, Timothy J. Peugniez, Anthony J. Doggett, Peter W. Nightingale
Regular Random k-SAT: Properties of Balanced Formulas
Yacine Boufkhad, Olivier Dubois, Yannet Interian, Bart Selman
The SAT-based Approach to Separation Logic
Alessandro Armando, Claudio Castellini, Enrico Giunchiglia, Marco Maratea
MathSAT: Tight Integration of SAT and Mathematical Decision Procedures
Marco Bozzano, Roberto Bruttomesso, Alessandro Cimatti, Tommi Junttila, Peter van Rossum, Stephan Schulz, Roberto Sebastiani