Benjamin Rossman, Thomas Schwentick, Denis Thérien, and Heribert Vollmer. 10061 Abstracts Collection – Circuits, Logic, and Games. In Circuits, Logic, and Games. Dagstuhl Seminar Proceedings, Volume 10061, pp. 1-8, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2010)
@InProceedings{rossman_et_al:DagSemProc.10061.1, author = {Rossman, Benjamin and Schwentick, Thomas and Th\'{e}rien, Denis and Vollmer, Heribert}, title = {{10061 Abstracts Collection – Circuits, Logic, and Games}}, booktitle = {Circuits, Logic, and Games}, pages = {1--8}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2010}, volume = {10061}, editor = {Benjamin Rossman and Thomas Schwentick and Denis Th\'{e}rien and Heribert Vollmer}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.10061.1}, URN = {urn:nbn:de:0030-drops-25280}, doi = {10.4230/DagSemProc.10061.1}, annote = {Keywords: Computational complexity theory, Finite model theory, Boolean circuits, Regular languages, Finite monoids, Ehrenfeucht-Fra\{\backslash''i\}ss\'{e}-games} }
Benjamin Rossman, Thomas Schwentick, Denis Thérien, and Heribert Vollmer. 10061 Executive Summary – Circuits, Logic, and Games. In Circuits, Logic, and Games. Dagstuhl Seminar Proceedings, Volume 10061, pp. 1-5, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2010)
@InProceedings{rossman_et_al:DagSemProc.10061.2, author = {Rossman, Benjamin and Schwentick, Thomas and Th\'{e}rien, Denis and Vollmer, Heribert}, title = {{10061 Executive Summary – Circuits, Logic, and Games}}, booktitle = {Circuits, Logic, and Games}, pages = {1--5}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2010}, volume = {10061}, editor = {Benjamin Rossman and Thomas Schwentick and Denis Th\'{e}rien and Heribert Vollmer}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.10061.2}, URN = {urn:nbn:de:0030-drops-25279}, doi = {10.4230/DagSemProc.10061.2}, annote = {Keywords: Computational complexity theory, finite model theory, Boolean circuits, regular languages, finite monoids, Ehrenfeucht-Fra\backslash"\backslashi ss\backslash'e-games} }
Peter Lohmann and Heribert Vollmer. Complexity Results for Modal Dependence Logic. In Circuits, Logic, and Games. Dagstuhl Seminar Proceedings, Volume 10061, pp. 1-15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2010)
@InProceedings{lohmann_et_al:DagSemProc.10061.3, author = {Lohmann, Peter and Vollmer, Heribert}, title = {{Complexity Results for Modal Dependence Logic}}, booktitle = {Circuits, Logic, and Games}, pages = {1--15}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2010}, volume = {10061}, editor = {Benjamin Rossman and Thomas Schwentick and Denis Th\'{e}rien and Heribert Vollmer}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.10061.3}, URN = {urn:nbn:de:0030-drops-25240}, doi = {10.4230/DagSemProc.10061.3}, annote = {Keywords: Dependence logic, satisfiability problem, computational complexity, poor man's logic} }
Olaf Beyersdorff, Nicola Galesi, and Massimo Lauria. Hardness of Parameterized Resolution. In Circuits, Logic, and Games. Dagstuhl Seminar Proceedings, Volume 10061, pp. 1-28, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2010)
@InProceedings{beyersdorff_et_al:DagSemProc.10061.4, author = {Beyersdorff, Olaf and Galesi, Nicola and Lauria, Massimo}, title = {{Hardness of Parameterized Resolution}}, booktitle = {Circuits, Logic, and Games}, pages = {1--28}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2010}, volume = {10061}, editor = {Benjamin Rossman and Thomas Schwentick and Denis Th\'{e}rien and Heribert Vollmer}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.10061.4}, URN = {urn:nbn:de:0030-drops-25254}, doi = {10.4230/DagSemProc.10061.4}, annote = {Keywords: Proof complexity, parameterized complexity, Resolution, Prover-Delayer Games} }
Olaf Beyersdorff, Arne Meier, Sebastian Müller, Michael Thomas, and Heribert Vollmer. Proof Complexity of Propositional Default Logic. In Circuits, Logic, and Games. Dagstuhl Seminar Proceedings, Volume 10061, pp. 1-14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2010)
@InProceedings{beyersdorff_et_al:DagSemProc.10061.5, author = {Beyersdorff, Olaf and Meier, Arne and M\"{u}ller, Sebastian and Thomas, Michael and Vollmer, Heribert}, title = {{Proof Complexity of Propositional Default Logic}}, booktitle = {Circuits, Logic, and Games}, pages = {1--14}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2010}, volume = {10061}, editor = {Benjamin Rossman and Thomas Schwentick and Denis Th\'{e}rien and Heribert Vollmer}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.10061.5}, URN = {urn:nbn:de:0030-drops-25261}, doi = {10.4230/DagSemProc.10061.5}, annote = {Keywords: Proof complexity, default logic, sequent calculus} }
Nadia Creignou, Arne Meier, Michael Thomas, and Heribert Vollmer. The Complexity of Reasoning for Fragments of Autoepistemic Logic. In Circuits, Logic, and Games. Dagstuhl Seminar Proceedings, Volume 10061, pp. 1-10, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2010)
@InProceedings{creignou_et_al:DagSemProc.10061.6, author = {Creignou, Nadia and Meier, Arne and Thomas, Michael and Vollmer, Heribert}, title = {{The Complexity of Reasoning for Fragments of Autoepistemic Logic}}, booktitle = {Circuits, Logic, and Games}, pages = {1--10}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2010}, volume = {10061}, editor = {Benjamin Rossman and Thomas Schwentick and Denis Th\'{e}rien and Heribert Vollmer}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.10061.6}, URN = {urn:nbn:de:0030-drops-25234}, doi = {10.4230/DagSemProc.10061.6}, annote = {Keywords: Autoepistemic logic, computational complexity, nonmonotonic reasoning, Post's lattice} }
Feedback for Dagstuhl Publishing