Abstract is missing.
- CERES in Many-Valued LogicsMatthias Baaz, Alexander Leitsch. 1-20 [doi]
- A Decomposition Rule for Decision Procedures by Resolution-Based CalculiUllrich Hustadt, Boris Motik, Ulrike Sattler. 21-35 [doi]
- Abstract DPLL and Abstract DPLL Modulo TheoriesRobert Nieuwenhuis, Albert Oliveras, Cesare Tinelli. 36-50 [doi]
- Combining Lists with Non-stably Infinite TheoriesPascal Fontaine, Silvio Ranise, Calogero G. Zarba. 51-66 [doi]
- Abstract Model Generation for Preprocessing Clause SetsMiyuki Koshimura, Mayumi Umeda, Ryuzo Hasegawa. 67-78 [doi]
- Flat and One-Variable Clauses: Complexity of Verifying Cryptographic Protocols with Single Blind CopyingHelmut Seidl, Kumar Neeraj Verma. 79-94 [doi]
- Applications of General Exact Satisfiability in Propositional Logic ModellingVilhelm Dahllöf. 95-109 [doi]
- BCiC: A System for Code Authentication and VerificationNathan Whitehead, Martín Abadi. 110-124 [doi]
- Ordered Resolution with Selection for H(@)Carlos Areces, Daniel Gorín. 125-141 [doi]
- On a Semantic Subsumption TestJerzy Marcinkowski, Jan Otop, Grzegorz Stelmaszek. 142-153 [doi]
- Suitable Graphs for Answer Set ProgrammingThomas Linke, Vladimir Sarsakov. 154-168 [doi]
- Weighted Answer Sets and Applications in Intelligence AnalysisDavy Van Nieuwenborgh, Stijn Heymans, Dirk Vermeir. 169-183 [doi]
- How to Fix It: Using Fixpoints in Different ContextsIgor Walukiewicz. 184-193 [doi]
- Reasoning About Systems with Transition FairnessBenjamin Aminof, Thomas Ball, Orna Kupferman. 194-208 [doi]
- Entanglement - A Measure for the Complexity of Directed Graphs with Applications to Logic and GamesDietmar Berwanger, Erich Grädel. 209-223 [doi]
- How the Location of * Influences Complexity in Kleene Algebra with TestsChristopher Hardin. 224-239 [doi]
- The Equational Theory of < N, 0, 1, +, ×, uparrow > Is Decidable, but Not Finitely AxiomatisableRoberto Di Cosmo, Thomas Dufour. 240-256 [doi]
- A Trichotomy in the Complexity of Propositional CircumscriptionGustav Nordh. 257-269 [doi]
- Exploiting Fixable, Removable, and Implied Values in Constraint Satisfaction ProblemsLucas Bordeaux, Marco Cadoli, Toni Mancini. 270-284 [doi]
- Evaluating QBFs via Symbolic SkolemizationMarco Benedetti. 285-300 [doi]
- The Dependency Pair Framework: Combining Techniques for Automated Termination ProofsJürgen Giesl, René Thiemann, Peter Schneider-Kamp. 301-331 [doi]
- Automated Termination Analysis for Incompletely Defined ProgramsChristoph Walther, Stephan Schweitzer. 332-346 [doi]
- Automatic Certification of Heap ConsumptionLennart Beringer, Martin Hofmann, Alberto Momigliano, Olha Shkaravska. 347-362 [doi]
- A Formalization of Off-Line Guessing for Security Protocol AnalysisPaul Hankes Drielsma, Sebastian Mödersheim, Luca Viganò. 363-379 [doi]
- Abstraction-Carrying CodeElvira Albert, Germán Puebla, Manuel V. Hermenegildo. 380-397 [doi]
- A Verification Environment for Sequential Imperative Programs in Isabelle/HOLNorbert Schirmer. 398-414 [doi]
- Can a Higher-Order and a First-Order Theorem Prover Cooperate?Christoph Benzmüller, Volker Sorge, Mateja Jamnik, Manfred Kerber. 415-431 [doi]
- A Generic Framework for Interprocedural Analyses of Numerical PropertiesMarkus Müller-Olm, Helmut Seidl. 432-432 [doi]
- Second-Order Matching via Explicit SubstitutionsFlávio L. C. de Moura, Fairouz Kamareddine, Mauricio Ayala-Rincón. 433-448 [doi]
- Knowledge-Based Synthesis of Distributed Systems Using Event StructuresMark Bickford, Robert L. Constable, Joseph Y. Halpern, Sabina Petride. 449-465 [doi]
- The Inverse Method for the Logic of Bunched ImplicationsKevin Donnelly, Tyler Gibson, Neel Krishnaswami, Stephen Magill, Sungwoo Park. 466-480 [doi]
- Cut-Elimination: Experiments with CERESMatthias Baaz, Stefan Hetzl, Alexander Leitsch, Clemens Richter, Hendrik Spohr. 481-495 [doi]
- Uniform Rules and Dialogue Games for Fuzzy LogicsAgata Ciabattoni, Christian G. Fermüller, George Metcalfe. 496-510 [doi]
- Nonmonotonic Description Logic Programs: Implementation and ExperimentsThomas Eiter, Giovambattista Ianni, Roman Schindlauer, Hans Tompits. 511-527 [doi]
- Implementing Efficient Resource Management for Linear Logic ProgrammingPablo López, Jeff Polakow. 528-543 [doi]
- Layered Clausal Resolution in the Multi-modal Logic of Beliefs and GoalsM. Jamshid Bagherzadeh, S. Arun-Kumar. 544-559 [doi]