Abstract is missing.
- Architecting Solvers for SAT Modulo Theories: Nelson-Oppen with DPLLSava Krstic, Amit Goel. 1-27 [doi]
- From KSAT to Delayed Theory Combination: Exploiting DPLL Outside the SAT DomainRoberto Sebastiani. 28-46 [doi]
- Hierarchical and Modular Reasoning in Complex Theories: The Case of Local Theory ExtensionsViorica Sofronie-Stokkermans. 47-71 [doi]
- Temporalising Logics: Fifteen Years AfterMichael Zakharyaschev. 72 [doi]
- Termination of Innermost Context-Sensitive Rewriting Using Dependency PairsBeatriz Alarcón, Salvador Lucas. 73-87 [doi]
- A Compressing Translation from Propositional Resolution to Natural DeductionHasan Amjad. 88-102 [doi]
- Combining Algorithms for Deciding Knowledge in Security ProtocolsMathilde Arnaud, Véronique Cortier, Stéphanie Delaune. 103-117 [doi]
- Combining Classical and Intuitionistic ImplicationsCarlos Caleiro, Jaime Ramos. 118-132 [doi]
- Towards an Automatic Analysis of Web Service SecurityYannick Chevalier, Denis Lugiez, Michaël Rusinowitch. 133-147 [doi]
- Certification of Automated Termination ProofsEvelyne Contejean, Pierre Courtieu, Julien Forest, Olivier Pons, Xavier Urbain. 148-162 [doi]
- Temporal Logic with Capacity ConstraintsClare Dixon, Michael Fisher, Boris Konev. 163-177 [doi]
- Idempotent Transductions for Modal LogicsTim French. 178-192 [doi]
- A Temporal Logic of RobustnessTim French, John C. McCabe-Dansted, Mark Reynolds. 193-205 [doi]
- Noetherianity and Combination ProblemsSilvio Ghilardi, Enrica Nicolini, Silvio Ranise, Daniele Zucchelli. 206-220 [doi]
- Languages Modulo NormalizationHitoshi Ohsaki, Hiroyuki Seki. 221-236 [doi]
- Combining Proof-Producing Decision ProceduresSilvio Ranise, Christophe Ringeissen, Duc-Khanh Tran. 237-251 [doi]
- Visibly Pushdown Languages and Term RewritingJacques Chabin, Pierre Réty. 252-266 [doi]
- Proving Termination Using Recursive Path Orders and SAT SolvingPeter Schneider-Kamp, René Thiemann, Elena Annov, Michael Codish, Jürgen Giesl. 267-282 [doi]