Items where authors include "Vollmer, H"

Export as [feed] Atom [feed] RSS
Number of items: 10.

Article

Beyersdorff, O, Datta, S, Krebs, A et al. (5 more authors) (2013) Verifying proofs in constant depth. ACM Transactions on Computation Theory (TOCT), 5 (1). 2. ISSN 1942-3454

Beyersdorff, O, Meier, A, Thomas, M et al. (1 more author) (2012) The complexity of reasoning for fragments of default logic. Journal of Logic and Computation, 22 (3). 587 - 604 . ISSN 0955-792X

Beyersdorff, O, Meier, A, Mueller, S et al. (2 more authors) (2011) Proof complexity of propositional default logic. Archive for Mathematical Logic, 50 (7-8). 727 - 742 . ISSN 1432-0665

Beyersdorff, O, Meier, A, Mundhenk, M et al. (3 more authors) (2011) Model Checking CTL is Amost Always Inherently Sequential. Logical Methods in Computer Science, 7 (2). ISSN 1860-5974

Beyersdorff, O, Meier, A, Thomas, M et al. (1 more author) (2009) The complexity of propositional implication. Information Processing Letters, 109 (18). 1071 - 1077 . ISSN 0020-0190

Proceedings Paper

Beyersdorff, O orcid.org/0000-0002-2870-1648, Creignou, N, Egly, U et al. (1 more author) (2016) Report from Dagstuhl Seminar 16381: SAT and Interactions. In: Dagstuhl Reports. Dagstuhl Seminar 16381, SAT and Interactions, 18-23 Sep 2016. Dagstuhl Publishing , pp. 74-93.

Beyersdorff, O, Vollmer, H, Datta, S et al. (4 more authors) (2011) Verifying proofs in constant depth. In: Proceedings MFCS 2011. Mathematical Foundations of Computer Science 2011, 22-26 Aug 2011, Warsaw, Poland. Springer Verlag , 84 - 95 . ISBN 978-3-642-22992-3

Beyersdorff, O, Meier, A, Mueller, S et al. (2 more authors) (2010) Proof Complexity of Propositional Default Logic. In: Strichman, O and Szeider, S, (eds.) Theory and applications of satisfiability testing. SAT 2010, 11-14 Jul 2010, Edinburgh, UK. Lecture notes in computer science, 6175 . Springer Verlag , 30 - 43 . ISBN 978-3-642-14185-0

Beyersdorff, O, Meier, A, Thomas, M et al. (1 more author) (2009) The Complexity of Reasoning for Fragments of Default Logic. In: Theory and Applications of Satisfiability Testing 2009. 12th International Conference, SAT 2009, 30 Jun - 03 Jul 2009, Swansea. Lecture Notes in Computer Science, 5584 (Lectur). Springer Verlag , 51 - 64 . ISBN 978-3-642-02776-5

Beyersdorff, O, Meier, A, Thomas, M et al. (3 more authors) (2009) Model Checking CTL is Almost Always Inherently Sequential. In: Lutz, C and Raskin, J-F, (eds.) 16th International Symposium on Temporal Representation and Reasoning 2009. International Symposium on Temporal Representation and Reasoning, 23-25 Jul 2009, Bressanone, Brixen, Italy. IEEE , 21 - 28 . ISBN 978-0-7695-3727-6

This list was generated on Mon Mar 25 00:30:07 2024 GMT.