CSL B

25 papers

YearTitle / Authors
1988CSL '87, 1st Workshop on Computer Science Logic, Karlsruhe, Germany, October 12-16, 1987, Proceedings
Egon Börger, Hans Kleine Büning, Michael M. Richter
1987A Survey of Rewrite Systems.
Peter H. Schmitt
1987Algebraic Operational Semantics and Modula-2.
Yuri Gurevich, James M. Morris
1987Algorithms for Propositional Updates.
Andreas Weber
1987Complexity Cores and Hard-To-Prove Formulas.
Uwe Schöning
1987Deciding the Path- and Word-Fair Equivalence Problem.
Ralf Rehrmann, Lutz Priese
1987Developing Logic Programs: Computing Through Normalizing.
Olga Stepánková, Petr Stepánek
1987Diagonalizing over Deterministic Polynomial Time.
Klaus Ambos-Spies, Hans Fleischhack, Hagen Huwig
1987Induction in the Elementary Theory of Types and Names.
Gerhard Jäger
1987Interfacing a Logic Machine.
Wolfgang Schönfeld
1987Is SETL a Suitable Language for Parallel Programming - A Theoretical Approach.
Elias Dahlhaus
1987Learning by Teams from Examples with Errors.
Reinhard Rinn, Britta Schinzel
1987Logic of Approximation Reasoning.
Helena Rasiowa
1987Loose Diagrams, Semigroupoids, Categories, Groupoids and Iteration.
Giorgio Germano, Stefano Mazzanti
1987Model Theory of Deductive Databases.
Hugo Volger
1987On Functions Computable in Nondeterministic Polynomial Time: Some Characterizations.
Dieter Spreen
1987On Type Inference for Object-Oriented Programming Languages.
Hans Leiß
1987On the Average Case Complexity of Backtracking for the Exact-Satisfiability Problem.
Ewald Speckenmeyer
1987On the Computational Complexity of Quantified Horn Clauses.
Marek Karpinski, Hans Kleine Büning, Peter H. Schmitt
1987Optimization Aspects of Logical Formulas.
Ulrich Löwen
1987Program Verification Using Dynamic Logic.
Maritta Heisel, Wolfgang Reif, Werner Stephan
1987Proving Finite Satisfiability of Deductive Databases.
François Bry, Rainer Manthey
1987Resolution with Feature Unification.
Karl-Hans Bläsius, Ulrich Hedtstück
1987Surjectivity for Finite Sets of Combinators by Weak Reduction.
Corrado Böhm, Adolfo Piperno
1987The Conjunctive Complexity of Quadratic Boolean Functions.
Katja Lenz, Ingo Wegener