JSAT is a 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.
Occasionally JSAT also publishes Research Notes. Research Notes are also thoroughly reviewed but are not considered full Journal publications and hence will be designated and must be referenced to as such. Also, JSAT published papers on System Description, being contributions with a focus on the internals of a Solver.
JSAT contributions are freely accessible on line.
The scope of JSAT is propositional reasoning, modeling and computation. The Satisfiability discipline is a central focus of JSAT. We welcome all sorts of contributions to this theme but also encourage 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.
Especially JSAT welcomes substantial extensions of conference papers, where the actual conference contribution must be cited. As such, authors are able to provide more detailed information about their work (theoretical details, proofs or theorems, algorithmic or implementation details, more exhaustive empirical evaluations) which were enforced to be omittted in the conference proceedings simply because of strict page limitations.
JSAT is published by Delft University in cooperation with IOS Press.
To the benefit of the community JSAT also maintains the sites JSAT Addendum and JSAT Links. Contributions to these sites however are not to be considered as JSAT articles and hence should not be referred to as such.