Abstract is missing.
- The Complexity of Partial-Observation Parity GamesKrishnendu Chatterjee, Laurent Doyen. 1-14 [doi]
- Human and Unhuman Commonsense ReasoningMichael J. Maher. 16-29 [doi]
- Gödel Logics - A SurveyNorbert Preining. 30-51 [doi]
- Tableau Calculus for the Logic of Comparative Similarity over Arbitrary Distance SpacesRégis Alenda, Nicola Olivetti. 52-66 [doi]
- Extended Computation Tree LogicRoland Axelsson, Matthew Hague, Stephan Kreutzer, Martin Lange, Markus Latte. 67-81 [doi]
- Using Causal Relationships to Deal with the Ramification Problem in Action Formalisms Based on Description LogicsFranz Baader, Marcel Lippmann, Hongkai Liu. 82-96 [doi]
- SAT Encoding of Unification in ::::EL::::/mathcal{EL}Franz Baader, Barbara Morawska. 97-111 [doi]
- Generating Combinatorial Test Cases by Efficient SAT Encodings Suitable for CDCL SAT SolversMutsunori Banbara, Haruki Matsunaka, Naoyuki Tamura, Katsumi Inoue. 112-126 [doi]
- Generating Counterexamples for Structural Inductions by Exploiting Nonstandard ModelsJasmin Christian Blanchette, Koen Claessen. 127-141 [doi]
- Characterising Space Complexity Classes via Knuth-Bendix OrdersGuillaume Bonfante, Georg Moser. 142-156 [doi]
- Focused Natural DeductionTaus Brock-Nannestad, Carsten Schürmann. 157-171 [doi]
- How to Universally Close the Existential RuleKai Brünnler. 172-186 [doi]
- On the Complexity of the Bernays-Schönfinkel Class with DatalogWitold Charatonik, Piotr Witkowski. 187-201 [doi]
- Magically Constraining the Inverse Method Using Dynamic Polarity AssignmentKaustuv Chaudhuri. 202-216 [doi]
- Lazy Abstraction for Size-Change TerminationMichael Codish, Carsten Fuhs, Jürgen Giesl, Peter Schneider-Kamp. 217-232 [doi]
- A Syntactical Approach to Qualitative Constraint Networks MergingJean-François Condotta, Souhila Kaci, Pierre Marquis, Nicolas Schwind. 233-247 [doi]
- On the Satisfiability of Two-Variable Logic over Data WordsClaire David, Leonid Libkin, Tony Tan. 248-262 [doi]
- Generic Methods for Formalising Sequent Calculi Applied to Provability LogicJeremy E. Dawson, Rajeev Goré. 263-277 [doi]
- Characterising Probabilistic Processes Logically - (Extended Abstract)Yuxin Deng, Rob J. van Glabbeek. 278-293 [doi]
- fCube: An Efficient Prover for Intuitionistic Propositional LogicMauro Ferrari, Camillo Fiorentini, Guido Fiorino. 294-301 [doi]
- Superposition-Based Analysis of First-Order Probabilistic Timed AutomataArnaud Fietzke, Holger Hermanns, Christoph Weidenbach. 302-316 [doi]
- A Nonmonotonic Extension of KLM Preferential Logic PLaura Giordano, Valentina Gliozzi, Nicola Olivetti, Gian Luca Pozzato. 317-332 [doi]
- On Strong Normalization of the Calculus of Constructions with Type-Based TerminationBenjamin Grégoire, Jorge Luis Sacchini. 333-347 [doi]
- Aligators for Arrays (Tool Paper)Thomas A. Henzinger, Thibaud Hottelier, Laura Kovács, Andrey Rybalchenko. 348-356 [doi]
- Clause Elimination Procedures for CNF FormulasMarijn Heule, Matti Järvisalo, Armin Biere. 357-371 [doi]
- Partitioning SAT Instances for Distributed SolvingAntti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä. 372-386 [doi]
- Infinite Families of Finite String Rewriting Systems and Their ConfluenceJean-Pierre Jouannaud, Benjamin Monate. 387-401 [doi]
- Polite Theories RevisitedDejan Jovanovic, Clark Barrett. 402-416 [doi]
- Clausal Graph Tableaux for Hybrid Logic with Eventualities and DifferenceMark Kaminski, Gert Smolka. 417-431 [doi]
- The Consistency of the CADIAG-2 Knowledge Base: A Probabilistic ApproachPavel Klinov, Bijan Parsia, David Picado-Muiño. 432-446 [doi]
- On the Complexity of Model ExpansionAntonina Kolokolova, Yongmei Liu, David G. Mitchell, Eugenia Ternovska. 447-458 [doi]
- Labelled Unit Superposition Calculi for Instantiation-Based ReasoningKonstantin Korovin, Christoph Sticksel. 459-473 [doi]
- Boosting Local Search Thanks to cdclGilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Sais. 474-488 [doi]
- Interpolating Quantifier-Free Presburger ArithmeticDaniel Kroening, Jérôme Leroux, Philipp Rümmer. 489-503 [doi]
- Variable Compression in ProbLogTheofrastos Mantadelis, Gerda Janssens. 504-518 [doi]
- Improving Resource-Unaware SAT SolversSteffen Hölldobler, Norbert Manthey, Ari Saptawijaya. 519-534 [doi]
- Expansion Nets: Proof-Nets for Propositional Classical LogicRichard McKinley. 535-549 [doi]
- Revisiting Matrix Interpretations for Polynomial Derivational Complexity of Term RewritingFriedrich Neurauter, Harald Zankl, Aart Middeldorp. 550-564 [doi]
- An Isabelle-Like Procedural Mode for HOL LightPetros Papapanagiotou, Jacques D. Fleuriot. 565-580 [doi]
- Bottom-Up Tree Automata with Term ConstraintsAndreas Reuß, Helmut Seidl. 581-593 [doi]
- Constructors, Sufficient Completeness, and Deadlock Freedom of Rewrite TheoriesCamilo Rocha, José Meseguer. 594-609 [doi]
- PBINT, A Logic for Modelling Search Problems Involving ArithmeticShahab Tasharrofi, Eugenia Ternovska. 610-624 [doi]
- Resolution for Stochastic Boolean SatisfiabilityTino Teige, Martin Fränzle. 625-639 [doi]
- Symbolic Automata Constraint SolvingMargus Veanes, Nikolaj Bjørner, Leonardo Mendonça de Moura. 640-654 [doi]