default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "stream:journals/jsat:"
download as .bib file
@article{DBLP:journals/jsat/BeyersdorffCDM24,
author = {Olaf Beyersdorff and
Judith Clymo and
Stefan S. Dantchev and
Barnaby Martin},
title = {The Riis Complexity Gap for {QBF} Resolution},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {15},
number = {1},
pages = {9--25},
year = {2024},
url = {https://doi.org/10.3233/sat-231505},
doi = {10.3233/SAT-231505},
timestamp = {Tue, 26 Nov 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jsat/BeyersdorffCDM24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/BeyersdorffHS24,
author = {Olaf Beyersdorff and
Tim Hoffmann and
Luc Nicolas Spachmann},
title = {Proof Complexity of Propositional Model Counting},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {15},
number = {1},
pages = {27--59},
year = {2024},
url = {https://doi.org/10.3233/sat-231507},
doi = {10.3233/SAT-231507},
timestamp = {Tue, 26 Nov 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jsat/BeyersdorffHS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/Nadel24,
author = {Alexander Nadel},
title = {TT-Open-WBO-Inc: An Efficient Anytime MaxSAT Solver},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {15},
number = {1},
pages = {1--7},
year = {2024},
url = {https://doi.org/10.3233/sat-231504},
doi = {10.3233/SAT-231504},
timestamp = {Tue, 26 Nov 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jsat/Nadel24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/DantsinW23,
author = {Evgeny Dantsin and
Alexander Wolpert},
title = {An Isomorphism-Invariant Distance Function on Propositional Formulas
in {CNF}},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {14},
number = {1},
pages = {1--15},
year = {2023},
url = {https://doi.org/10.3233/sat-220006},
doi = {10.3233/SAT-220006},
timestamp = {Tue, 24 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jsat/DantsinW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/Leofante23,
author = {Francesco Leofante},
title = {OMTPlan: {A} Tool for Optimal Planning Modulo Theories},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {14},
number = {1},
pages = {17--23},
year = {2023},
url = {https://doi.org/10.3233/sat-220001},
doi = {10.3233/SAT-220001},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/Leofante23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/Mengel22,
author = {Stefan Mengel},
title = {No Efficient Disjunction or Conjunction of Switch-Lists},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {13},
number = {1},
pages = {1--4},
year = {2022},
url = {https://doi.org/10.3233/sat-220002},
doi = {10.3233/SAT-220002},
timestamp = {Thu, 12 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/Mengel22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/Johannsen20,
author = {Jan Johannsen},
title = {Backdoors into Two Occurrences},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {12},
number = {1},
pages = {1--15},
year = {2020},
url = {https://doi.org/10.3233/sat-200125},
doi = {10.3233/SAT-200125},
timestamp = {Mon, 06 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/Johannsen20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/Nadel20,
author = {Alexander Nadel},
title = {Polarity and Variable Selection Heuristics for SAT-Based Anytime MaxSAT},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {12},
number = {1},
pages = {17--22},
year = {2020},
url = {https://doi.org/10.3233/sat-200126},
doi = {10.3233/SAT-200126},
timestamp = {Wed, 11 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jsat/Nadel20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/BacchusJM19,
author = {Fahiem Bacchus and
Matti J{\"{a}}rvisalo and
Ruben Martins},
title = {MaxSAT Evaluation 2018: New Developments and Detailed Results},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {11},
number = {1},
pages = {99--131},
year = {2019},
url = {https://doi.org/10.3233/SAT190119},
doi = {10.3233/SAT190119},
timestamp = {Wed, 26 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jsat/BacchusJM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/HeuleJS19,
author = {Marijn J. H. Heule and
Matti J{\"{a}}rvisalo and
Martin Suda},
title = {{SAT} Competition 2018},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {11},
number = {1},
pages = {133--154},
year = {2019},
url = {https://doi.org/10.3233/SAT190120},
doi = {10.3233/SAT190120},
timestamp = {Mon, 30 Mar 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/HeuleJS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/IgnatievMM19,
author = {Alexey Ignatiev and
Ant{\'{o}}nio Morgado and
Jo{\~{a}}o Marques{-}Silva},
title = {{RC2:} an Efficient MaxSAT Solver},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {11},
number = {1},
pages = {53--64},
year = {2019},
url = {https://doi.org/10.3233/SAT190116},
doi = {10.3233/SAT190116},
timestamp = {Wed, 08 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jsat/IgnatievMM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/JoshiKRM19,
author = {Saurabh Joshi and
Prateek Kumar and
Sukrut Rao and
Ruben Martins},
title = {Open-WBO-Inc: Approximation Strategies for Incomplete Weighted MaxSAT},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {11},
number = {1},
pages = {73--97},
year = {2019},
url = {https://doi.org/10.3233/SAT190118},
doi = {10.3233/SAT190118},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jsat/JoshiKRM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/Klieber19,
author = {William Klieber},
title = {GhostQ},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {11},
number = {1},
pages = {65--72},
year = {2019},
url = {https://doi.org/10.3233/SAT190117},
doi = {10.3233/SAT190117},
timestamp = {Wed, 26 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jsat/Klieber19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/Lonsing19,
author = {Florian Lonsing},
title = {QBFRelay, QRATPre+, and DepQBF: Incremental Preprocessing Meets Search-Based
{QBF} Solving},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {11},
number = {1},
pages = {211--220},
year = {2019},
url = {https://doi.org/10.3233/SAT190122},
doi = {10.3233/SAT190122},
timestamp = {Wed, 26 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jsat/Lonsing19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/PeitlSS19,
author = {Tom{\'{a}}s Peitl and
Friedrich Slivovsky and
Stefan Szeider},
title = {Qute in the {QBF} Evaluation 2018},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {11},
number = {1},
pages = {261--272},
year = {2019},
url = {https://doi.org/10.3233/SAT190124},
doi = {10.3233/SAT190124},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jsat/PeitlSS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/PulinaS19,
author = {Luca Pulina and
Martina Seidl},
title = {Notes from the Guest Editors},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {11},
number = {1},
pages = {1},
year = {2019},
url = {https://doi.org/10.3233/SAT190114},
doi = {10.3233/SAT190114},
timestamp = {Wed, 26 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jsat/PulinaS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/Tentrup19,
author = {Leander Tentrup},
title = {{CAQE} and QuAbS: Abstraction Based {QBF} Solvers},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {11},
number = {1},
pages = {155--210},
year = {2019},
url = {https://doi.org/10.3233/SAT190121},
doi = {10.3233/SAT190121},
timestamp = {Wed, 26 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jsat/Tentrup19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/WeberCDHNR19,
author = {Tjark Weber and
Sylvain Conchon and
David D{\'{e}}harbe and
Matthias Heizmann and
Aina Niemetz and
Giles Reger},
title = {The {SMT} Competition 2015-2018},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {11},
number = {1},
pages = {221--259},
year = {2019},
url = {https://doi.org/10.3233/SAT190123},
doi = {10.3233/SAT190123},
timestamp = {Wed, 26 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jsat/WeberCDHNR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/WimmerSB19,
author = {Ralf Wimmer and
Christoph Scholl and
Bernd Becker},
title = {The {(D)QBF} Preprocessor HQSpre - Underlying Theory and Its Implementation},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {11},
number = {1},
pages = {3--52},
year = {2019},
url = {https://doi.org/10.3233/SAT190115},
doi = {10.3233/SAT190115},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jsat/WimmerSB19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/ArunachalamK16,
author = {Srinivasan Arunachalam and
Ilias S. Kotsireas},
title = {Hard satisfiable 3-SAT instances via autocorrelation},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {10},
number = {1},
pages = {11--22},
year = {2016},
url = {https://doi.org/10.3233/sat190111},
doi = {10.3233/SAT190111},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/ArunachalamK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/BussJ16,
author = {Sam Buss and
Jan Johannsen},
title = {On Linear Resolution},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {10},
number = {1},
pages = {23--35},
year = {2016},
url = {https://doi.org/10.3233/sat190112},
doi = {10.3233/SAT190112},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/BussJ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/Janota16,
author = {Mikolas Janota},
title = {On Exponential Lower Bounds for Partially Ordered Resolution},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {10},
number = {1},
pages = {1--9},
year = {2016},
url = {https://doi.org/10.3233/sat190110},
doi = {10.3233/SAT190110},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/Janota16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/ScharpfeneckerT16,
author = {Patrick Scharpfenecker and
Jacobo Tor{\'{a}}n},
title = {Solution-Graphs of Boolean Formulas and Isomorphism},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {10},
number = {1},
pages = {37--58},
year = {2016},
url = {https://doi.org/10.3233/sat190113},
doi = {10.3233/SAT190113},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/ScharpfeneckerT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/AbrameH14,
author = {Andr{\'{e}} Abram{\'{e}} and
Djamal Habet},
title = {Ahmaxsat: Description and Evaluation of a Branch and Bound Max-SAT
Solver},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {9},
number = {1},
pages = {89--128},
year = {2014},
url = {https://doi.org/10.3233/sat190104},
doi = {10.3233/SAT190104},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/AbrameH14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/BerreR14,
author = {Daniel Le Berre and
St{\'{e}}phanie Roussel},
title = {Sat4j 2.3.2: on the fly solver configuration System Description},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {8},
number = {3/4},
pages = {197--202},
year = {2014},
url = {https://doi.org/10.3233/sat190098},
doi = {10.3233/SAT190098},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/BerreR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/CabodiLPPPQVBH14,
author = {Gianpiero Cabodi and
Carmelo Loiacono and
Marco Palena and
Paolo Pasini and
Denis Patti and
Stefano Quer and
Danilo Vendraminetto and
Armin Biere and
Keijo Heljanko},
title = {Hardware Model Checking Competition 2014: An Analysis and Comparison
of Solvers and Benchmarks},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {9},
number = {1},
pages = {135--172},
year = {2014},
url = {https://doi.org/10.3233/sat190106},
doi = {10.3233/SAT190106},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/CabodiLPPPQVBH14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/CokDW14,
author = {David R. Cok and
David D{\'{e}}harbe and
Tjark Weber},
title = {The 2014 {SMT} Competition},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {9},
number = {1},
pages = {207--242},
year = {2014},
url = {https://doi.org/10.3233/sat190109},
doi = {10.3233/SAT190109},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/CokDW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/Janota14,
author = {Mikolas Janota},
title = {MiFuMax - a Literate MaxSAT Solver},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {9},
number = {1},
pages = {83--88},
year = {2014},
url = {https://doi.org/10.3233/sat190103},
doi = {10.3233/SAT190103},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/Janota14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/JanotaJKLSG14,
author = {Mikolas Janota and
Charles Jordan and
Will Klieber and
Florian Lonsing and
Martina Seidl and
Allen Van Gelder},
title = {The QBFGallery 2014: The {QBF} Competition at the FLoC Olympic Games},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {9},
number = {1},
pages = {187--206},
year = {2014},
url = {https://doi.org/10.3233/sat190108},
doi = {10.3233/SAT190108},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/JanotaJKLSG14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/KrzakalaMZ14,
author = {Florent Krzakala and
Marc M{\'{e}}zard and
Lenka Zdeborov{\'{a}}},
title = {Reweighted Belief Propagation and Quiet Planting for Random {K-SAT}},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {8},
number = {3/4},
pages = {149--171},
year = {2014},
url = {https://doi.org/10.3233/sat190096},
doi = {10.3233/SAT190096},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jsat/KrzakalaMZ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/LafitteNH14,
author = {Fr{\'{e}}d{\'{e}}ric Lafitte and
Jorge Nakahara Jr. and
Dirk Van Heule},
title = {Applications of {SAT} Solvers in Cryptanalysis: Finding Weak Keys
and Preimages},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {9},
number = {1},
pages = {1--25},
year = {2014},
url = {https://doi.org/10.3233/sat190099},
doi = {10.3233/SAT190099},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/LafitteNH14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/Martins0ML14,
author = {Ruben Martins and
Saurabh Joshi and
Vasco Manquinho and
In{\^{e}}s Lynce},
title = {On Using Incremental Encodings in Unsatisfiability-based MaxSAT Solving},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {9},
number = {1},
pages = {59--81},
year = {2014},
url = {https://doi.org/10.3233/sat190102},
doi = {10.3233/SAT190102},
timestamp = {Tue, 17 Sep 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/Martins0ML14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/MorgadoIM14,
author = {Ant{\'{o}}nio Morgado and
Alexey Ignatiev and
Jo{\~{a}}o Marques{-}Silva},
title = {{MSCG:} Robust Core-Guided MaxSAT Solving},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {9},
number = {1},
pages = {129--134},
year = {2014},
url = {https://doi.org/10.3233/sat190105},
doi = {10.3233/SAT190105},
timestamp = {Wed, 08 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jsat/MorgadoIM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/NadelRS14,
author = {Alexander Nadel and
Vadim Ryvchin and
Ofer Strichman},
title = {Accelerated Deletion-based Extraction of Minimal Unsatisfiable Cores},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {9},
number = {1},
pages = {27--51},
year = {2014},
url = {https://doi.org/10.3233/sat190100},
doi = {10.3233/SAT190100},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/NadelRS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/NiemetzPB14,
author = {Aina Niemetz and
Mathias Preiner and
Armin Biere},
title = {Boolector 2.0},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {9},
number = {1},
pages = {53--58},
year = {2014},
url = {https://doi.org/10.3233/sat190101},
doi = {10.3233/SAT190101},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/NiemetzPB14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/Schwerdtfeger14,
author = {Konrad W. Schwerdtfeger},
title = {A Computational Trichotomy for Connectivity of Boolean Satisfiability},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {8},
number = {3/4},
pages = {173--195},
year = {2014},
url = {https://doi.org/10.3233/sat190097},
doi = {10.3233/SAT190097},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/Schwerdtfeger14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/SighireanuC14,
author = {Mihaela Sighireanu and
David R. Cok},
title = {Report on {SL-COMP} 2014},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {9},
number = {1},
pages = {173--186},
year = {2014},
url = {https://doi.org/10.3233/sat190107},
doi = {10.3233/SAT190107},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/SighireanuC14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/WeaverRMMW14,
author = {Sean A. Weaver and
Katrina J. Ray and
Victor W. Marek and
Andrew J. Mayer and
Alden Walker},
title = {Satisfiability-based Set Membership Filters},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {8},
number = {3/4},
pages = {129--148},
year = {2014},
url = {https://doi.org/10.3233/sat190095},
doi = {10.3233/SAT190095},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/WeaverRMMW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/AlbertiGPRR12,
author = {Francesco Alberti and
Silvio Ghilardi and
Elena Pagani and
Silvio Ranise and
Gian Paolo Rossi},
title = {Universal Guards, Relativization of Quantifiers, and Failure Models
in Model Checking Modulo Theories},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {8},
number = {1/2},
pages = {29--61},
year = {2012},
url = {https://doi.org/10.3233/sat190087},
doi = {10.3233/SAT190087},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jsat/AlbertiGPRR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/BelovM12,
author = {Anton Belov and
Jo{\~{a}}o Marques{-}Silva},
title = {MUSer2: An Efficient {MUS} Extractor},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {8},
number = {3/4},
pages = {123--128},
year = {2012},
url = {https://doi.org/10.3233/sat190094},
doi = {10.3233/SAT190094},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/BelovM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/BubeckB12,
author = {Uwe Bubeck and
Hans Kleine{ }B{\"{u}}ning},
title = {Encoding Nested Boolean Functions as Quantified Boolean Formulas},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {8},
number = {1/2},
pages = {101--116},
year = {2012},
url = {https://doi.org/10.3233/sat190092},
doi = {10.3233/SAT190092},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/BubeckB12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/ChenM12,
author = {Huan Chen and
Jo{\~{a}}o Marques{-}Silva},
title = {TG-Pro: {A} SAT-based {ATPG} System},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {8},
number = {1/2},
pages = {83--88},
year = {2012},
url = {https://doi.org/10.3233/sat190089},
doi = {10.3233/SAT190089},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/ChenM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/Gelder12,
author = {Allen Van Gelder},
title = {Contrasat - {A} Contrarian {SAT} Solver},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {8},
number = {3/4},
pages = {117--122},
year = {2012},
url = {https://doi.org/10.3233/sat190093},
doi = {10.3233/SAT190093},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/Gelder12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/Griggio12,
author = {Alberto Griggio},
title = {A Practical Approach to Satisability Modulo Linear Integer Arithmetic},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {8},
number = {1/2},
pages = {1--27},
year = {2012},
url = {https://doi.org/10.3233/sat190086},
doi = {10.3233/SAT190086},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/Griggio12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/JanotaLMM12,
author = {Mikol{\'{a}}s Janota and
In{\^{e}}s Lynce and
Vasco Manquinho and
Jo{\~{a}}o Marques{-}Silva},
title = {PackUp: Tools for Package Upgradability Solving},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {8},
number = {1/2},
pages = {89--94},
year = {2012},
url = {https://doi.org/10.3233/sat190090},
doi = {10.3233/SAT190090},
timestamp = {Tue, 17 Sep 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/JanotaLMM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/KoshimuraZFH12,
author = {Miyuki Koshimura and
Tong Zhang and
Hiroshi Fujita and
Ryuzo Hasegawa},
title = {QMaxSAT: {A} Partial Max-SAT Solver},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {8},
number = {1/2},
pages = {95--100},
year = {2012},
url = {https://doi.org/10.3233/sat190091},
doi = {10.3233/SAT190091},
timestamp = {Thu, 18 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jsat/KoshimuraZFH12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/Wild12,
author = {Marcel Wild},
title = {Compactly Generating All Satisfying Truth Assignments of a Horn Formula},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {8},
number = {1/2},
pages = {63--82},
year = {2012},
url = {https://doi.org/10.3233/sat190088},
doi = {10.3233/SAT190088},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/Wild12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/Bjork11,
author = {Magnus Bj{\"{o}}rk},
title = {Successful {SAT} Encoding Techniques},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {7},
number = {4},
pages = {189--201},
year = {2011},
url = {https://doi.org/10.3233/sat190085},
doi = {10.3233/SAT190085},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/Bjork11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/HamadiJPS11,
author = {Youssef Hamadi and
Sa{\"{\i}}d Jabbour and
C{\'{e}}dric Piette and
Lakhdar Sais},
title = {Deterministic Parallel {DPLL}},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {7},
number = {4},
pages = {127--132},
year = {2011},
url = {https://doi.org/10.3233/sat190081},
doi = {10.3233/SAT190081},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/HamadiJPS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/HaynalH11,
author = {Steve Haynal and
Heidi Haynal},
title = {Generating and Searching Families of {FFT} Algorithms},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {7},
number = {4},
pages = {145--187},
year = {2011},
url = {https://doi.org/10.3233/sat190084},
doi = {10.3233/SAT190084},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/HaynalH11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/Roussel11,
author = {Olivier Roussel},
title = {Controlling a Solver Execution with the runsolver Tool},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {7},
number = {4},
pages = {139--144},
year = {2011},
url = {https://doi.org/10.3233/sat190083},
doi = {10.3233/SAT190083},
timestamp = {Sun, 06 Oct 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/Roussel11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/TakRH11,
author = {Peter van der Tak and
Antonio Ramos and
Marijn Heule},
title = {Reusing the Assignment Trail in {CDCL} Solvers},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {7},
number = {4},
pages = {133--138},
year = {2011},
url = {https://doi.org/10.3233/sat190082},
doi = {10.3233/SAT190082},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/TakRH11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/BalintGKR10,
author = {Adrian Balint and
Daniel Gall and
Gregor Kapler and
Robert Retz},
title = {Experiment design and administration for computer clusters for SAT-solvers
{(EDACC)}},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {7},
number = {2-3},
pages = {77--82},
year = {2010},
url = {https://doi.org/10.3233/sat190078},
doi = {10.3233/SAT190078},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/BalintGKR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/BerreP10,
author = {Daniel Le Berre and
Anne Parrain},
title = {The Sat4j library, release 2.2},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {7},
number = {2-3},
pages = {59--6},
year = {2010},
url = {https://doi.org/10.3233/sat190075},
doi = {10.3233/SAT190075},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/BerreP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/GiunchigliaMN10,
author = {Enrico Giunchiglia and
Paolo Marin and
Massimo Narizzano},
title = {QuBE7.0},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {7},
number = {2-3},
pages = {83--88},
year = {2010},
url = {https://doi.org/10.3233/sat190079},
doi = {10.3233/SAT190079},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/GiunchigliaMN10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/HerasB10,
author = {Federico Heras and
David Ba{\~{n}}eres},
title = {The Impact of Max-SAT Resolution-Based Preprocessors on Local Search
Solvers},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {7},
number = {2-3},
pages = {89--126},
year = {2010},
url = {https://doi.org/10.3233/sat190080},
doi = {10.3233/SAT190080},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/HerasB10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/JinZ10,
author = {Jiwei Jin and
Xishun Zhao},
title = {Resolution on Quantified Generalized Clause-sets.},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {7},
number = {1},
pages = {17--34},
year = {2010},
url = {https://doi.org/10.3233/sat190073},
doi = {10.3233/SAT190073},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/JinZ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/LangloisST10,
author = {Marina Langlois and
Robert H. Sloan and
Gy{\"{o}}rgy Tur{\'{a}}n},
title = {Horn Upper Bounds and Renaming},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {7},
number = {1},
pages = {1--15},
year = {2010},
url = {https://doi.org/10.3233/sat190072},
doi = {10.3233/SAT190072},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/LangloisST10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/LonsingB10,
author = {Florian Lonsing and
Armin Biere},
title = {DepQBF: {A} Dependency-Aware {QBF} Solver},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {7},
number = {2-3},
pages = {71--76},
year = {2010},
url = {https://doi.org/10.3233/sat190077},
doi = {10.3233/SAT190077},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/LonsingB10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/PulinaT10,
author = {Luca Pulina and
Armando Tacchella},
title = {AQME'10},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {7},
number = {2-3},
pages = {65--70},
year = {2010},
url = {https://doi.org/10.3233/sat190076},
doi = {10.3233/SAT190076},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/PulinaT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/TveretinaSZ10,
author = {Olga Tveretina and
Carsten Sinz and
Hans Zantema},
title = {Ordered Binary Decision Diagrams, Pigeonhole Formulas and Beyond},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {7},
number = {1},
pages = {35--58},
year = {2010},
url = {https://doi.org/10.3233/sat190074},
doi = {10.3233/SAT190074},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/TveretinaSZ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/BrummayerB09,
author = {Robert Brummayer and
Armin Biere},
title = {Lemmas on Demand for the Extensional Theory of Arrays},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {6},
number = {1-3},
pages = {165--201},
year = {2009},
url = {https://doi.org/10.3233/sat190067},
doi = {10.3233/SAT190067},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/BrummayerB09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/BuchheimR09,
author = {Christoph Buchheim and
Giovanni Rinaldi},
title = {Terse Integer Linear Programs for Boolean Optimization},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {6},
number = {1-3},
pages = {121--139},
year = {2009},
url = {https://doi.org/10.3233/sat190065},
doi = {10.3233/SAT190065},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/BuchheimR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/ChuHS09,
author = {Geoffrey Chu and
Aaron Harwood and
Peter J. Stuckey},
title = {Cache Conscious Data Structures for Boolean Satisfiability Solvers},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {6},
number = {1-3},
pages = {99--120},
year = {2009},
url = {https://doi.org/10.3233/sat190064},
doi = {10.3233/SAT190064},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/ChuHS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/GershmanS09,
author = {Roman Gershman and
Ofer Strichman},
title = {HaifaSat: a {SAT} solver based on an Abstraction/Refinement model},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {6},
number = {1-3},
pages = {33--51},
year = {2009},
url = {https://doi.org/10.3233/sat190061},
doi = {10.3233/SAT190061},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/GershmanS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/GilFS09,
author = {Lu{\'{\i}}s Gil and
Paulo F. Flores and
Lu{\'{\i}}s Miguel Silveira},
title = {PMSat: a parallel version of MiniSAT},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {6},
number = {1-3},
pages = {71--98},
year = {2009},
url = {https://doi.org/10.3233/sat190063},
doi = {10.3233/SAT190063},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/GilFS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/Hamadi09,
author = {Youssef Hamadi},
title = {Conclusion to the Special Issue on Parallel {SAT} Solving},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {6},
number = {4},
pages = {263},
year = {2009},
url = {https://doi.org/10.3233/sat190071},
doi = {10.3233/SAT190071},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/Hamadi09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/HamadiJS09,
author = {Youssef Hamadi and
Sa{\"{\i}}d Jabbour and
Lakhdar Sais},
title = {ManySAT: a Parallel {SAT} Solver},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {6},
number = {4},
pages = {245--262},
year = {2009},
url = {https://doi.org/10.3233/sat190070},
doi = {10.3233/SAT190070},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/HamadiJS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/HausTW09,
author = {Utz{-}Uwe Haus and
Klaus Truemper and
Robert Weismantel},
title = {Linear Satisfiability Algorithm for 3CNF Formulas of Certain Signaling
Networks},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {6},
number = {1-3},
pages = {13--32},
year = {2009},
url = {https://doi.org/10.3233/sat190060},
doi = {10.3233/SAT190060},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/HausTW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/HertelU09,
author = {Alexander Hertel and
Alasdair Urquhart},
title = {Algorithms and Complexity Results for Input and Unit Resolution},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {6},
number = {1-3},
pages = {141--164},
year = {2009},
url = {https://doi.org/10.3233/sat190066},
doi = {10.3233/SAT190066},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/HertelU09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/HirschKKN09,
author = {Edward A. Hirsch and
Arist Kojevnikov and
Alexander S. Kulikov and
Sergey I. Nikolenko},
title = {Complexity of Semialgebraic Proofs with Restricted Degree of Falsity},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {6},
number = {1-3},
pages = {53--69},
year = {2009},
url = {https://doi.org/10.3233/sat190062},
doi = {10.3233/SAT190062},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/HirschKKN09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/HyvarinenJN09,
author = {Antti Eero Johannes Hyv{\"{a}}rinen and
Tommi A. Junttila and
Ilkka Niemel{\"{a}}},
title = {Incorporating Clause Learning in Grid-Based Randomized {SAT} Solving},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {6},
number = {4},
pages = {223--244},
year = {2009},
url = {https://doi.org/10.3233/sat190069},
doi = {10.3233/SAT190069},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/HyvarinenJN09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/SchubertLB09,
author = {Tobias Schubert and
Matthew Lewis and
Bernd Becker},
title = {PaMiraXT: Parallel {SAT} Solving with Threads and Message Passing},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {6},
number = {4},
pages = {203--222},
year = {2009},
url = {https://doi.org/10.3233/sat190068},
doi = {10.3233/SAT190068},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/SchubertLB09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/Szeider09,
author = {Stefan Szeider},
title = {Matched Formulas and Backdoor Sets},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {6},
number = {1-3},
pages = {1--12},
year = {2009},
url = {https://doi.org/10.3233/sat190059},
doi = {10.3233/SAT190059},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/Szeider09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/Acharyya08,
author = {Sriyankar Acharyya},
title = {{SAT} Algorithms for Colouring Some Special Classes of Graphs: Some
Theoretical and Experimental Results},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {4},
number = {1},
pages = {33--55},
year = {2008},
url = {https://doi.org/10.3233/sat190037},
doi = {10.3233/SAT190037},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/Acharyya08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/Anjos08,
author = {Miguel F. Anjos},
title = {An Extended Semidefinite Relaxation for Satisfiability},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {4},
number = {1},
pages = {15--31},
year = {2008},
url = {https://doi.org/10.3233/sat190036},
doi = {10.3233/SAT190036},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/Anjos08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/ArgelichLMP08,
author = {Josep Argelich and
Chu Min Li and
Felip Many{\`{a}} and
Jordi Planes},
title = {The First and Second Max-SAT Evaluations},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {4},
number = {2-4},
pages = {251--278},
year = {2008},
url = {https://doi.org/10.3233/sat190047},
doi = {10.3233/SAT190047},
timestamp = {Mon, 21 Oct 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/ArgelichLMP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/BenedettiM08,
author = {Marco Benedetti and
Hratch Mangassarian},
title = {QBF-Based Formal Verification: Experience and Perspectives},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {5},
number = {1-4},
pages = {133--191},
year = {2008},
url = {https://doi.org/10.3233/sat190055},
doi = {10.3233/SAT190055},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/BenedettiM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/Biere08,
author = {Armin Biere},
title = {PicoSAT Essentials},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {4},
number = {2-4},
pages = {75--97},
year = {2008},
url = {https://doi.org/10.3233/sat190039},
doi = {10.3233/SAT190039},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/Biere08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/BrunoGNQ08,
author = {Viviana Bruno and
Luz Amanda Garcia and
Sergio Nocco and
Stefano Quer},
title = {Stressing Symbolic Scheduling Techniques within Aircraft Maintenance
Optimization},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {5},
number = {1-4},
pages = {83--110},
year = {2008},
url = {https://doi.org/10.3233/sat190053},
doi = {10.3233/SAT190053},
timestamp = {Wed, 22 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/BrunoGNQ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/ChebiryakK08,
author = {Yury Chebiryak and
Daniel Kroening},
title = {Towards a Classification of Hamiltonian Cycles in the 6-Cube},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {4},
number = {1},
pages = {57--74},
year = {2008},
url = {https://doi.org/10.3233/sat190038},
doi = {10.3233/SAT190038},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/ChebiryakK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/CodishLS08,
author = {Michael Codish and
Vitaly Lagoon and
Peter J. Stuckey},
title = {Solving Partial Order Constraints for {LPO} Termination},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {5},
number = {1-4},
pages = {193--215},
year = {2008},
url = {https://doi.org/10.3233/sat190056},
doi = {10.3233/SAT190056},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/CodishLS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/EsparzaKS08,
author = {Javier Esparza and
Stefan Kiefer and
Stefan Schwoon},
title = {Abstraction Refinement with Craig Interpolation and Symbolic Pushdown
Systems},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {5},
number = {1-4},
pages = {27--56},
year = {2008},
url = {https://doi.org/10.3233/sat190051},
doi = {10.3233/SAT190051},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/EsparzaKS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/FangH08,
author = {Lei Fang and
Michael S. Hsiao},
title = {Boosting {SAT} Solver Performance via a New Hybrid Approach},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {5},
number = {1-4},
pages = {243--261},
year = {2008},
url = {https://doi.org/10.3233/sat190058},
doi = {10.3233/SAT190058},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/FangH08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/FujitaSS08,
author = {Masahiro Fujita and
Kenshu Seto and
Thanyapat Sakunkonchak},
title = {Dependence Graph Based Verification and Synthesis of Hardware/Software
Co-Designs with {SAT} Related Formulation},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {5},
number = {1-4},
pages = {57--82},
year = {2008},
url = {https://doi.org/10.3233/sat190052},
doi = {10.3233/SAT190052},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/FujitaSS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/Goldberg08,
author = {Eugene Goldberg},
title = {A Resolution Based SAT-solver Operating on Complete Assignments},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {5},
number = {1-4},
pages = {217--242},
year = {2008},
url = {https://doi.org/10.3233/sat190057},
doi = {10.3233/SAT190057},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/Goldberg08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/HerasLGS08,
author = {Federico Heras and
Javier Larrosa and
Simon de Givry and
Thomas Schiex},
title = {2006 and 2007 Max-SAT Evaluations: Contributed Instances},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {4},
number = {2-4},
pages = {239--250},
year = {2008},
url = {https://doi.org/10.3233/sat190046},
doi = {10.3233/SAT190046},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/HerasLGS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/HeuleM08,
author = {Marijn Heule and
Hans van Maaren},
title = {Parallel {SAT} Solving using Bit-level Operations},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {4},
number = {2-4},
pages = {99--116},
year = {2008},
url = {https://doi.org/10.3233/sat190040},
doi = {10.3233/SAT190040},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/HeuleM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/HeuleM08a,
author = {Marijn Heule and
Hans van Maaren},
title = {Whose side are you on? Finding solutions in a biased search-tree},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {4},
number = {2-4},
pages = {117--148},
year = {2008},
url = {https://doi.org/10.3233/sat190041},
doi = {10.3233/SAT190041},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/HeuleM08a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/NoccoQ08,
author = {Sergio Nocco and
Stefano Quer},
title = {A Probabilistic and Approximated Approach to Circuit-Based Formal
Verification},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {5},
number = {1-4},
pages = {111--132},
year = {2008},
url = {https://doi.org/10.3233/sat190054},
doi = {10.3233/SAT190054},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/NoccoQ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/PhamTGS08,
author = {Duc Nghia Pham and
John Thornton and
Charles Gretton and
Abdul Sattar},
title = {Combining Adaptive and Dynamic Local Search for Satisfiability},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {4},
number = {2-4},
pages = {149--172},
year = {2008},
url = {https://doi.org/10.3233/sat190042},
doi = {10.3233/SAT190042},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/PhamTGS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/PipatsrisawatPCCD08,
author = {Knot Pipatsrisawat and
Akop Palyan and
Mark Chavira and
Arthur Choi and
Adnan Darwiche},
title = {Solving Weighted Max-SAT Problems in a Reduced Search Space: {A} Performance
Analysis},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {4},
number = {2-4},
pages = {191--217},
year = {2008},
url = {https://doi.org/10.3233/sat190044},
doi = {10.3233/SAT190044},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/PipatsrisawatPCCD08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/SafarpourVD08,
author = {Sean Safarpour and
Andreas G. Veneris and
Rolf Drechsler},
title = {Improved SAT-based Reachability Analysis with Observability Don't
Cares},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {5},
number = {1-4},
pages = {1--25},
year = {2008},
url = {https://doi.org/10.3233/sat190050},
doi = {10.3233/SAT190050},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/SafarpourVD08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/SpeckenmeyerTML08,
author = {Ewald Speckenmeyer and
Armando Tacchella and
Vasco Manquinho and
Chu Min Li},
title = {Guest Editors Conclusion},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {4},
number = {2-4},
year = {2008},
url = {https://doi.org/10.3233/sat190048},
doi = {10.3233/SAT190048},
timestamp = {Mon, 21 Oct 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/SpeckenmeyerTML08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/Spence08,
author = {Ivor T. A. Spence},
title = {tts: {A} SAT-Solver for Small, Difficult Instances},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {4},
number = {2-4},
pages = {173--190},
year = {2008},
url = {https://doi.org/10.3233/sat190043},
doi = {10.3233/SAT190043},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/Spence08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/Szorenyi08,
author = {Bal{\'{a}}zs Sz{\"{o}}r{\'{e}}nyi},
title = {Disjoint {DNF} Tautologies with Conflict Bound Two},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {4},
number = {1},
pages = {1--14},
year = {2008},
url = {https://doi.org/10.3233/sat190035},
doi = {10.3233/SAT190035},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/Szorenyi08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/Velev08,
author = {Miroslav N. Velev},
title = {Editor's Introduction to the Special Volume on Application of Constraints
to Formal Verification},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {5},
number = {1-4},
year = {2008},
url = {https://doi.org/10.3233/sat190049},
doi = {10.3233/SAT190049},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/Velev08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/WeiLZ08,
author = {Wanxia Wei and
Chu Min Li and
Harry Zhang},
title = {A Switching Criterion for Intensification and Diversification in Local
Search for {SAT}},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {4},
number = {2-4},
pages = {219--237},
year = {2008},
url = {https://doi.org/10.3233/sat190045},
doi = {10.3233/SAT190045},
timestamp = {Mon, 21 Oct 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/WeiLZ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/BarrettST07,
author = {Clark W. Barrett and
Igor Shikanian and
Cesare Tinelli},
title = {An Abstract Decision Procedure for a Theory of Inductive Data Types},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {3},
number = {1-2},
pages = {21--46},
year = {2007},
url = {https://doi.org/10.3233/sat190028},
doi = {10.3233/SAT190028},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/BarrettST07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/BuningZ07,
author = {Hans Kleine{ }B{\"{u}}ning and
Xishun Zhao},
title = {The Complexity of Some Subclasses of Minimal Unsatis able Formulas},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {3},
number = {1-2},
pages = {1--17},
year = {2007},
url = {https://doi.org/10.3233/sat190026},
doi = {10.3233/SAT190026},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/BuningZ07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/BuningZ07a,
author = {Hans Kleine{ }B{\"{u}}ning and
Xishun Zhao},
title = {An Extension of Deficiency and Minimal Unsatisfiability of Quantified
Boolean Formulas},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {3},
number = {3-4},
pages = {115--123},
year = {2007},
url = {https://doi.org/10.3233/sat190032},
doi = {10.3233/SAT190032},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/BuningZ07a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/CookS07,
author = {Byron Cook and
Roberto Sebastiani},
title = {Preface to Special Issue on Satisfiability Modulo Theories},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {3},
number = {1-2},
year = {2007},
url = {https://doi.org/10.3233/sat190027},
doi = {10.3233/SAT190027},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/CookS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@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/GanaiTG07,
author = {Malay K. Ganai and
Muralidhar Talupur and
Aarti Gupta},
title = {{SDSAT:} Tight Integration of Small Domain Encoding and Lazy Approaches
in Solving Difference Logic},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {3},
number = {1-2},
pages = {91--114},
year = {2007},
url = {https://doi.org/10.3233/sat190031},
doi = {10.3233/SAT190031},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/GanaiTG07.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/KimJS07,
author = {Hyondeuk Kim and
HoonSang Jin and
Fabio Somenzi},
title = {Disequality Management in Integer Difference Logic via Finite Instantiations},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {3},
number = {1-2},
pages = {47--66},
year = {2007},
url = {https://doi.org/10.3233/sat190029},
doi = {10.3233/SAT190029},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/KimJS07.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/Sebastiani07,
author = {Roberto Sebastiani},
title = {Lazy Satisability Modulo Theories},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {3},
number = {3-4},
pages = {141--224},
year = {2007},
url = {https://doi.org/10.3233/sat190034},
doi = {10.3233/SAT190034},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/Sebastiani07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/SeshiaSB07,
author = {Sanjit A. Seshia and
K. Subramani and
Randal E. Bryant},
title = {On Solving Boolean Combinations of {UTVPI} Constraints},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {3},
number = {1-2},
pages = {67--90},
year = {2007},
url = {https://doi.org/10.3233/sat190030},
doi = {10.3233/SAT190030},
timestamp = {Fri, 09 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jsat/SeshiaSB07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsat/Vilenchik07,
author = {Dan Vilenchik},
title = {It's All about the Support: {A} New Perspective on the Satisfiability
Problem},
journal = {J. Satisf. Boolean Model. Comput.},
volume = {3},
number = {3-4},
pages = {125--139},
year = {2007},
url = {https://doi.org/10.3233/sat190033},
doi = {10.3233/SAT190033},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsat/Vilenchik07.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/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/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/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/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/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/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/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/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}
}
@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.
retrieved on 2024-12-02 00:11 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
