Journal on Satisfiability, Boolean Modeling and Computation
JSAT is an open access peer reviewed journal, publishing high quality original research papers and survey papers which evidently contribute to deeper insight. It is an electronic medium, guaranteeing fast publication.
Scope
The scope of JSAT is propositional reasoning, modeling and computation. It is the central journal of the SAT association which also oversees the organization of the SAT conference and as such mirrors the interests of the conference. JSAT welcomes all sorts of contributions around the general Satisfiability theme but also encourages authors to submit papers on related topics including Computational Logic, Proof Complexity, Constraint Programming, Satisfiability Modulo Theories, Quantified Boolean Logic, Pseudo-Boolean Methods, Integer Programming, and Operations Research, whenever the link to Satisfiability is apparent.
Contributions
The first type of contributions JSAT welcomes consists of substantial extensions of conference papers. The journal format allows authors to refine and add more details to their previously published work (theoretical details, proofs, theorems, algorithmic or implementation details, more exhaustive empirical evaluations). The second type of contributions consists of short or long system descriptions focusing on solvers and other related tools and their evaluation.
Topics
The journal focuses focuses on the theory and applications of propositional satisfiability, broadly construed. That includes Boolean optimization, such as MaxSAT and Pseudo-Boolean (PB) constraints, Quantified Boolean Formulas (QBF), Satisfiability Modulo Theories (SMT), model counting, and Constraint Programming (CP) for problems with clear connections to Boolean-level reasoning. Topics of interest include (but are not limited to):
- Theoretical advances (including algorithms, proof complexity, parameterized complexity, and other complexity issues)
- Practical search algorithms
- Knowledge compilation
- Implementation-level details of SAT solving tools and SAT-based systems
- Problem encodings and reformulations
- Applications (including both novel applications domains and improvements to existing approaches)
- Case studies and reports on insightful findings based on rigorous experimentation
The SAT association, JSAT and the SAT conference
The SAT association supports two main venues to publish work related to SAT: the yearly SAT conference proceedings and this journal.
Both venues have their own merits. The conference proceedings publish work on a strict schedule and strict space constraints. The journal removes most of those limits: submissions are accepted at any time, and there are no space constraints on regular papers.
There are some interactions between those venues: there have been several special issues of the journal dedicated to the competitive events organized around the SAT conference. We expect to tighten those interactions in the future by having a special track during the SAT conference to present recently published papers on JSAT.
Journal content
The content of the journal is currently available on IOS Press digital content library.
- Volume 15 (2024): IOS Press
- Volume 14 (2023): IOS Press
- Volume 13 (2022): IOS Press
- Volume 12 (2020): (IOS Press, local with code and data)
- Volume 11 (2019): Special Volume on SAT 2018 Competitive Events (IOS Press, local with code and data)
- Volume 10 (2016): Covers 2016-2019
- Volume 9 (2014): Includes a Special Issue on SAT 2014 Competitions and Evaluations
- Volume 8 (2012): Covers 2012-2014, issue 1-2, issue 3-4
- Volume 7 (2009): Covers 2009-2011, issue 1, issue 2-3, issue 4 Special Issue on Parallel SAT Solving
- Volume 6 (2008): issue 1-3, issue 4
- Volume 5 (2008): Special Volume on Application of Constraints to Formal Verification
- Volume 4 (2007): issue 1, issue 2-4 Special Issue on the 2007 Competitions
- Volume 3 (2007): issue 1-2 includes a Special Issue on Satisfiability Modulo Theories, issue 3-4
- Volume 2 (2006): Special Volume on the SAT 2005 Competitions and Evaluations
- Volume 1 (2006): issue 1, issue 2, issue 3-4 Special Issue on SAT/CP Integration
One can check on Google scholar which articles are the most cited.
High Impact Articles
Copyright Notice
Since 2020, the articles are published online with Open Access and distributed under the terms of the Creative Commons Attribution Non-Commercial License (CC BY-NC 4.0).
The author(s) agree(s) that the contribution does not contain any material created by others, or from other copyrighted works, unless the written consent of the owner of such material is attached. The corresponding author warrants that s/he has full power to make this agreement, and has not previously granted, assigned, or encumbered any of the rights granted and assigned herein; that the material submitted for publication is the work of the author(s), and is original, unpublished, and not previously the subject of any application for copyright registration (except material for which the SAT Association has written grants of permission to include, as described above).
Board
The JSAT journal is managed by an evolving SAT community. The editorial board is meant to be renewed in part regularly.
Editors in Chief
- Armin Biere, University of Freiburg, Germany
- Marijn Heule, Carnegie Mellon University, United States
Former editors in chief:
- Daniel Le Berre, Artois University/CNRS, France
- John Franco, University of Cincinnati, United States
- Oliver Kullmann, Swansea University, United Kingdom
- (Founder) Hans van Maaren, Delft University of Technology, The Netherlands
Editorial board
The previous editorial board has been announced to be dissolved at business meeting of the SAT association at SAT'25 in Glasgow.
Acknowledgements
We are deeply indebted to Hans van Maaren for founding this journal in 2004.
Imprint
The JSAT journal is under the auspices of the SAT association which also is responsible for the content of this page (imprint, contact).