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