11. LPAR 2004: Montevideo, Uruguay

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

Last update Mon Feb 13 04:36:45 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page