Abstract is missing.
- Harald Ganzinger's Legacy: Contributions to Logics and ProgrammingDeepak Kapur, Robert Nieuwenhuis, Andrei Voronkov, Christoph Weidenbach, Reinhard Wilhelm. 1-18 [doi]
- Bio-Logics: Logical Analysis of Bioregulatory NetworksAlexander Bockmayr, Heike Siebert. 19-34 [doi]
- Canonical Ground Horn TheoriesMaria Paola Bonacina, Nachum Dershowitz. 35-71 [doi]
- A Generic Functional Representation of Sorted Trees Supporting Attribution - (Haskell Can Do It)Jean-Marie Gaillourdet, Patrick Michel, Arnd Poetzsch-Heffter, Nicole Rauch. 72-89 [doi]
- The Blossom of Finite Semantic TreesJean Goubault-Larrecq, Jean-Pierre Jouannaud. 90-122 [doi]
- Functional Logic Programming: From Theory to CurryMichael Hanus. 123-168 [doi]
- From Search to Computation: Redundancy Criteria and Simplification at WorkThomas Hillenbrand, Ruzica Piskac, Uwe Waldmann, Christoph Weidenbach. 169-193 [doi]
- Elimination Techniques for Program AnalysisDeepak Kapur. 194-215 [doi]
- Narrowing Based Inductive Proof SearchClaude Kirchner, Hélène Kirchner, Fabrice Nahon. 216-238 [doi]
- Inst-Gen - A Modular Approach to Instantiation-Based Automated ReasoningKonstantin Korovin. 239-270 [doi]
- Common Knowledge Logic in a Higher Order Proof AssistantPierre Lescanne. 271-284 [doi]
- Constructing Bachmair-Ganzinger ModelsChristopher Lynch. 285-301 [doi]
- Planning with Effectively Propositional LogicJuan Antonio Navarro Pérez, Andrei Voronkov. 302-316 [doi]
- The Relative Power of Semantics and UnificationDavid A. Plaisted, Swaha Miller. 317-344 [doi]
- First-Order Resolution Methods for Modal LogicsRenate A. Schmidt, Ullrich Hustadt. 345-391 [doi]
- On Combinations of Local Theory ExtensionsViorica Sofronie-Stokkermans. 392-413 [doi]
- Interprocedural Shape Analysis for Effectively Cutpoint-Free ProgramsJörg Kreiker, Thomas W. Reps, Noam Rinetzky, Mooly Sagiv, Reinhard Wilhelm, Eran Yahav. 414-445 [doi]