Search dblp for Publications

export results for "toc:db/journals/jsat/jsat1.bht:"

 download as .bib file

@article{DBLP:journals/jsat/FranzleHTRS07,
  author       = {Martin Fr{\"{a}}nzle and
                  Christian Herde and
                  Tino Teige and
                  Stefan Ratschan and
                  Tobias Schubert},
  title        = {Efficient Solving of Large Non-linear Arithmetic Constraint Systems
                  with Complex Boolean Structure},
  journal      = {J. Satisf. Boolean Model. Comput.},
  volume       = {1},
  number       = {3-4},
  pages        = {209--236},
  year         = {2007},
  url          = {https://doi.org/10.3233/sat190012},
  doi          = {10.3233/SAT190012},
  timestamp    = {Mon, 17 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jsat/FranzleHTRS07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jsat/HamadiB07,
  author       = {Youssef Hamadi and
                  Lucas Bordeaux},
  title        = {Preface to Special Issue on {SAT/CP} Integration},
  journal      = {J. Satisf. Boolean Model. Comput.},
  volume       = {1},
  number       = {3-4},
  year         = {2007},
  url          = {https://doi.org/10.3233/sat190008},
  doi          = {10.3233/SAT190008},
  timestamp    = {Mon, 17 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jsat/HamadiB07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jsat/LahiriM07,
  author       = {Shuvendu K. Lahiri and
                  Krishna K. Mehra},
  title        = {Interpolant based Decision Procedure for Quantifier-Free Presburger
                  Arithmetic},
  journal      = {J. Satisf. Boolean Model. Comput.},
  volume       = {1},
  number       = {3-4},
  pages        = {187--207},
  year         = {2007},
  url          = {https://doi.org/10.3233/sat190011},
  doi          = {10.3233/SAT190011},
  timestamp    = {Mon, 17 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jsat/LahiriM07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jsat/LecoutreSTV07,
  author       = {Christophe Lecoutre and
                  Lakhdar Sais and
                  S{\'{e}}bastien Tabary and
                  Vincent Vidal},
  title        = {Recording and Minimizing Nogoods from Restarts},
  journal      = {J. Satisf. Boolean Model. Comput.},
  volume       = {1},
  number       = {3-4},
  pages        = {147--167},
  year         = {2007},
  url          = {https://doi.org/10.3233/sat190009},
  doi          = {10.3233/SAT190009},
  timestamp    = {Mon, 17 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jsat/LecoutreSTV07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jsat/LecoutreSV07,
  author       = {Christophe Lecoutre and
                  Lakhdar Sais and
                  Julien Vion},
  title        = {Using {SAT} Encodings to Drive {CSP} Value Ordering Heuristics},
  journal      = {J. Satisf. Boolean Model. Comput.},
  volume       = {1},
  number       = {3-4},
  pages        = {169--186},
  year         = {2007},
  url          = {https://doi.org/10.3233/sat190010},
  doi          = {10.3233/SAT190010},
  timestamp    = {Mon, 17 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jsat/LecoutreSV07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jsat/Anjos06,
  author       = {Miguel F. Anjos},
  title        = {Semidefinite Optimization Approaches for Satisfiability and Maximum-Satisfiability
                  Problems},
  journal      = {J. Satisf. Boolean Model. Comput.},
  volume       = {1},
  number       = {1},
  pages        = {1--47},
  year         = {2006},
  url          = {https://doi.org/10.3233/sat190001},
  doi          = {10.3233/SAT190001},
  timestamp    = {Mon, 17 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jsat/Anjos06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jsat/Coste-MarquisBLM06,
  author       = {Sylvie Coste{-}Marquis and
                  Daniel Le Berre and
                  Florian Letombe and
                  Pierre Marquis},
  title        = {Complexity Results for Quantified Boolean Formulae Based on Complete
                  Propositional Languages},
  journal      = {J. Satisf. Boolean Model. Comput.},
  volume       = {1},
  number       = {1},
  pages        = {61--88},
  year         = {2006},
  url          = {https://doi.org/10.3233/sat190003},
  doi          = {10.3233/SAT190003},
  timestamp    = {Mon, 17 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jsat/Coste-MarquisBLM06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jsat/DantsinW06,
  author       = {Evgeny Dantsin and
                  Alexander Wolpert},
  title        = {A Faster Clause-Shortening Algorithm for {SAT} with No Restriction
                  on Clause Length},
  journal      = {J. Satisf. Boolean Model. Comput.},
  volume       = {1},
  number       = {1},
  pages        = {49--60},
  year         = {2006},
  url          = {https://doi.org/10.3233/sat190002},
  doi          = {10.3233/SAT190002},
  timestamp    = {Mon, 17 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jsat/DantsinW06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jsat/Kutzkov06,
  author       = {Konstantin Kutzkov},
  title        = {A Note on the Use of Independent Sets for the k-SAT Problem},
  journal      = {J. Satisf. Boolean Model. Comput.},
  volume       = {1},
  number       = {2},
  pages        = {143--145},
  year         = {2006},
  url          = {https://doi.org/10.3233/sat190007},
  doi          = {10.3233/SAT190007},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jsat/Kutzkov06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jsat/Lozinskii06,
  author       = {Eliezer L. Lozinskii},
  title        = {Impurity: Another Phase Transition of {SAT}},
  journal      = {J. Satisf. Boolean Model. Comput.},
  volume       = {1},
  number       = {2},
  pages        = {123--141},
  year         = {2006},
  url          = {https://doi.org/10.3233/sat190006},
  doi          = {10.3233/SAT190006},
  timestamp    = {Mon, 17 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jsat/Lozinskii06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jsat/Rolf06,
  author       = {Daniel Rolf},
  title        = {Improved Bound for the PPSZ/Sch{\"{o}}ning-Algorithm for 3-SAT},
  journal      = {J. Satisf. Boolean Model. Comput.},
  volume       = {1},
  number       = {2},
  pages        = {111--122},
  year         = {2006},
  url          = {https://doi.org/10.3233/sat190005},
  doi          = {10.3233/SAT190005},
  timestamp    = {Mon, 17 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jsat/Rolf06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jsat/WeaverFS06,
  author       = {Sean A. Weaver and
                  John V. Franco and
                  John S. Schlipf},
  title        = {Extending Existential Quantification in Conjunctions of BDDs},
  journal      = {J. Satisf. Boolean Model. Comput.},
  volume       = {1},
  number       = {2},
  pages        = {89--110},
  year         = {2006},
  url          = {https://doi.org/10.3233/sat190004},
  doi          = {10.3233/SAT190004},
  timestamp    = {Mon, 17 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jsat/WeaverFS06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.