Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/jsat/BailleuxBR06,
  author       = {Olivier Bailleux and
                  Yacine Boufkhad and
                  Olivier Roussel},
  title        = {A Translation of Pseudo Boolean Constraints to {SAT}},
  journal      = {J. Satisf. Boolean Model. Comput.},
  volume       = {2},
  number       = {1-4},
  pages        = {191--200},
  year         = {2006},
  url          = {https://doi.org/10.3233/sat190021},
  doi          = {10.3233/SAT190021},
  timestamp    = {Mon, 17 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jsat/BailleuxBR06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jsat/BerreS06,
  author       = {Daniel Le Berre and
                  Laurent Simon},
  title        = {Preface to the Special Volume on the {SAT} 2005 Competitions and Evaluations},
  journal      = {J. Satisf. Boolean Model. Comput.},
  volume       = {2},
  number       = {1-4},
  year         = {2006},
  url          = {https://doi.org/10.3233/sat190013},
  doi          = {10.3233/SAT190013},
  timestamp    = {Thu, 30 May 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jsat/BerreS06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jsat/BiereS06,
  author       = {Armin Biere and
                  Carsten Sinz},
  title        = {Decomposing {SAT} Problems into Connected Components},
  journal      = {J. Satisf. Boolean Model. Comput.},
  volume       = {2},
  number       = {1-4},
  pages        = {201--208},
  year         = {2006},
  url          = {https://doi.org/10.3233/sat190022},
  doi          = {10.3233/SAT190022},
  timestamp    = {Mon, 17 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jsat/BiereS06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jsat/EenS06,
  author       = {Niklas E{\'{e}}n and
                  Niklas S{\"{o}}rensson},
  title        = {Translating Pseudo-Boolean Constraints into {SAT}},
  journal      = {J. Satisf. Boolean Model. Comput.},
  volume       = {2},
  number       = {1-4},
  pages        = {1--26},
  year         = {2006},
  url          = {https://doi.org/10.3233/sat190014},
  doi          = {10.3233/SAT190014},
  timestamp    = {Mon, 17 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jsat/EenS06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jsat/HaanpaaJKN06,
  author       = {Harri Haanp{\"{a}}{\"{a}} and
                  Matti J{\"{a}}rvisalo and
                  Petteri Kaski and
                  Ilkka Niemel{\"{a}}},
  title        = {Hard Satisfiable Clause Sets for Benchmarking Equivalence Reasoning
                  Techniques},
  journal      = {J. Satisf. Boolean Model. Comput.},
  volume       = {2},
  number       = {1-4},
  pages        = {27--46},
  year         = {2006},
  url          = {https://doi.org/10.3233/sat190015},
  doi          = {10.3233/SAT190015},
  timestamp    = {Mon, 17 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jsat/HaanpaaJKN06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jsat/HeuleM06,
  author       = {Marijn Heule and
                  Hans van Maaren},
  title        = {March{\_}dl: Adding Adaptive Heuristics and a New Branching Strategy},
  journal      = {J. Satisf. Boolean Model. Comput.},
  volume       = {2},
  number       = {1-4},
  pages        = {47--59},
  year         = {2006},
  url          = {https://doi.org/10.3233/sat190016},
  doi          = {10.3233/SAT190016},
  timestamp    = {Fri, 09 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jsat/HeuleM06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jsat/Kullmann06,
  author       = {Oliver Kullmann},
  title        = {The {SAT} 2005 Solver Competition on Random Instances},
  journal      = {J. Satisf. Boolean Model. Comput.},
  volume       = {2},
  number       = {1-4},
  pages        = {61--102},
  year         = {2006},
  url          = {https://doi.org/10.3233/sat190017},
  doi          = {10.3233/SAT190017},
  timestamp    = {Mon, 17 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jsat/Kullmann06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jsat/ManquinhoR06,
  author       = {Vasco M. Manquinho and
                  Olivier Roussel},
  title        = {The First Evaluation of Pseudo-Boolean Solvers (PB'05)},
  journal      = {J. Satisf. Boolean Model. Comput.},
  volume       = {2},
  number       = {1-4},
  pages        = {103--143},
  year         = {2006},
  url          = {https://doi.org/10.3233/sat190018},
  doi          = {10.3233/SAT190018},
  timestamp    = {Mon, 17 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jsat/ManquinhoR06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jsat/ManquinhoS06,
  author       = {Vasco M. Manquinho and
                  Jo{\~{a}}o Marques{-}Silva},
  title        = {On Using Cutting Planes in Pseudo-Boolean Optimization},
  journal      = {J. Satisf. Boolean Model. Comput.},
  volume       = {2},
  number       = {1-4},
  pages        = {209--219},
  year         = {2006},
  url          = {https://doi.org/10.3233/sat190023},
  doi          = {10.3233/SAT190023},
  timestamp    = {Mon, 03 Apr 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jsat/ManquinhoS06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jsat/Markstrom06,
  author       = {Klas Markstr{\"{o}}m},
  title        = {Locality and Hard SAT-Instances},
  journal      = {J. Satisf. Boolean Model. Comput.},
  volume       = {2},
  number       = {1-4},
  pages        = {221--227},
  year         = {2006},
  url          = {https://doi.org/10.3233/sat190024},
  doi          = {10.3233/SAT190024},
  timestamp    = {Mon, 17 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jsat/Markstrom06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jsat/NarizzanoPT06,
  author       = {Massimo Narizzano and
                  Luca Pulina and
                  Armando Tacchella},
  title        = {Report of the Third {QBF} Solvers Evaluation},
  journal      = {J. Satisf. Boolean Model. Comput.},
  volume       = {2},
  number       = {1-4},
  pages        = {145--164},
  year         = {2006},
  url          = {https://doi.org/10.3233/sat190019},
  doi          = {10.3233/SAT190019},
  timestamp    = {Mon, 17 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jsat/NarizzanoPT06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jsat/SheiniS06,
  author       = {Hossein M. Sheini and
                  Karem A. Sakallah},
  title        = {Pueblo: {A} Hybrid Pseudo-Boolean {SAT} Solver},
  journal      = {J. Satisf. Boolean Model. Comput.},
  volume       = {2},
  number       = {1-4},
  pages        = {165--189},
  year         = {2006},
  url          = {https://doi.org/10.3233/sat190020},
  doi          = {10.3233/SAT190020},
  timestamp    = {Mon, 17 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jsat/SheiniS06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jsat/Zarpas06,
  author       = {Emmanuel Zarpas},
  title        = {Back to the {SAT05} Competition: an a Posteriori Analysis of Solver
                  Performance on Industrial Benchmarks},
  journal      = {J. Satisf. Boolean Model. Comput.},
  volume       = {2},
  number       = {1-4},
  pages        = {229--237},
  year         = {2006},
  url          = {https://doi.org/10.3233/sat190025},
  doi          = {10.3233/SAT190025},
  timestamp    = {Mon, 17 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jsat/Zarpas06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

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.