Long Distance Q-Resolution with Dependency Schemes

Peitl, Tomáš; Slivovsky, Friedrich; Szeider, Stefan

doi:10.1007/978-3-319-40970-2_31

by Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider

Reference:

Long Distance Q-Resolution with Dependency SchemesTomáš Peitl, Friedrich Slivovsky, Stefan SzeiderTheory and Applications of Satisfiability Testing - SAT 2016 - 19th International Conference, Bordeaux, France, July 5-8, 2016, Proceedings (Nadia Creignou, Daniel Le Berre, eds.), volume 9710 of Lecture Notes in Computer Science, pages 500–518, 2016, Springer Verlag.

Bibtex Entry:

@string{lncs="Lecture Notes in Computer Science"}
@string{springer="Springer Verlag"}
@InProceedings{PeitlSlivovskySzeider16,
  author       = {Tom\'{a}\v{s} Peitl and Friedrich Slivovsky and Stefan Szeider},
  title        = {Long Distance {Q}-Resolution with Dependency Schemes},
  booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2016 - 19th
               International Conference, Bordeaux, France, July 5-8, 2016, Proceedings},
  pages     = {500--518},
  year      = {2016},
  url = {http://www.ac.tuwien.ac.at/files/tr/ac-tr-17-003.pdf},
  editor    = {Nadia Creignou and
               Daniel Le Berre},
  series    = LNCS,
  volume    = {9710},
  publisher = Springer,
  doi = {10.1007/978-3-319-40970-2_31},
  keywords = {QBF}
}