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 publishes papers on System Descriptions, 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 in cooperation with IOS Press and the SAT Association.
We are deeply indebted to Hans van Maaren for founding this journal in 2005. We look forward to achieving his vision of establishing JSAT as the premiere voice and communication medium for the extremely active and diverse SAT-related communities.
This site uses metadata harvesting provided by the Public Knowledge Project (PKP). PKP's Open Harvester System (OHS), which is used here, is a free metadata indexing system that was developed through federally funded efforts to expand and improve access to research. OHS supports a searchable index of the metadata from Open Archives Initiative (OAI)-compliant archives.
Harvesting is an automated, regular process of collecting metadata descriptions from different sources to create useful aggregations of metadata and related services that are used, for example, by the Directory of Open Access Journals.
Vol 10 (2016)
Table of Contents
|Hard satisfiable 3-SAT instances via autocorrelation|
|Srinivasan Arunachalam, Ilias Kotsireas||11-22|
|On Exponential Lower Bounds for Partially Ordered Resolution|
|On Linear Resolution|
|Sam Buss, Jan Johannsen||23-35|