Journal on Satisfiability, Boolean Modeling and Computation
ISSN: 1574-0617
Volume 8-9; 8 issues
Institutional subscription (print and online) for 2011: €541 / US$750 (including postage and handling)
Click on the subscribe button for more options, including personal subscription prices.
Status Report: Last issue (Volume 7:1) published September 2010
Next issue (Volume 7:2) scheduled for June 2011

Aims and Scope
Editorial Board
Submission of Manuscripts
Abstracted in
Download flyer for this journal

Journal Website
Hans Van Maaren
Delft University of Technology
Faculty of Electrical Engineering
Mathematics and Computer Science
Department of Software Technology
Mekelweg 4
2628 CD Delft
The Netherlands

Associate Editors
John Franco
Department of Electrical Engineering
Computer Engineering and Computer Science
University of Cincinnati
Cincinnati, OH 45221-0030

Roberto Sebastiani
Department of Information and Communication Technologies
University of Trento
Via Sommarive 14
Povo I-38050 Trento

Oliver Kullmann
Computer Science Department
University of Wales Swansea
Singleton Park, Faraday Building
Swansea, Wales SA2 8PP
United Kingdom

Editorial Board
Dimitris Achlioptas, University of California at Santa Cruz, Santa Cruz, CA, USA Chu Min Li, University of Picardie Jules Verne, Amiens, France
Fahiem Bacchus, University of Toronto, Toronto, ON, Canada Sharad Malik, Princeton University Princeton, NJ, USA
Armin Biere, Johannes Kepler University, Linz, Austria Joao Marques-Silva, University of Southampton, Southampton, United Kingdom
Endre Boros, Rutgers University, Piscataway, NJ, USA David Mitchell, Simon Fraser University, Burnaby, BC, Canada
Edmund Clarke, Carnegie Mellon University, Pittsburgh, PA, USA Remi Monasson, Ens Laboratory of Theoretical Physics, Paris, France
Nadia Creignou, Mediterranian University, Marseille, France Steve Prestwich, University College Cork, Ireland
Olivier Dubois, University of Paris 6, Paris, France Daniele Pretolani, University of Modena and Reggio Emilia, Modena, Italy
John Franco, University of Cincinnati, Cincinnati, OH, USA Paul Purdom, Indiana University, Bloomington, IN, USA
Nicola Galesi, 'La Sapienza' University Rome, Italy Karem Sakallah, University of Michigan, Ann Arbor, MI, USA
Enrico Giunchiglia, University of Genoa, Genoa, Italy Uwe Schöning, Ulm University, Ulm, Germany
Andreas Goerdt, Technical University of Chemnitz, Chemnitz, Germany Roberto Sebastiani, Universiy of Trento, Povo, Italy
Carla Gomes, Cornell University, Ithica, NY, USA Bart Selman, Cornell University, Ithaca, NY, USA
Edward A. Hirsch, Steklov Institute of Mathematics at St. Petersburg, St. Petersburg, Russia Laurent Simon, Paris South University, Orsay, France
Holger H. Hoos, University of British Columbia, Vancouver, BC, Canada Ewald Speckenmeyer, University of Cologne, Cologne, Germany
Kazuo Iwama, Kyoto University, Kyoto, Japan Allen Van Gelder, University of California at Santa Cruz, Santa Cruz, CA, USA
Henry Kautz, University of Washington, Seattle, WA, USA Hans Van Maaren, Delft University of Technology, Delft, The Netherlands
Lefteris Kirousis, University of Patras, Patras, Greece Miroslav Velev, Aries Design Automation, Chicago, IL, USA
Hans Kleine Büning, University of Paderborn, Paderborn, Germany Hantao Zhang, University of Iowa, Iowa City, IA, USA
Oliver Kullmann, University of Wales, Swansea, United Kingdom Xishun Zhao, Sun Yat-Sen University Guangzhou, Guangzhou, China
Daniel Le Berre, Artois University, Arras, France 

Submission of Manuscripts 
See instructions to authors.
Aims and Scope 
The Journal on Satisfiability, Boolean Modeling and Computation (JSAT) is a peer reviewed international journal, publishing high quality, original research papers and survey papers, which evidently contribute to deeper insight.

The scope of JSAT is propositional reasoning, modeling and computation. The Satisfiability discipline is a central focus of JSAT. JSAT welcomes all sorts of contributions to this theme but also encourages authors to submit papers on related topics as Computational Logic, Constraint Programming, Satisfiability Modulo Theories, Quantified Boolean Logic, Pseudo Boolean Methods, zero-one Programming, Integer Programming and Operations Research, whenever the link to Satisfiability is apparent.
Abstracted in
MathSciNet, Zentralblatt MATH

IOS Press
Nieuwe Hemweg 6B, 1013 BG Amsterdam, The Netherlands
Tel.: +31 20 688 3355, Fax: +31 20 687 0019