Sign In

Login

Password

Forgot Password ? Sign Up

Erfüllbarkeitsproblem der Aussagenlogik (German Wikipedia)

Analysis of information sources in references of the Wikipedia article "Erfüllbarkeitsproblem der Aussagenlogik" in German language version.

refsWebsite
Global rank German rank
15doi.org
2nd place
3rd place
3zdb-katalog.de
123rd place
6th place
1satcompetition.github.io
low place
low place
1dagstuhl.de
low place
low place
1washington.edu
1,067th place
2,868th place
1utexas.edu
916th place
1,758th place
1satcompetition.org
low place
low place
1satisfiability.org
low place
low place
1satassociation.org
low place
low place

dagstuhl.de

drops.dagstuhl.de

  • Dominik Schweder, John P. Steinberger, PPSZ for General k-SAT – Making Hertli’s Analysis Simpler and 3-SAT Faster, 2017, Online

doi.org

  • Henry Kautz, Bart Selman: Planning as satisfiability. In: Proceedings of the 10th European conference on Artificial intelligence (= ECAI ’92). John Wiley & Sons, Wien 1992, ISBN 0-471-93608-1, S. 359–363, doi:10.5555/145448.146725.
  • João P. Marques-Silva, Karem A. Sakallah: Boolean satisfiability in electronic design automation. In: Proceedings of the 37th Annual Design Automation Conference (= DAC ’00). Association for Computing Machinery, Los Angeles CA 2000, ISBN 1-58113-187-9, S. 675–680, doi:10.1145/337292.337611.
  • Hong Huang, Shaohua Zhou: An efficient SAT algorithm for complex job-shop scheduling. In: Proceedings of the 2018 8th International Conference on Manufacturing Science and Engineering (ICMSE 2018). Atlantis Press, Paris 2018, ISBN 978-94-6252-502-3, doi:10.2991/icmse-18.2018.126.
  • William F. Dowling, Jean H. Gallier: Linear-time algorithms for testing the satisfiability of propositional horn formulae. In: The Journal of Logic Programming. Band 1, Nr. 3, 1984, S. 267–284, doi:10.1016/0743-1066(84)90014-1.
  • Bengt Aspvall, Michael F. Plass, Robert Endre Tarjan: A linear-time algorithm for testing the truth of certain quantified boolean formulas. In: Information Processing Letters. Band 8, Nr. 3, März 1979, S. 121–123, doi:10.1016/0020-0190(79)90002-4.
  • Martin Davis, Hilary Putnam: A Computing Procedure for Quantification Theory. In: Journal of the ACM. Band 7, Nr. 3, Juli 1960, ISSN 0004-5411, S. 201–215, doi:10.1145/321033.321034.
  • Martin Davis, George Logemann, Donald Loveland: A machine program for theorem-proving. In: Communications of the ACM. Band 5, Nr. 7, Juli 1962, ISSN 0001-0782, S. 394–397, doi:10.1145/368273.368557.
  • Lintao Zhang, Sharad Malik: The Quest for Efficient Boolean Satisfiability Solvers. In: Computer Aided Verification. Band 2404. Springer, Berlin / Heidelberg 2002, ISBN 3-540-43997-8, S. 17–36, doi:10.1007/3-540-45657-0_2.
  • João Marques-Silva: The Impact of Branching Heuristics in Propositional Satisfiability Algorithms. In: Progress in Artificial Intelligence. Band 1695. Springer, Berlin / Heidelberg 1999, ISBN 3-540-66548-X, S. 62–74, doi:10.1007/3-540-48159-1_5.
  • Lintao Zhang, S. Malik: Conflict driven learning in a quantified Boolean satisfiability solver. In: IEEE/ACM International Conference on Computer Aided Design. IEEE, 2002, ISBN 0-7803-7607-2, doi:10.1109/iccad.2002.1167570.
  • J.P. Marques-Silva, K.A. Sakallah: GRASP: a search algorithm for propositional satisfiability. In: IEEE Transactions on Computers. Band 48, Nr. 5, Mai 1999, S. 506–521, doi:10.1109/12.769433.
  • Mathias Fleury, Jasmin Christian Blanchette, Peter Lammich: A verified SAT solver with watched literals using imperative HOL. In: Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs – CPP 2018. ACM Press, New York NY 2018, ISBN 978-1-4503-5586-5, doi:10.1145/3167080.
  • Matthew W. Moskewicz, Conor F. Madigan, Ying Zhao, Lintao Zhang, Sharad Malik: Chaff: engineering an efficient SAT solver. In: Proceedings of the 38th conference on Design automation – DAC ’01. ACM Press, Las Vegas NV 2001, ISBN 1-58113-297-2, S. 530–535, doi:10.1145/378239.379017.
  • Marijn J.H. Heule and Hans van Maaren: Look-Ahead Based SAT Solvers, Handbook of Satisfiability. Hrsg.: IOS Press. EasyChair, 2009, doi:10.29007/g7ss (utexas.edu [PDF; abgerufen am 8. November 2020]).
  • Katalin Fazekas, Armin Biere, Christoph Scholl: Incremental Inprocessing in SAT Solving. In: Theory and Applications of Satisfiability Testing – SAT 2019 (= Lecture Notes in Computer Science). Springer International Publishing, Cham 2019, ISBN 978-3-03024258-9, S. 136–154, doi:10.1007/978-3-030-24258-9_9.

satassociation.org

satcompetition.github.io

satcompetition.org

satisfiability.org

utexas.edu

cs.utexas.edu

  • Marijn J.H. Heule and Hans van Maaren: Look-Ahead Based SAT Solvers, Handbook of Satisfiability. Hrsg.: IOS Press. EasyChair, 2009, doi:10.29007/g7ss (utexas.edu [PDF; abgerufen am 8. November 2020]).

washington.edu

courses.cs.washington.edu

zdb-katalog.de

  • Martin Davis, Hilary Putnam: A Computing Procedure for Quantification Theory. In: Journal of the ACM. Band 7, Nr. 3, Juli 1960, ISSN 0004-5411, S. 201–215, doi:10.1145/321033.321034.
  • Martin Davis, George Logemann, Donald Loveland: A machine program for theorem-proving. In: Communications of the ACM. Band 5, Nr. 7, Juli 1962, ISSN 0001-0782, S. 394–397, doi:10.1145/368273.368557.
  • Journal on Satisfiability, Boolean Modeling and Computation ISSN 1574-0617