Search dblp for Publications

export results for "toc:db/journals/amai/amai43.bht:"

 download as .bib file

@article{DBLP:journals/amai/BrglezLS05,
  author       = {Franc Brglez and
                  Xiao Yu Li and
                  Matthias F. M. Stallmann},
  title        = {On {SAT} instance classes and a method for reliable performance experiments
                  with {SAT} solvers},
  journal      = {Ann. Math. Artif. Intell.},
  volume       = {43},
  number       = {1},
  pages        = {1--34},
  year         = {2005},
  url          = {https://doi.org/10.1007/s10472-005-0417-5},
  doi          = {10.1007/S10472-005-0417-5},
  timestamp    = {Mon, 26 Oct 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/amai/BrglezLS05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/amai/Bruni05,
  author       = {Renato Bruni},
  title        = {On exact selection of minimally unsatisfiable subformulae},
  journal      = {Ann. Math. Artif. Intell.},
  volume       = {43},
  number       = {1},
  pages        = {35--50},
  year         = {2005},
  url          = {https://doi.org/10.1007/s10472-005-0418-4},
  doi          = {10.1007/S10472-005-0418-4},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/amai/Bruni05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/amai/BuningX05,
  author       = {Hans Kleine{ }B{\"{u}}ning and
                  Daoyun Xu},
  title        = {The complexity of homomorphisms and renamings for minimal unsatisfiable
                  formulas},
  journal      = {Ann. Math. Artif. Intell.},
  volume       = {43},
  number       = {1},
  pages        = {113--127},
  year         = {2005},
  url          = {https://doi.org/10.1007/s10472-005-0422-8},
  doi          = {10.1007/S10472-005-0422-8},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/amai/BuningX05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/amai/BuningZ05,
  author       = {Hans Kleine{ }B{\"{u}}ning and
                  Xishun Zhao},
  title        = {Extension and equivalence problems for clause minimal formulae},
  journal      = {Ann. Math. Artif. Intell.},
  volume       = {43},
  number       = {1},
  pages        = {295--306},
  year         = {2005},
  url          = {https://doi.org/10.1007/s10472-005-0435-3},
  doi          = {10.1007/S10472-005-0435-3},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/amai/BuningZ05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/amai/ChapdelaineC05,
  author       = {Philippe Chapdelaine and
                  Nadia Creignou},
  title        = {The complexity of Boolean constraint satisfaction local search problems},
  journal      = {Ann. Math. Artif. Intell.},
  volume       = {43},
  number       = {1},
  pages        = {51--63},
  year         = {2005},
  url          = {https://doi.org/10.1007/s10472-005-0419-3},
  doi          = {10.1007/S10472-005-0419-3},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/amai/ChapdelaineC05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/amai/CoccoM05,
  author       = {Simona Cocco and
                  R{\'{e}}mi Monasson},
  title        = {Restarts and exponential acceleration of the Davis-Putnam-Loveland-Logemann
                  algorithm: {A} large deviation analysis of the generalized unit clause
                  heuristic for random 3-SAT},
  journal      = {Ann. Math. Artif. Intell.},
  volume       = {43},
  number       = {1},
  pages        = {153--172},
  year         = {2005},
  url          = {https://doi.org/10.1007/s10472-005-0426-4},
  doi          = {10.1007/S10472-005-0426-4},
  timestamp    = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/amai/CoccoM05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/amai/EglyPW05,
  author       = {Uwe Egly and
                  Reinhard Pichler and
                  Stefan Woltran},
  title        = {On deciding subsumption problems},
  journal      = {Ann. Math. Artif. Intell.},
  volume       = {43},
  number       = {1},
  pages        = {255--294},
  year         = {2005},
  url          = {https://doi.org/10.1007/s10472-005-0434-4},
  doi          = {10.1007/S10472-005-0434-4},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/amai/EglyPW05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/amai/Gelder05,
  author       = {Allen Van Gelder},
  title        = {Toward leaner binary-clause reasoning in a satisfiability solver},
  journal      = {Ann. Math. Artif. Intell.},
  volume       = {43},
  number       = {1},
  pages        = {239--253},
  year         = {2005},
  url          = {https://doi.org/10.1007/s10472-005-0433-5},
  doi          = {10.1007/S10472-005-0433-5},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/amai/Gelder05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/amai/Goldberg05,
  author       = {Eugene Goldberg},
  title        = {Testing satisfiability of {CNF} formulas by computing a stable set
                  of points},
  journal      = {Ann. Math. Artif. Intell.},
  volume       = {43},
  number       = {1},
  pages        = {65--89},
  year         = {2005},
  url          = {https://doi.org/10.1007/s10472-005-0420-x},
  doi          = {10.1007/S10472-005-0420-X},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/amai/Goldberg05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/amai/HirschK05,
  author       = {Edward A. Hirsch and
                  Arist Kojevnikov},
  title        = {UnitWalk: {A} new {SAT} solver that uses local search guided by unit
                  clause elimination},
  journal      = {Ann. Math. Artif. Intell.},
  volume       = {43},
  number       = {1},
  pages        = {91--111},
  year         = {2005},
  url          = {https://doi.org/10.1007/s10472-005-0421-9},
  doi          = {10.1007/S10472-005-0421-9},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/amai/HirschK05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/amai/Kusper05,
  author       = {G{\'{a}}bor Kusper},
  title        = {Solving the resolution-free {SAT} problem by submodel propagation
                  in linear time},
  journal      = {Ann. Math. Artif. Intell.},
  volume       = {43},
  number       = {1},
  pages        = {129--136},
  year         = {2005},
  url          = {https://doi.org/10.1007/s10472-005-0423-7},
  doi          = {10.1007/S10472-005-0423-7},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/amai/Kusper05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/amai/LynceM05,
  author       = {In{\^{e}}s Lynce and
                  Jo{\~{a}}o Marques{-}Silva},
  title        = {Efficient data structures for backtrack search {SAT} solvers},
  journal      = {Ann. Math. Artif. Intell.},
  volume       = {43},
  number       = {1},
  pages        = {137--152},
  year         = {2005},
  url          = {https://doi.org/10.1007/s10472-005-0425-5},
  doi          = {10.1007/S10472-005-0425-5},
  timestamp    = {Mon, 03 Apr 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/amai/LynceM05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/amai/PorschenRS05,
  author       = {Stefan Porschen and
                  Bert Randerath and
                  Ewald Speckenmeyer},
  title        = {Exact 3-satisfiability is decidable in time O(2\({}^{\mbox{0.16254\emph{n}}}\))},
  journal      = {Ann. Math. Artif. Intell.},
  volume       = {43},
  number       = {1},
  pages        = {173--193},
  year         = {2005},
  url          = {https://doi.org/10.1007/s10472-005-0428-2},
  doi          = {10.1007/S10472-005-0428-2},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/amai/PorschenRS05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/amai/PrestwichB05,
  author       = {Steven D. Prestwich and
                  St{\'{e}}phane Bressan},
  title        = {A {SAT} approach to query optimization in mediator systems},
  journal      = {Ann. Math. Artif. Intell.},
  volume       = {43},
  number       = {1},
  pages        = {195--210},
  year         = {2005},
  url          = {https://doi.org/10.1007/s10472-005-0429-1},
  doi          = {10.1007/S10472-005-0429-1},
  timestamp    = {Mon, 07 Feb 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/amai/PrestwichB05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/amai/Pretolani05,
  author       = {Daniele Pretolani},
  title        = {Probability logic and optimization {SAT:} The {PSAT} and {CPA} models},
  journal      = {Ann. Math. Artif. Intell.},
  volume       = {43},
  number       = {1},
  pages        = {211--221},
  year         = {2005},
  url          = {https://doi.org/10.1007/s10472-005-0430-8},
  doi          = {10.1007/S10472-005-0430-8},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/amai/Pretolani05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/amai/PurdomBS05,
  author       = {Paul W. Purdom and
                  Daniel Le Berre and
                  Laurent Simon},
  title        = {A parsimony tree for the {SAT2002} competition},
  journal      = {Ann. Math. Artif. Intell.},
  volume       = {43},
  number       = {1},
  pages        = {343--365},
  year         = {2005},
  url          = {https://doi.org/10.1007/s10472-005-0431-7},
  doi          = {10.1007/S10472-005-0431-7},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/amai/PurdomBS05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/amai/SimonBH05,
  author       = {Laurent Simon and
                  Daniel Le Berre and
                  Edward A. Hirsch},
  title        = {The {SAT2002} competition},
  journal      = {Ann. Math. Artif. Intell.},
  volume       = {43},
  number       = {1},
  pages        = {307--342},
  year         = {2005},
  url          = {https://doi.org/10.1007/s10472-005-0424-6},
  doi          = {10.1007/S10472-005-0424-6},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/amai/SimonBH05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/amai/Szeider05,
  author       = {Stefan Szeider},
  title        = {Generalizations of matched {CNF} formulas},
  journal      = {Ann. Math. Artif. Intell.},
  volume       = {43},
  number       = {1},
  pages        = {223--238},
  year         = {2005},
  url          = {https://doi.org/10.1007/s10472-005-0432-6},
  doi          = {10.1007/S10472-005-0432-6},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/amai/Szeider05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics