@Proceedings{cegielski_et_al:LIPIcs.CSL.2012,
  title =	{{LIPIcs, Volume 16, CSL'12, Complete Volume}},
  booktitle =	{Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-42-2},
  ISSN =	{1868-8969},
  year =	{2013},
  volume =	{16},
  editor =	{C\'{e}gielski, Patrick and Durand, Arnaud},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2012},
  URN =		{urn:nbn:de:0030-drops-41106},
  doi =		{10.4230/LIPIcs.CSL.2012},
  annote =	{Keywords: Conference Proceedings; Software; Theory of Computation; Graph Theory; Probability and Statistics; Artificial Intelligence}
}
@InProceedings{cegielski_et_al:LIPIcs.CSL.2012.i,
  author =	{C\'{e}gielski, Patrick and Durand, Arnaud},
  title =	{{Frontmatter, Table of Contents, Preface, Conference Organization}},
  booktitle =	{Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL},
  pages =	{i--xiv},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-42-2},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{16},
  editor =	{C\'{e}gielski, Patrick and Durand, Arnaud},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2012.i},
  URN =		{urn:nbn:de:0030-drops-36559},
  doi =		{10.4230/LIPIcs.CSL.2012.i},
  annote =	{Keywords: Frontmatter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{coquand_et_al:LIPIcs.CSL.2012.1,
  author =	{Coquand, Thierry and Dawar, Anuj and Niwinski, Damian},
  title =	{{The Ackermann Award 2012}},
  booktitle =	{Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL},
  pages =	{1--5},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-42-2},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{16},
  editor =	{C\'{e}gielski, Patrick and Durand, Arnaud},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2012.1},
  URN =		{urn:nbn:de:0030-drops-36575},
  doi =		{10.4230/LIPIcs.CSL.2012.1},
  annote =	{Keywords: Ackermann Award 2012}
}
@InProceedings{abiteboul:LIPIcs.CSL.2012.6,
  author =	{Abiteboul, Serge},
  title =	{{Sharing Distributed Knowledge on the Web}},
  booktitle =	{Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL},
  pages =	{6--8},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-42-2},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{16},
  editor =	{C\'{e}gielski, Patrick and Durand, Arnaud},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2012.6},
  URN =		{urn:nbn:de:0030-drops-36584},
  doi =		{10.4230/LIPIcs.CSL.2012.6},
  annote =	{Keywords: Knowledge base, distributed data, world wide web, deduction}
}
@InProceedings{cook:LIPIcs.CSL.2012.9,
  author =	{Cook, Stephen A.},
  title =	{{Connecting Complexity Classes, Weak Formal Theories, and Propositional Proof Systems}},
  booktitle =	{Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL},
  pages =	{9--11},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-42-2},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{16},
  editor =	{C\'{e}gielski, Patrick and Durand, Arnaud},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2012.9},
  URN =		{urn:nbn:de:0030-drops-36594},
  doi =		{10.4230/LIPIcs.CSL.2012.9},
  annote =	{Keywords: Complexity Classes, Weak Formal Theories, Propositional Proof Systems}
}
@InProceedings{lynce:LIPIcs.CSL.2012.12,
  author =	{Lynce, In\^{e}s},
  title =	{{Satisfiability: where Theory meets Practice}},
  booktitle =	{Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL},
  pages =	{12--13},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-42-2},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{16},
  editor =	{C\'{e}gielski, Patrick and Durand, Arnaud},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2012.12},
  URN =		{urn:nbn:de:0030-drops-36600},
  doi =		{10.4230/LIPIcs.CSL.2012.12},
  annote =	{Keywords: Propositional Satisfiability, SAT solvers, Applications}
}
@InProceedings{makowsky:LIPIcs.CSL.2012.14,
  author =	{Makowsky, Johann A.},
  title =	{{Definability and Complexity of Graph Parameters}},
  booktitle =	{Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL},
  pages =	{14--15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-42-2},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{16},
  editor =	{C\'{e}gielski, Patrick and Durand, Arnaud},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2012.14},
  URN =		{urn:nbn:de:0030-drops-36612},
  doi =		{10.4230/LIPIcs.CSL.2012.14},
  annote =	{Keywords: Model theory, finite model theory, graph invariants}
}
@InProceedings{altenkirch_et_al:LIPIcs.CSL.2012.16,
  author =	{Altenkirch, Thorsten and Rypacek, Ondrej},
  title =	{{A Syntactical Approach to Weak omega-Groupoids}},
  booktitle =	{Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL},
  pages =	{16--30},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-42-2},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{16},
  editor =	{C\'{e}gielski, Patrick and Durand, Arnaud},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2012.16},
  URN =		{urn:nbn:de:0030-drops-36561},
  doi =		{10.4230/LIPIcs.CSL.2012.16},
  annote =	{Keywords: Type Theory, Category Theory, Higher dimensional structures}
}
@InProceedings{aschieri:LIPIcs.CSL.2012.31,
  author =	{Aschieri, Federico},
  title =	{{Interactive Realizability for Classical Peano Arithmetic with Skolem Axioms}},
  booktitle =	{Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL},
  pages =	{31--45},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-42-2},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{16},
  editor =	{C\'{e}gielski, Patrick and Durand, Arnaud},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2012.31},
  URN =		{urn:nbn:de:0030-drops-36629},
  doi =		{10.4230/LIPIcs.CSL.2012.31},
  annote =	{Keywords: Interactive realizability, learning, classical Arithmetic, witness extraction}
}
@InProceedings{atkey:LIPIcs.CSL.2012.46,
  author =	{Atkey, Robert},
  title =	{{Relational Parametricity for Higher Kinds}},
  booktitle =	{Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL},
  pages =	{46--61},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-42-2},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{16},
  editor =	{C\'{e}gielski, Patrick and Durand, Arnaud},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2012.46},
  URN =		{urn:nbn:de:0030-drops-36638},
  doi =		{10.4230/LIPIcs.CSL.2012.46},
  annote =	{Keywords: Relational Parametricity, Higher Kinds, Polymorphism}
}
@InProceedings{baillot_et_al:LIPIcs.CSL.2012.62,
  author =	{Baillot, Patrick and Dal Lago, Ugo},
  title =	{{Higher-Order Interpretations and Program Complexity}},
  booktitle =	{Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL},
  pages =	{62--76},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-42-2},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{16},
  editor =	{C\'{e}gielski, Patrick and Durand, Arnaud},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2012.62},
  URN =		{urn:nbn:de:0030-drops-36641},
  doi =		{10.4230/LIPIcs.CSL.2012.62},
  annote =	{Keywords: implicit complexity, higher-order rewriting, quasi-interpretations}
}
@InProceedings{berardi_et_al:LIPIcs.CSL.2012.77,
  author =	{Berardi, Stefano and de'Liguoro, Ugo},
  title =	{{Knowledge Spaces and the Completeness of Learning Strategies}},
  booktitle =	{Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL},
  pages =	{77--91},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-42-2},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{16},
  editor =	{C\'{e}gielski, Patrick and Durand, Arnaud},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2012.77},
  URN =		{urn:nbn:de:0030-drops-36656},
  doi =		{10.4230/LIPIcs.CSL.2012.77},
  annote =	{Keywords: Classical Logic, Proof Mining, Game Semantics, Learning, Realizability}
}
@InProceedings{bertrand_et_al:LIPIcs.CSL.2012.92,
  author =	{Bertrand, Nathalie and Fearnley, John and Schewe, Sven},
  title =	{{Bounded Satisfiability for PCTL}},
  booktitle =	{Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL},
  pages =	{92--106},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-42-2},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{16},
  editor =	{C\'{e}gielski, Patrick and Durand, Arnaud},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2012.92},
  URN =		{urn:nbn:de:0030-drops-36667},
  doi =		{10.4230/LIPIcs.CSL.2012.92},
  annote =	{Keywords: Satisfiability, Temporal Logic, Probabilistic Logic}
}
@InProceedings{birkedal_et_al:LIPIcs.CSL.2012.107,
  author =	{Birkedal, Lars and Sieczkowski, Filip and Thamsborg, Jacob},
  title =	{{A Concurrent Logical Relation}},
  booktitle =	{Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL},
  pages =	{107--121},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-42-2},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{16},
  editor =	{C\'{e}gielski, Patrick and Durand, Arnaud},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2012.107},
  URN =		{urn:nbn:de:0030-drops-36671},
  doi =		{10.4230/LIPIcs.CSL.2012.107},
  annote =	{Keywords: verification, logical relation, concurrency, type and effect system}
}
@InProceedings{bodirsky_et_al:LIPIcs.CSL.2012.122,
  author =	{Bodirsky, Manuel and Wrona, Michal},
  title =	{{Equivalence Constraint Satisfaction Problems}},
  booktitle =	{Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL},
  pages =	{122--136},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-42-2},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{16},
  editor =	{C\'{e}gielski, Patrick and Durand, Arnaud},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2012.122},
  URN =		{urn:nbn:de:0030-drops-36689},
  doi =		{10.4230/LIPIcs.CSL.2012.122},
  annote =	{Keywords: Constraint satisfaction problems, universal algebra, model theory, Ram- sey theory, temporal reasoning, computational complexity}
}
@InProceedings{braultbaron:LIPIcs.CSL.2012.137,
  author =	{Brault-Baron, Johann},
  title =	{{A Negative Conjunctive Query is Easy if and only if it is Beta-Acyclic}},
  booktitle =	{Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL},
  pages =	{137--151},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-42-2},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{16},
  editor =	{C\'{e}gielski, Patrick and Durand, Arnaud},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2012.137},
  URN =		{urn:nbn:de:0030-drops-36697},
  doi =		{10.4230/LIPIcs.CSL.2012.137},
  annote =	{Keywords: conjunctive query, hypergraph, beta-acyclicity, data complexity, Davis-Putnam procedure}
}
@InProceedings{carraro_et_al:LIPIcs.CSL.2012.152,
  author =	{Carraro, Alberto and Salibra, Antonino},
  title =	{{On the equational consistency of order-theoretic models of the lambda-calculus}},
  booktitle =	{Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL},
  pages =	{152--166},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-42-2},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{16},
  editor =	{C\'{e}gielski, Patrick and Durand, Arnaud},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2012.152},
  URN =		{urn:nbn:de:0030-drops-36703},
  doi =		{10.4230/LIPIcs.CSL.2012.152},
  annote =	{Keywords: Lambda calculus, order-incompleteness, partially ordered models}
}
@InProceedings{chatterjee_et_al:LIPIcs.CSL.2012.167,
  author =	{Chatterjee, Krishnendu and Chaubal, Siddhesh and Kamath, Pritish},
  title =	{{Faster Algorithms for Alternating Refinement Relations}},
  booktitle =	{Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL},
  pages =	{167--182},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-42-2},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{16},
  editor =	{C\'{e}gielski, Patrick and Durand, Arnaud},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2012.167},
  URN =		{urn:nbn:de:0030-drops-36713},
  doi =		{10.4230/LIPIcs.CSL.2012.167},
  annote =	{Keywords: Simulation and fair simulation, Alternating simulation, Graph games}
}
@InProceedings{chaudhuri_et_al:LIPIcs.CSL.2012.183,
  author =	{Chaudhuri, Kaustuv and Hetzl, Stefan and Miller, Dale},
  title =	{{A Systematic Approach to Canonicity in the Classical Sequent Calculus}},
  booktitle =	{Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL},
  pages =	{183--197},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-42-2},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{16},
  editor =	{C\'{e}gielski, Patrick and Durand, Arnaud},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2012.183},
  URN =		{urn:nbn:de:0030-drops-36723},
  doi =		{10.4230/LIPIcs.CSL.2012.183},
  annote =	{Keywords: Sequent Calculus, Canonicity, Classical Logic, Expansion Trees}
}
@InProceedings{chrzaszcz_et_al:LIPIcs.CSL.2012.198,
  author =	{Chrzaszcz, Jacek and Schubert, Aleksy},
  title =	{{ML with PTIME complexity guarantees}},
  booktitle =	{Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL},
  pages =	{198--212},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-42-2},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{16},
  editor =	{C\'{e}gielski, Patrick and Durand, Arnaud},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2012.198},
  URN =		{urn:nbn:de:0030-drops-36738},
  doi =		{10.4230/LIPIcs.CSL.2012.198},
  annote =	{Keywords: implicit computational complexity, polymorphism, soft type assignment}
}
@InProceedings{dawar_et_al:LIPIcs.CSL.2012.213,
  author =	{Dawar, Anuj and Gr\"{a}del, Erich and Holm, Bjarki and Kopczynski, Eryk and Pakusa, Wied},
  title =	{{Definability of linear equation systems over groups and rings}},
  booktitle =	{Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL},
  pages =	{213--227},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-42-2},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{16},
  editor =	{C\'{e}gielski, Patrick and Durand, Arnaud},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2012.213},
  URN =		{urn:nbn:de:0030-drops-36749},
  doi =		{10.4230/LIPIcs.CSL.2012.213},
  annote =	{Keywords: inite model theory, logics with algebraic operators}
}
@InProceedings{deyoung_et_al:LIPIcs.CSL.2012.228,
  author =	{DeYoung, Henry and Caires, Lu{\'\i}s and Pfenning, Frank and Toninho, Bernardo},
  title =	{{Cut Reduction in Linear Logic as Asynchronous Session-Typed Communication}},
  booktitle =	{Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL},
  pages =	{228--242},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-42-2},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{16},
  editor =	{C\'{e}gielski, Patrick and Durand, Arnaud},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2012.228},
  URN =		{urn:nbn:de:0030-drops-36753},
  doi =		{10.4230/LIPIcs.CSL.2012.228},
  annote =	{Keywords: linear logic, cut reduction, asynchronous pi-calculus, session types}
}
@InProceedings{dudder_et_al:LIPIcs.CSL.2012.243,
  author =	{D\"{u}dder, Boris and Martens, Moritz and Rehof, Jakob and Urzyczyn, Pawel},
  title =	{{Bounded Combinatory Logic}},
  booktitle =	{Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL},
  pages =	{243--258},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-42-2},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{16},
  editor =	{C\'{e}gielski, Patrick and Durand, Arnaud},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2012.243},
  URN =		{urn:nbn:de:0030-drops-36763},
  doi =		{10.4230/LIPIcs.CSL.2012.243},
  annote =	{Keywords: Intersection types, Inhabitation, Composition synthesis}
}
@InProceedings{ehrhard:LIPIcs.CSL.2012.259,
  author =	{Ehrhard, Thomas},
  title =	{{Collapsing non-idempotent intersection types}},
  booktitle =	{Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL},
  pages =	{259--273},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-42-2},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{16},
  editor =	{C\'{e}gielski, Patrick and Durand, Arnaud},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2012.259},
  URN =		{urn:nbn:de:0030-drops-36776},
  doi =		{10.4230/LIPIcs.CSL.2012.259},
  annote =	{Keywords: Linear logic, lambda-calculus, denotational semantics}
}
@InProceedings{grandjean_et_al:LIPIcs.CSL.2012.274,
  author =	{Grandjean, Etienne and Olive, Fr\'{e}d\'{e}ric},
  title =	{{Descriptive complexity for pictures languages}},
  booktitle =	{Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL},
  pages =	{274--288},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-42-2},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{16},
  editor =	{C\'{e}gielski, Patrick and Durand, Arnaud},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2012.274},
  URN =		{urn:nbn:de:0030-drops-36783},
  doi =		{10.4230/LIPIcs.CSL.2012.274},
  annote =	{Keywords: Picture languages, locality and tiling, recognizability, linear time, cellular automata, logical characterizations, second-order logic}
}
@InProceedings{grohe_et_al:LIPIcs.CSL.2012.289,
  author =	{Grohe, Martin and Otto, Martin},
  title =	{{Pebble Games and Linear Equations}},
  booktitle =	{Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL},
  pages =	{289--304},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-42-2},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{16},
  editor =	{C\'{e}gielski, Patrick and Durand, Arnaud},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2012.289},
  URN =		{urn:nbn:de:0030-drops-36790},
  doi =		{10.4230/LIPIcs.CSL.2012.289},
  annote =	{Keywords: Finite model theory, finite variable logics, graph isomorphism, Weisfeiler- Lehman algorithm, linear programming, Sherali–Adams hierarchy}
}
@InProceedings{gradel_et_al:LIPIcs.CSL.2012.305,
  author =	{Gr\"{a}del, Erich and Le{\ss}enich, Simon},
  title =	{{Banach-Mazur Games with Simple Winning Strategies}},
  booktitle =	{Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL},
  pages =	{305--319},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-42-2},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{16},
  editor =	{C\'{e}gielski, Patrick and Durand, Arnaud},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2012.305},
  URN =		{urn:nbn:de:0030-drops-36806},
  doi =		{10.4230/LIPIcs.CSL.2012.305},
  annote =	{Keywords: Banach-Mazur games, winning strategies, positional determinacy, Muller winning conditions}
}
@InProceedings{hetzl_et_al:LIPIcs.CSL.2012.320,
  author =	{Hetzl, Stefan and Stra{\ss}burger, Lutz},
  title =	{{Herbrand-Confluence for Cut Elimination in Classical First Order Logic}},
  booktitle =	{Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL},
  pages =	{320--334},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-42-2},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{16},
  editor =	{C\'{e}gielski, Patrick and Durand, Arnaud},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2012.320},
  URN =		{urn:nbn:de:0030-drops-36815},
  doi =		{10.4230/LIPIcs.CSL.2012.320},
  annote =	{Keywords: proof theory, first-order logic, tree languages, term rewriting, semantics of proofs}
}
@InProceedings{hida:LIPIcs.CSL.2012.335,
  author =	{Hida, Takanori},
  title =	{{A Computational Interpretation of the Axiom of Determinacy in Arithmetic}},
  booktitle =	{Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL},
  pages =	{335--349},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-42-2},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{16},
  editor =	{C\'{e}gielski, Patrick and Durand, Arnaud},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2012.335},
  URN =		{urn:nbn:de:0030-drops-36828},
  doi =		{10.4230/LIPIcs.CSL.2012.335},
  annote =	{Keywords: The axiom of determinacy, Gale-Stewart’s theorem, Syntactic continuity, Realizability interpretation, Coquand’s game semantics}
}
@InProceedings{jouannaud_et_al:LIPIcs.CSL.2012.350,
  author =	{Jouannaud, Jean-Pierre and Li, Jianqi},
  title =	{{Church-Rosser Properties of Normal Rewriting}},
  booktitle =	{Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL},
  pages =	{350--365},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-42-2},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{16},
  editor =	{C\'{e}gielski, Patrick and Durand, Arnaud},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2012.350},
  URN =		{urn:nbn:de:0030-drops-36839},
  doi =		{10.4230/LIPIcs.CSL.2012.350},
  annote =	{Keywords: abstract normal rewriting, Church-Rosser property}
}
@InProceedings{kaiser_et_al:LIPIcs.CSL.2012.366,
  author =	{Kaiser, Lukasz and Le{\ss}enich, Simon},
  title =	{{A Counting Logic for Structure Transition Systems}},
  booktitle =	{Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL},
  pages =	{366--380},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-42-2},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{16},
  editor =	{C\'{e}gielski, Patrick and Durand, Arnaud},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2012.366},
  URN =		{urn:nbn:de:0030-drops-36848},
  doi =		{10.4230/LIPIcs.CSL.2012.366},
  annote =	{Keywords: Logic in Computer Science, Quantitative Logics, Model Checking}
}
@InProceedings{keller_et_al:LIPIcs.CSL.2012.381,
  author =	{Keller, Chantal and Lasson, Marc},
  title =	{{Parametricity in an Impredicative Sort}},
  booktitle =	{Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL},
  pages =	{381--395},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-42-2},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{16},
  editor =	{C\'{e}gielski, Patrick and Durand, Arnaud},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2012.381},
  URN =		{urn:nbn:de:0030-drops-36851},
  doi =		{10.4230/LIPIcs.CSL.2012.381},
  annote =	{Keywords: Calculus of Inductive Constructions, parametricity, impredicativity, Coq, universes}
}
@InProceedings{kieronski_et_al:LIPIcs.CSL.2012.396,
  author =	{Kieronski, Emanuel and Michaliszyn, Jakub},
  title =	{{Two-Variable Universal Logic with Transitive Closure}},
  booktitle =	{Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL},
  pages =	{396--410},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-42-2},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{16},
  editor =	{C\'{e}gielski, Patrick and Durand, Arnaud},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2012.396},
  URN =		{urn:nbn:de:0030-drops-36860},
  doi =		{10.4230/LIPIcs.CSL.2012.396},
  annote =	{Keywords: two-variable logic, transitive closure, decidability}
}
@InProceedings{kotek_et_al:LIPIcs.CSL.2012.411,
  author =	{Kotek, Tomer and Makowsky, Johann A.},
  title =	{{Connection Matrices and the Definability of Graph Parameters}},
  booktitle =	{Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL},
  pages =	{411--425},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-42-2},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{16},
  editor =	{C\'{e}gielski, Patrick and Durand, Arnaud},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2012.411},
  URN =		{urn:nbn:de:0030-drops-36871},
  doi =		{10.4230/LIPIcs.CSL.2012.411},
  annote =	{Keywords: Model theory, finite model theory, graph invariants}
}
@InProceedings{kufleitner_et_al:LIPIcs.CSL.2012.426,
  author =	{Kufleitner, Manfred and Weil, Pascal},
  title =	{{The FO2 alternation hierarchy is decidable}},
  booktitle =	{Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL},
  pages =	{426--439},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-42-2},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{16},
  editor =	{C\'{e}gielski, Patrick and Durand, Arnaud},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2012.426},
  URN =		{urn:nbn:de:0030-drops-36888},
  doi =		{10.4230/LIPIcs.CSL.2012.426},
  annote =	{Keywords: first-order logic, regular language, automata theory, semigroup, ranker}
}
@InProceedings{kuroda:LIPIcs.CSL.2012.440,
  author =	{Kuroda, Satoru},
  title =	{{Axiomatizing proof tree concepts in Bounded Arithmetic}},
  booktitle =	{Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL},
  pages =	{440--454},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-42-2},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{16},
  editor =	{C\'{e}gielski, Patrick and Durand, Arnaud},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2012.440},
  URN =		{urn:nbn:de:0030-drops-36893},
  doi =		{10.4230/LIPIcs.CSL.2012.440},
  annote =	{Keywords: Bounded Arithmetic, LOGCFL, LOGDCFL, Proof tree}
}
@InProceedings{kuske:LIPIcs.CSL.2012.455,
  author =	{Kuske, Dietrich},
  title =	{{Isomorphisms of scattered automatic linear orders}},
  booktitle =	{Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL},
  pages =	{455--469},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-42-2},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{16},
  editor =	{C\'{e}gielski, Patrick and Durand, Arnaud},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2012.455},
  URN =		{urn:nbn:de:0030-drops-36906},
  doi =		{10.4230/LIPIcs.CSL.2012.455},
  annote =	{Keywords: Automatic structures, isomorphism, automorphism}
}
@InProceedings{kuusisto_et_al:LIPIcs.CSL.2012.470,
  author =	{Kuusisto, Antti and Meyers, Jeremy and Virtema, Jonni},
  title =	{{Undecidable First-Order Theories of Affine Geometries}},
  booktitle =	{Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL},
  pages =	{470--484},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-42-2},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{16},
  editor =	{C\'{e}gielski, Patrick and Durand, Arnaud},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2012.470},
  URN =		{urn:nbn:de:0030-drops-36910},
  doi =		{10.4230/LIPIcs.CSL.2012.470},
  annote =	{Keywords: Tarski’s geometry, undecidability, spatial logic, classical logic}
}
@InProceedings{leitsch_et_al:LIPIcs.CSL.2012.485,
  author =	{Leitsch, Alexander and Reis, Giselle and Woltzenlogel Paleo, Bruno},
  title =	{{Towards CERes in intuitionistic logic}},
  booktitle =	{Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL},
  pages =	{485--499},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-42-2},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{16},
  editor =	{C\'{e}gielski, Patrick and Durand, Arnaud},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2012.485},
  URN =		{urn:nbn:de:0030-drops-36922},
  doi =		{10.4230/LIPIcs.CSL.2012.485},
  annote =	{Keywords: cut-elimination, resolution, LJ}
}
@InProceedings{parys:LIPIcs.CSL.2012.500,
  author =	{Parys, Pawel},
  title =	{{Variants of Collapsible Pushdown Systems}},
  booktitle =	{Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL},
  pages =	{500--515},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-42-2},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{16},
  editor =	{C\'{e}gielski, Patrick and Durand, Arnaud},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2012.500},
  URN =		{urn:nbn:de:0030-drops-36937},
  doi =		{10.4230/LIPIcs.CSL.2012.500},
  annote =	{Keywords: collapsible pushdown systems, determinization, infinite hierarchy, shrink- ing lemma, reachability}
}
@InProceedings{rabinovich:LIPIcs.CSL.2012.516,
  author =	{Rabinovich, Alexander},
  title =	{{A Proof of Kamp's theorem}},
  booktitle =	{Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL},
  pages =	{516--527},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-42-2},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{16},
  editor =	{C\'{e}gielski, Patrick and Durand, Arnaud},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2012.516},
  URN =		{urn:nbn:de:0030-drops-36945},
  doi =		{10.4230/LIPIcs.CSL.2012.516},
  annote =	{Keywords: Temporal Logic, Monadic Logic, Expressive Completeness}
}
@InProceedings{wu:LIPIcs.CSL.2012.528,
  author =	{Wu, Zhilin},
  title =	{{Commutative Data Automata}},
  booktitle =	{Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL},
  pages =	{528--542},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-42-2},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{16},
  editor =	{C\'{e}gielski, Patrick and Durand, Arnaud},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2012.528},
  URN =		{urn:nbn:de:0030-drops-36953},
  doi =		{10.4230/LIPIcs.CSL.2012.528},
  annote =	{Keywords: Data Automata, Commutative regular languages, Presburger arithmetic, Existential Monadic Second-order logic, B\"{u}chi automata}
}