External Links

    Journal: Inf. Comput.

    Volume 183, Issue 2

    139 -- 0Aart Middeldorp. Preface
    140 -- 164Alessandro Armando, Silvio Ranise, Michaël Rusinowitch. A rewriting approach to satisfiability procedures
    165 -- 186Konstantin Korovin, Andrei Voronkov. Orienting rewrite rules with the Knuth-Bendix order
    187 -- 211Michio Oyamaguchi, Yoshikatsu Ohta. The unification problem for confluent right-ground term rewriting systems
    212 -- 244René Vestergaard, James Brotherston. A formalised first-order confluence proof for the -calculus using one-sorted variable names
    245 -- 274Jens R. Woinowski. The context-splittable normal form for Church-Rosser language systems

    Volume 183, Issue 1

    1 -- 0Anuj Dawar, Daniel Leivant. Guest editorial
    2 -- 18Jean-Yves Marion. Analysing the implicit complexity of programs
    19 -- 42Ulrich Berger, Matthias Eberl, Helmut Schwichtenberg. Term rewriting for normalization by evaluation
    43 -- 56Dieter Hofbauer. An upper bound on the derivational complexity of Knuth-Bendix orderings
    57 -- 85Martin Hofmann. Linear types and non-size-increasing polynomial time computation
    86 -- 103Frank Neven, Thomas Schwentick. On the power of tree-walking automata
    104 -- 122Georg Gottlob, Christos H. Papadimitriou. On the complexity of single-rule datalog queries
    123 -- 137Vincent Danos, Jean-Baptiste Joinet. Linear logic and elementary time
    runs on