Editorial Policies

Focus and Scope

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.

 

Section Policies

Articles

To be or not to be

Editors
  • John Franco
Unchecked Open Submissions Checked Indexed Checked Peer Reviewed

Addendum

Editors
  • John Franco
Checked Open Submissions Checked Indexed Unchecked Peer Reviewed

Special Issue on SAT 2014 Competitions and Evaluations

Editors
  • John Franco
  • Marijn Heule
  • Matti Jarvisalo
  • Daniel LeBerre
Checked Open Submissions Checked Indexed Checked Peer Reviewed

System Descriptions

JSAT is accepting contributions that focus on System Descriptions.

These contributions describe the internals of a SAT- (or MAXSAT-, QBF-, SMT-, ...) Solver. Such contributions are limited to six pages.

Papers in the system-description category are expected to describe a working, possibly useful, publicly available system that may be a solver or a related tool. Authors of the systems that enter an international competition recognized by the scientific community are especially invited to submit a system-description paper describing their system. In this case the usual criteria for a JSAT paper are relaxed. Accuracy, completeness and clarity of the description are the primary reviewing criteria. Relevant citations predating the work are expected. 

Editors
  • Daniel LeBerre
Checked Open Submissions Checked Indexed Checked Peer Reviewed

Quantified Boolean Formulas, theory and practice

Editors
  • Hans Kleine Büning
Checked Open Submissions Checked Indexed Checked Peer Reviewed

Satisfiability Modulo Theories, theoretical aspects

Editors
  • Roberto Sebastiani
Checked Open Submissions Checked Indexed Checked Peer Reviewed

Satisfiability Modulo Theories, algorithmic aspects

Editors
  • Alessandro Cimatti
Checked Open Submissions Checked Indexed Checked Peer Reviewed

SAT, theoretical aspects

Editors
  • Stefan Szeider
Checked Open Submissions Checked Indexed Checked Peer Reviewed

SAT, algorithmic aspects

Editors
  • Oliver Kullmann
Checked Open Submissions Checked Indexed Checked Peer Reviewed

Applications of SAT

Editors
  • Toby Walsh
Checked Open Submissions Checked Indexed Checked Peer Reviewed

MAX SAT and MUS Extraction

Editors
  • Faheim Bacchus
Checked Open Submissions Checked Indexed Checked Peer Reviewed

Encoding and Reformulation

Editors
  • Joao Marques-Silva
Checked Open Submissions Checked Indexed Checked Peer Reviewed

Parallel SAT Solvers

Editors
  • Enrico Giunchiglia
Checked Open Submissions Checked Indexed Checked Peer Reviewed

Research Notes

Editors
  • Faheim Bacchus
  • Alessandro Cimatti
  • John Franco
  • Enrico Giunchiglia
  • Hans Kleine Büning
  • Oliver Kullmann
  • Daniel LeBerre
  • Joao Marques-Silva
  • Roberto Sebastiani
  • Stefan Szeider
  • Toby Walsh
Unchecked Open Submissions Checked Indexed Checked Peer Reviewed

Special Issue on Parallel SAT Solving

Editors
  • Enrico Giunchiglia
Unchecked Open Submissions Checked Indexed Checked Peer Reviewed

Special Issue on SAT/CP Integration

Editors
  • John Franco
Unchecked Open Submissions Checked Indexed Checked Peer Reviewed

Special Issue on Satisfiability Modulo Theories

Editors
  • Roberto Sebastiani
Unchecked Open Submissions Checked Indexed Checked Peer Reviewed

Special Issue on the 2007 Competitions

Editors
  • Daniel LeBerre
Unchecked Open Submissions Checked Indexed Checked Peer Reviewed

Formal Verification

Editors
  • Ofer Strichman
Checked Open Submissions Checked Indexed Checked Peer Reviewed

Proof Complexity

Editors
  • Olaf Beyersdorff
Checked Open Submissions Checked Indexed Checked Peer Reviewed

Tester - do not submit here

Reserved for testing - anything posted here will be ignored

Editors
  • John Franco
  • Marijn Heule
  • John Schlipf
Checked Open Submissions Checked Indexed Checked Peer Reviewed

SAT Filters

Editors
  • John Franco
  • Sean Weaver
Unchecked Open Submissions Checked Indexed Checked Peer Reviewed
 

Peer Review Process

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.

 

Open Access Policy

This journal provides immediate open access to its content on the principle that making research freely available to the public supports a greater global exchange of knowledge.

 

Archiving

This journal utilizes the LOCKSS system to create a distributed archiving system among participating libraries and permits those libraries to create permanent archives of the journal for purposes of preservation and restoration. More...

 

Metadata Harvesting and Indexing

This site uses Open Journal Systems software which adheres to the Open Archives Initiative Protocol for Metadata Harvesting.  This protocol is the emerging standard for providing well-indexed access to electronic research resources on a global scale. The authors use a compatible template to provide metadata for their submission. The Journal Manager has selected the following categories for indexing.


Computer Science; Satisfiability, Satisfiability Modulo Theories; ATP; Propositional Logic


Library of Congress Classification
http://www.loc.gov/catdir/lcco


Satisfiability; SMT, ATP; Propositional Logic; SAT; formal methods.

 

Installed OAI Metadata Plugins

The following plugins are installed to support OAI communication:

NLM Metadata Format
Structures metadata in a way that is consistent with the NLM Journal Article format.

DC Metadata Format
Structures metadata in a way that is consistent with the Dublin Core format.

RFC1807 Metadata Format
Structures metadata in a way that is consistent with the RFC1807 format.

MARC21 Metadata Format
Structures metadata in a way that is consistent with the MARC21 format.

MARC Metadata Format
Structures metadata in a way that is consistent with the MARC format.

 

Digital Object Identifiers

The Open Journal System that is used by JSAT enables the assignment of Digital Object Identifiers to issues, articles, galleys and supplementary files in JSAT.

 

Area Editors

Daniel Le Berre   System Descriptions
Roberto Sebastiani   Satisfiability Modulo Theories, theoretical aspects
Alessandro Cimatti   Satisfiability Modulo Theories, practical aspects   
Hans Kleine Buening   Quantified Boolean Formulas, theory and practice
Stefan Szeider   SAT, theoretical aspects
Oliver Kullmann   SAT, algorithmic aspects
Toby Walsh   Applications of SAT
Faheim Bacchus   MaxSAT and MUS extraction
Joao Marques-Silva   Encoding and reformulation
Enrico Giunchiglia   Parallel SAT solvers
Olaf Beyersdorff Proof Complexity
Ofer Strichman Formal Verification