Proof Complexity of Fragments of Long-Distance Q-resolution

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

doi:10.1007/978-3-030-24258-9_23

by Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider

Reference:

Proof Complexity of Fragments of Long-Distance Q-resolutionTomáš Peitl, Friedrich Slivovsky, Stefan SzeiderProceedings of SAT 2019, the 22nd International Conference on Theory and Applications of Satisfiability Testing, July 7–12, 2019, Lisbon, Portugal (Mikoláš Janota, Inês Lynce, eds.), volume 11628 of Lecture Notes in Computer Science, pages 319–335, 2019, Springer Verlag.

Bibtex Entry:

@string{lncs="Lecture Notes in Computer Science"}
@string{springer="Springer Verlag"}
@inproceedings{PeitlSlivovskySzeider19b,
	author = {Tom\'{a}\v{s} Peitl and Friedrich Slivovsky and Stefan Szeider},
	title  = {Proof Complexity of Fragments of Long-Distance {Q}-resolution},
	booktitle = {Proceedings of SAT 2019,
					the 22nd International
					Conference on Theory and Applications of
					Satisfiability Testing, July
					7--12, 2019, Lisbon, Portugal},
	year      = {2019},
	editor    = {Mikol\'{a}\v{s} Janota and In\^{e}s Lynce},
	series    = LNCS,
         doi       = {10.1007/978-3-030-24258-9\_23},
	publisher = Springer,
	  volume    = {11628},
	    pages     = {319--335},
	pdf =  {http://www.ac.tuwien.ac.at/files/tr/ac-tr-19-004.pdf},
	keywords  = {QBF}
}