Clause Simplifications in Search-Space Decomposition-Based Sat Solvers

Aus International Center for Computational Logic
Version vom 11. Juni 2015, 13:59 Uhr von Tobias Philipp (Diskussion | Beiträge) (Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Tobias |ErsterAutorNachname=Philipp }} {{Article |Referiert=1 |Title= Clause Simplifications in Search-Space Dec…“)
(Unterschied) ← Nächstältere Version | Aktuelle Version (Unterschied) | Nächstjüngere Version → (Unterschied)
Wechseln zu:Navigation, Suche

Toggle side column

Clause Simplifications in Search-Space Decomposition-Based Sat Solvers

Tobias PhilippTobias Philipp
Clause Simplifications in Search-Space Decomposition-Based Sat Solvers


Tobias Philipp
Clause Simplifications in Search-Space Decomposition-Based Sat Solvers
7th European Starting AI Researcher Symposium (STAIRS), 264, Frontiers in Artificial Intelligence and Applications:211-219, 2014
@article{P2014,
  author    = {Tobias Philipp},
  title     = {Clause Simplifications in Search-Space Decomposition-Based Sat
               Solvers},
  journal   = {7th European Starting {AI} Researcher Symposium (STAIRS)},
  volume    = {264, Frontiers in Artificial Intelligence and Applications},
  publisher = {IOS Press},
  year      = {2014},
  pages     = {211-219}
}