Abstract is missing.
- Building SMT-Based Software Model Checkers: An Experience ReportAlessandro Armando. 1-17 [doi]
- Combining Nonmonotonic Knowledge Bases with External SourcesThomas Eiter, Gerhard Brewka, Minh Dao-Tran, Michael Fink, Giovambattista Ianni, Thomas Krennwallner. 18-42 [doi]
- Combining Description Logics, Description Graphs, and RulesBoris Motik. 43-67 [doi]
- Combining Equational ReasoningAshish Tiwari. 68-83 [doi]
- Superposition Modulo Linear Arithmetic SUP(LA)Ernst Althaus, Evgeny Kruglov, Christoph Weidenbach. 84-99 [doi]
- Unification Modulo Homomorphic EncryptionSiva Anantharaman, Hai Lin, Christopher Lynch, Paliath Narendran, Michaël Rusinowitch. 100-116 [doi]
- Argument Filterings and Usable Rules for Simply Typed Dependency PairsTakahito Aoto, Toshiyuki Yamada. 117-132 [doi]
- ::::DL-Lite:::: with Temporalised Concepts, Rigid Axioms and RolesAlessandro Artale, Roman Kontchakov, Vladislav Ryzhikov, Michael Zakharyaschev. 133-148 [doi]
- Runtime Verification Using a Temporal Description LogicFranz Baader, Andreas Bauer 0002, Marcel Lippmann. 149-164 [doi]
- Axiomatization and Completeness of Lexicographic Products of Modal LogicsPhilippe Balbiani. 165-180 [doi]
- Automating Theories in Intuitionistic LogicGuillaume Burel. 181-197 [doi]
- Taming the Complexity of Temporal Epistemic ReasoningClare Dixon, Michael Fisher, Boris Konev. 198-213 [doi]
- Putting ABox Updates into ActionConrad Drescher, Hongkai Liu, Franz Baader, Steffen Guhlemann, Uwe Petersohn, Peter Steinke, Michael Thielscher. 214-229 [doi]
- A Declarative Agent Programming Language Based on Action TheoriesConrad Drescher, Stephan Schiffel, Michael Thielscher. 230-245 [doi]
- Termination Modulo Combinations of Equational TheoriesFrancisco Durán, Salvador Lucas, José Meseguer. 246-262 [doi]
- Combinations of Theories for Decidable Fragments of First-Order LogicPascal Fontaine. 263-278 [doi]
- Products of Modal Logics with Diagonal Constant Lacking the Finite Model PropertyAgi Kurucz. 279-286 [doi]
- Improving Coq Propositional Reasoning Using a Lazy CNF Conversion SchemeStéphane Lescuyer, Sylvain Conchon. 287-303 [doi]
- Combining Instance Generation and ResolutionChristopher Lynch, Ralph Eric McGregor. 304-318 [doi]
- Data Structures with Arithmetic Constraints: A Non-disjoint CombinationEnrica Nicolini, Christophe Ringeissen, Michaël Rusinowitch. 319-334 [doi]
- Efficient Combination of Decision Procedures for MUS ComputationCédric Piette, Youssef Hamadi, Lakhdar Sais. 335-349 [doi]
- Learning to Integrate Deduction and Search in Reasoning about Quantified Boolean FormulasLuca Pulina, Armando Tacchella. 350-365 [doi]
- Combining Theories with Shared Set OperationsThomas Wies, Ruzica Piskac, Viktor Kuncak. 366-382 [doi]