„Boolean satisfiability“

Suchergebnisse

1.000+ Treffer

• SPABBATS: A pathway-discovery method based on Boolean satisfiability that facilitates the characterization of suppressor mutants
  Flórez, Lope A. ; Gunka, Katrin ; Polanía, Rafael ; Tholen, Stefan ; Stülke, Jörg
• Efficient solution of Boolean satisfiability problems with digital memcomputing
  Bearden, Sean R. B. ; Pei, Yan Ru ; Di Ventra, Massimiliano
• Exact Algorithms and Hardness Result for the Boolean Connectivity Problem of k-Horn Formulas
  Horiyama, Takashi ; Okura, Yuto ; Seto, Kazuhisa ; Teruyama, Junichi 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Logikbasierte Optimierungsverfahren für die Bedarfsprognose
  Kübart, Thore ; Küchlin, Wolfgang 2016 Universitätsbibliothek Tübingen
• SAT Encodings of Finite CSPs
  Nguyen, Van-Hau ; Hölldobler, Steffen ; Barahona, Pedro 2015 Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden
• Towards Next Generation Sequential and Parallel SAT Solvers
  Manthey, Norbert ; Hölldobler, Steffen ; Biere, Armin 2015 Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden
• WoLFram - A Word Level Framework for Formal Verification and its Application
  Sülflow, André 2010 Shaker
• Connectivity of Boolean satisfiability
  Schwerdtfeger, Konrad W. 2016 Technische Informationsbibliothek (TIB)
• SAT-based String Solving – Solving String Constraints by Reduction to Boolean Satisfiability
  Lotz, Kevin ; Nowotka, Dirk ; Manea, Florin Silviu 2025 Universitätsbibliothek Kiel
• A Topological Version of Schaefer’s Dichotomy Theorem
  Schnider, Patrick ; Weber, Simon 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Static Detection of Software Errors – Precise and Scalable Algorithms for Automatic Detection of Software Errors
  Xie, Yichen 2012 AV Akademikerverlag
• Handbook of Parallel Constraint Reasoning
  Sais, Lakhdar ; Hamadi, Youssef 2018 Springer International Publishing
• On Top-Down Pseudo-Boolean Model Counting
  Yang, Suwei ; Lai, Yong ; Meel, Kuldeep S. 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Towards Modern and Modular SAT for LCG (Short Paper)
  Dekker, Jip J. ; Ignatiev, Alexey ; Stuckey, Peter J. ; Zhong, Allen Z. 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• DynamicSAT: Dynamic Configuration Tuning for SAT Solving
  Shi, Zhengyuan ; Jiang, Wentao ; Zhang, Xindi ; Luo, Jin ; Liang, Yun ; Chu, Zhufei ; Xu, Qiang 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• SPABBATS: a pathway-discovery method based on Boolean satisfiability that facilitates the characterization of suppressor mutants
  Flórez, Lope A ; Gunka, Katrin ; Polanía, Rafael ; Tholen, Stefan ; Stülke, Jörg 2025 Universität
• Decision Procedures – An Algorithmic Point of View
  Kroening, Daniel ; Strichman, Ofer 2016 Springer Berlin Heidelberg
• Finding Small Satisfying Assignments Faster Than Brute Force: A Fine-Grained Perspective into Boolean Constraint Satisfaction
  Künnemann, Marvin ; Marx, Dániel 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• SAT and Interactions (Dagstuhl Seminar 16381)
  Beyersdorff, Olaf ; Creignou, Nadia ; Egly, Uwe ; Vollmer, Heribert
• SAT Interactions (Dagstuhl Seminar 12471)
  Creignou, Nadia ; Galesi, Nicola ; Kullmann, Oliver ; Vollmer, Heribert