| The Complexity of Partial-Observation Parity Games (Invited Talk) / Krishnendu Chatterjee ; Laurent Doyen |
| Awareness in Games, Awareness in Logic (Invited Talk) / Joseph Y. Halpern |
| Human and Unhuman Commonsense Reasoning (Invited Talk) / Michael J. Maher |
| Gödel Logics - A Survey (Invited Tutorial) / Norbert Preining |
| Tableau Calculus for the Logic of Comparative Similarity over Arbitrary Distance Spaces / Régis Alenda ; Nicola Olivetti |
| Extended Computation Tree Logic / Roland Axelsson ; Matthew Hague ; Stephan Kreutzer ; Martin Lange ; Markus Latte |
| Using Causal Relationships to Deal with the Ramification Problem in Action Formalisms Based on Description Logics / Franz Baader ; Marcel Lippmann ; Hongkai Liu |
| SAT Encoding of Unification in ?L / Barbara Morawska |
| Generating Combinatorial Test Cases by Efficient SAT Encodings Suitable for CDCL SAT Solvers / Mutsunori Banbara ; Haruki Matsunaka ; Naoyuki Tamura ; Katsumi Inoue |
| Generating Counterexamples for Structural Inductions by Exploiting Nonstandard Models / Jasmin Christian Blanchette ; Koen Claessen |
| Characterising Space Complexity Classes via Knuth-Bendix Orders / Guillaume Bonfante ; Georg Moser |
| Focused Natural Deduction / Taus Brock-Nannestad ; Carsten Schürmann |
| How to Universally Close the Existential Rule / Kai Brünnler |
| On the Complexity of the Bernays-Schönfinkel Class with Datalog / Witold Charatonik ; Piotr Witkowski |
| Magically Constraining the Inverse Method Using Dynamic Polarity Assignment / Kaustuv Chaudhuri |
| Lazy Abstraction for Size-Change Termination / Michael Codish ; Carsten Fuhs ; Jürgen Giesl ; Peter Schneider-Kamp |
| A Syntactical Approach to Qualitative Constraint Networks Merging / Jean-François Condotta ; Souhila Kaci ; Pierre Marquis ; Nicolas Schwind |
| On the Satisfiability of Two-Variable Logic over Data Words / Claire David ; Leonid Libkin ; Tony Tan |
| Generic Methods for Formalising Sequent Calculi Applied to Provability Logic / Jeremy E. Dawson ; Rajeev Goré |
| Characterising Probabilistic Processes Logically (Extended Abstract) / Yuxin Deng ; Rob van Glabbeek |
| fCube: An Efficient Prover for Intuitionistic Propositional Logic / Mauro Ferrari ; Camillo Fiorentini ; Guido Fiorino |
| Superposition-Based Analysis of First-Order Probabilistic Timed Automata / Arnaud Fietzke ; Holger Hermanns ; Christoph Weidenbach |
| A Nonmonotonic Extension of KLM Preferential Logic P / Laura Giordano ; Valentina Gliozzi ; Gian Luca Pozzato |
| On Strong Normalization of the Calculus of Constructions with Type-Based Termination / Benjamin Grégoire ; Jorge Luis Sacchini |
| Aligators for Arrays (Tool Paper) / Thomas A. Henzinger ; Thibaud Hottelier ; Laura Kovács ; Audrey Rybalchenko |
| Clause Elimination Procedures for CNF Formulas / Marijn Heule ; Matti Järvisalo ; Armin Biere |
| Partitioning SAT Instances for Distributed Solving / Antti E.J. Hyvärinen ; Tommi Junttila ; Ilkka Niemelä |
| Infinite Families of Finite String Rewriting Systems and Their Confluence / Jean-Pierre Jouannaud ; Benjamin Monate |
| Polite Theories Revisited / Dejan Jovanovic ; Clark Barrett |
| Clausal Graph Tableaux for Hybrid Logic with Eventualities and Difference / Mark Kaminski ; Gert Smolka |
| The Consistency of the CADIAG-2 Knowledge Base: A Probabilistic Approach / Pavel Klinov ; Bijan Parsia ; David Picado-Muiño |
| On the Complexity of Model Expansion / Antonina Kolokolova ; Yongmei Liu ; David Mitchell ; Eugenia Ternovska |
| Labelled Unit Superposition Calculi for Instantiation-Based Reasoning / Konstantin Korovin ; Christoph Sticksel |
| Boosting Loral Search Thanks to CDCL / Gilles Audemard ; Jean-Marie Lagniez ; Bertrand Mazure ; Lakhdar Saïs |
| Interpolating Quantifier-Free Presburger Arithmetic / Daniel Kroening ; Jérôme Leroux ; Philipp Rümmer |
| Variable Compression in ProbLog / Theofrastos Mantadelis ; Gerda Janssens |
| Improving Resource-Unaware SAT Solvers / Steffen Hölldobler ; Norbert Manthey ; Ari Saptawijaya |
| Expansion Nets: Proof-Nets for Propositional Classical Logic / Richard McKinley |
| Revisiting Matrix Interpretations for Polynomial Derivational Complexity of Term Rewriting / Friedrich Neurauter ; Harald Zankl ; Aart Middeldorp |
| An Isabelle-Like Procedural Mode for HOL Light / Petros Papapanagiotou ; Jacques Fleuriot |
| Bottom-Up Tree Automata with Term Constraints / Andreas Reu? ; Helmut Seidl |
| Constructors, Sufficient Completeness, Deadlock Freedom of Rewrite Theories / Camilo Rocha ; José Meseguer |
| PBINT, A Logic for Modelling Search Problems Involving Arithmetic / Shahab Tasharrofi |
| Resolution for Stochastic Boolean Satisfiability / Tino Teige ; Martin Fränzle |
| Symbolic Automata Constraint Solving / Margus Veanes ; Nikolaj Bjørner ; Leonardo de Moura |
| Author Index |
| The Complexity of Partial-Observation Parity Games (Invited Talk) / Krishnendu Chatterjee ; Laurent Doyen |
| Awareness in Games, Awareness in Logic (Invited Talk) / Joseph Y. Halpern |
| Human and Unhuman Commonsense Reasoning (Invited Talk) / Michael J. Maher |
ＥＢ
