Talks and Poster Presentations (with Proceedings-Entry):
M. Müller, St. Szeider:
"Revisiting Space in Proof Complexity: Treewidth and Pathwidth";
Talk: International Symposium on Mathematical Foundations of Computer Science (MFCS),
Klosterneuburg, Austria;
2013-08-26
- 2013-08-30; in: "The 38th International Symposium on Mathematical Foundations of Computer Science, Proceedings",
K. Chatterjee, J. Sgall (ed.);
Springer / LNCS,
8087
(2013),
ISBN: 978-3-642-40312-5;
704
- 716.
English abstract:
So-called ordered variants of the classical notions of pathwidth and treewidth are introduced and proposed as proof theoretically meaningful complexity measures for the directed acyclic graphs underlying proofs. The ordered pathwidth of a proof is shown to be roughly the same as its formula space. Length-space lower bounds for R(k)-refutations are generalized to arbitrary infinity axioms and strengthened in that the space measure is relaxed to ordered treewidth.
"Official" electronic version of the publication (accessed through its Digital Object Identifier - DOI)
http://dx.doi.org/10.1007/978-3-642-40313-2_41
Related Projects:
Project Head Stefan Szeider:
The Parameterized Complexity of Reasoning Problems
Created from the Publication Database of the Vienna University of Technology.