Abstract is missing.
- From Hilbert s Program to a Logic ToolboxJohann A. Makowsky. 1 [doi]
- On the Notion of Vacuous TruthMarko Samer, Helmut Veith. 2-14 [doi]
- Whatever Happened to Deductive Question Answering?Richard J. Waldinger. 15-16 [doi]
- Decidable Fragments of Many-Sorted LogicAharon Abadi, Alexander Moshe Rabinovich, Mooly Sagiv. 17-31 [doi]
- One-Pass Tableaux for Computation Tree LogicPietro Abate, Rajeev Goré, Florian Widmann. 32-46 [doi]
- Extending a Resolution Prover for Inequalities on Elementary FunctionsBehzad Akbarpour, Lawrence C. Paulson. 47-61 [doi]
- Model Checking the First-Order Fragment of Higher-Order Fixpoint LogicRoland Axelsson, Martin Lange. 62-76 [doi]
- Monadic Fragments of Gödel Logics: Decidability and Undecidability ResultsMatthias Baaz, Agata Ciabattoni, Christian G. Fermüller. 77-91 [doi]
- Least and Greatest Fixed Points in Linear LogicDavid Baelde, Dale Miller. 92-106 [doi]
- The Semantics of Consistency and Trust in Peer Data Exchange SystemsLeopoldo E. Bertossi, Loreto Bravo. 107-122 [doi]
- Completeness and Decidability in Sequence LogicMarc Bezem, Tore Langholm, Michal Walicki. 123-137 [doi]
- HORPO with Computability Closure: A ReconstructionFrédéric Blanqui, Jean-Pierre Jouannaud, Albert Rubio. 138-150 [doi]
- Zenon : An Extensible Automated Theorem Prover Producing Checkable ProofsRichard Bonichon, David Delahaye, Damien Doligez. 151-165 [doi]
- Matching in Hybrid TerminologiesSebastian Brandt. 166-180 [doi]
- Verifying Cryptographic Protocols with Subterms ConstraintsYannick Chevalier, Denis Lugiez, Michaël Rusinowitch. 181-195 [doi]
- Deciding Knowledge in Security Protocols for Monoidal Equational TheoriesVéronique Cortier, Stéphanie Delaune. 196-210 [doi]
- Mechanized Verification of CPS TransformationsZaynah Dargaye, Xavier Leroy. 211-225 [doi]
- Operational and Epistemic Approaches to Protocol Analysis: Bridging the GapFrancien Dechesne, Mohammad Reza Mousavi, Simona Orzan. 226-241 [doi]
- Protocol Verification Via Rigid/Flexible ResolutionStéphanie Delaune, Hai Lin, Christopher Lynch. 242-256 [doi]
- Preferential Description LogicsLaura Giordano, Valentina Gliozzi, Nicola Olivetti, Gian Luca Pozzato. 257-272 [doi]
- On Two Extensions of Abstract Categorial GrammarsPhilippe de Groote, Sarah Maarek, Ryo Yoshinaka. 273-287 [doi]
- Why Would You Trust ::::B:::: ?Éric Jaeger, Catherine Dubois. 288-302 [doi]
- How Many Legs Do I Have? Non-Simple Roles in Number Restrictions RevisitedYevgeny Kazakov, Ulrike Sattler, Evgeny Zolin. 303-317 [doi]
- On Finite Satisfiability of the Guarded Fragment with Equivalence or Transitive GuardsEmanuel Kieronski, Lidia Tendera. 318-332 [doi]
- Data Complexity in the ::::EL:::: Family of Description LogicsAdila Krisnadhi, Carsten Lutz. 333-347 [doi]
- An Extension of the Knuth-Bendix Ordering with LPO-Like PropertiesMichel Ludwig, Uwe Waldmann. 348-362 [doi]
- Retractile Proof Nets of the Purely Multiplicative and Additive Fragment of Linear LogicRoberto Maieli. 363-377 [doi]
- Integrating Inductive Definitions in SATMaarten Mariën, Johan Wittocx, Marc Denecker. 378-392 [doi]
- The Separation Theorem for Differential Interaction NetsDamiano Mazza, Michele Pagani. 393-407 [doi]
- Complexity of Planning in Action Formalisms Based on Description LogicsMaja Milicic. 408-422 [doi]
- Faster Phylogenetic Inference with MXGDavid G. Mitchell, Faraz Hach, Raheleh Mohebali. 423-437 [doi]
- Enriched µ-Calculus Pushdown Module CheckingAlessandro Ferrante, Aniello Murano, Mimmo Parente. 438-453 [doi]
- Approved Models for Normal Logic ProgramsLuís Moniz Pereira, Alexandre Miguel Pinto. 454-468 [doi]
- Permutative Additives and ExponentialsGabriele Pulcini. 469-483 [doi]
- Algorithms for Propositional Model CountingMarko Samer, Stefan Szeider. 484-498 [doi]
- Completeness for Flat Modal Fixpoint LogicsLuigi Santocanale, Yde Venema. 499-513 [doi]
- /mathbb::::FDNC::::: Decidable Non-monotonic Disjunctive Logic Programs with Function SymbolsMantas Simkus, Thomas Eiter. 514-530 [doi]
- The Complexity of Temporal Logic with Until and Since over OrdinalsStéphane Demri, Alexander Rabinovich. 531-545 [doi]
- ATP Cross-Verification of the Mizar MPTP Challenge ProblemsJosef Urban, Geoff Sutcliffe. 546-560 [doi]