26. CSL 2012: Fontainebleau, France
Patrick Cégielski, Arnaud Durand (Eds.): Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL, CSL 2012, September 3-6, 2012, Fontainebleau, France. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik 2012 LIPIcs ISBN 978-3-939897-42-2- Frontmatter, Table of Contents, Preface, Conference Organization.
- Serge Abiteboul: Sharing Distributed Knowledge on the Web (Invited Talk). 6-8
- Stephen A. Cook: Connecting Complexity Classes, Weak Formal Theories, and Propositional Proof Systems (Invited Talk). 9-11
- Inês Lynce: Satisfiability: where Theory meets Practice (Invited Talk). 12-13
- Johann A. Makowsky: Definability and Complexity of Graph Parameters (Invited Talk). 14-15
- Federico Aschieri: Interactive Realizability for Classical Peano Arithmetic with Skolem Axioms. 31-45
- Robert Atkey: Relational Parametricity for Higher Kinds. 46-61
- Stefano Berardi, Ugo de'Liguoro: Knowledge Spaces and the Completeness of Learning Strategies. 77-91
- Johann Brault-Baron: A Negative Conjunctive Query is Easy if and only if it is Beta-Acyclic. 137-151
- Alberto Carraro, Antonino Salibra: On the equational consistency of order-theoretic models of the lambda-calculus. 152-166
- Krishnendu Chatterjee, Siddhesh Chaubal, Pritish Kamath: Faster Algorithms for Alternating Refinement Relations. 167-182
- Kaustuv Chaudhuri, Stefan Hetzl, Dale Miller: A Systematic Approach to Canonicity in the Classical Sequent Calculus. 183-197
- Anuj Dawar, Erich Grädel, Bjarki Holm, Eryk Kopczynski, Wied Pakusa: Definability of linear equation systems over groups and rings. 213-227
- Henry DeYoung, Luís Caires, Frank Pfenning, Bernardo Toninho: Cut Reduction in Linear Logic as Asynchronous Session-Typed Communication. 228-242
- Thomas Ehrhard: Collapsing non-idempotent intersection types. 259-273
- Stefan Hetzl, Lutz Straßburger: Herbrand-Confluence for Cut Elimination in Classical First Order Logic. 320-334
- Takanori Hida: A Computational Interpretation of the Axiom of Determinacy in Arithmetic. 335-349
- Tomer Kotek, Johann A. Makowsky: Connection Matrices and the Definability of Graph Parameters. 411-425
- Satoru Kuroda: Axiomatizing proof tree concepts in Bounded Arithmetic. 440-454
- Dietrich Kuske: Isomorphisms of scattered automatic linear orders. 455-469
- Antti Kuusisto, Jeremy Meyers, Jonni Virtema: Undecidable First-Order Theories of Affine Geometries. 470-484
- Alexander Leitsch, Giselle Reis, Bruno Woltzenlogel Paleo: Towards CERes in intuitionistic logic. 485-499
- Pawel Parys: Variants of Collapsible Pushdown Systems. 500-515
- Alexander Rabinovich: A Proof of Kamp's theorem. 516-527
- Zhilin Wu: Commutative Data Automata. 528-542
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-19T201401 by the dblp team