References in zbMATH (referenced in 47 articles )

Showing results 1 to 20 of 47.
Sorted by year (citations)

1 2 3 next

  1. Gaspers, Serge; Ordyniak, Sebastian; Ramanujan, M. S.; Saurabh, Saket; Szeider, Stefan: Backdoors to q-Horn (2016)
  2. Audemard, Gilles; Lagniez, Jean-Marie; Simon, Laurent: Improving glucose for incremental SAT solving with assumptions: application to MUS extraction (2013)
  3. Katebi, Hadi; Sakallah, Karem A.; Markov, Igor L.: Conflict anticipation in the search for graph automorphisms (2012)
  4. Abed, Sa’ed; Mokhtari, Yassine; Ait-Mohamed, Otmane; Tahar, Sofiène: NuMDG: a new tool for multiway decision graphs construction (2011)
  5. Katebi, Hadi; Sakallah, Karem A.; Marques-Silva, João P.: Empirical study of the anatomy of modern SAT solvers (2011)
  6. Sakallah, Karem A.; Marques-Silva, Joao: Anatomy and empirical evaluation of modern SAT solvers (2011)
  7. Schulz, Sven; Blochinger, Wolfgang: Parallel SAT solving on peer-to-peer desktop grids (2010)
  8. Srinivasan, Sudarshan K.: Optimization techniques for verification of out-of-order execution machines (2010)
  9. Aloul, Fadi A.; Ramani, Arathi; Markov, Igor L.; Sakallah, Karem A.: Dynamic symmetry-breaking for Boolean satisfiability (2009)
  10. Sabharwal, Ashish: SymChaff: Exploiting symmetry in a structure-aware satisfiability solver (2009)
  11. Ansótegui, Carlos; Larrubia, Jose; Li, Chu-Min; Manyà, Felip: Exploiting multivalued knowledge in variable selection heuristics for SAT solvers (2007)
  12. Béjar, Ramón; Manyà, Felip; Cabiscol, Alba; Fernàndez, Cèsar; Gomes, Carla: Regular-SAT: A many-valued approach to solving combinatorial problems (2007)
  13. Goldberg, Eugene; Novikov, Yakov: BerkMin: A fast and robust SAT-solver (2007)
  14. Kautz, Henry; Selman, Bart: The state of SAT (2007)
  15. Sinz, Carsten: Visualizing SAT instances and runs of the DPLL algorithm (2007)
  16. Beyer, Sven; Jacobi, Christian; Kröning, Daniel; Leinenbach, Dirk; Paul, Wolfgang J.: Putting it all together-formal verification of the VAMP (2006)
  17. Dershowitz, Nachum; Hanna, Ziyad; Nadel, Alexander: A scalable algorithm for minimal unsatisfiable core extraction (2006)
  18. Fu, Zhaohui; Malik, Sharad: On solving the partial MAX-SAT problem (2006)
  19. Jussila, Toni; Sinz, Carsten; Biere, Armin: Extended resolution proofs for symbolic SAT solving with quantification (2006)
  20. Kurkowski, Mirosław; Srebrny, Marian: A quantifier-free first-order knowledge logic of authentication (2006)

1 2 3 next


Further publications can be found at: http://www.miroslav-velev.com/list_SAT_papers.html