CSL B

29 papers

YearTitle / Authors
1990CSL '89, 3rd Workshop on Computer Science Logic, Kaiserslautern, Germany, October 2-6, 1989, Proceedings
Egon Börger, Hans Kleine Büning, Michael M. Richter
1989A Concurrent Branching Time Temporal Logic.
Wojciech Penczek
1989A Direct Proof for the Completeness of SLD-Resolution.
Robert F. Stärk
1989A Logical Operational Semantics of Full Prolog. Part I: Selection Core and Control.
Egon Börger
1989A Predicate Calculus with Control of Derivations.
Daniel Mey
1989A Quantifier-Free Completion of Logic Programs.
Robert F. Stärk
1989A Streamlined Temporal Completeness Theorem.
Ana Pasztor, Ildikó Sain
1989Algebraic Operational Semantics and Occam.
Yuri Gurevich, Lawrence S. Moss
1989Davis-Putnam Resolution versus Unrestricted Resolution.
Andreas Goerdt
1989Deciding Horn Classes by Hyperresolution.
Alexander Leitsch
1989Effectively Given Information Systems and Domains.
Manfred Droste, Rüdiger Göbel
1989Generalizing Allowedness While Retaining Completeness of SLDNF-Resolution.
Hendrik Decker, Lawrence Cavedon
1989Honest Polynomial-Time Degrees of Elementary Recursive Sets.
Klaus Ambos-Spies, Dongping Yang
1989New Ways for Developing Proof Theories for First-Order Multi Modal Logics.
Hans Jürgen Ohlbach
1989Omega-Branching Programs of Bounded Width.
Christoph Meinel
1989On Logical Descriptions of Some Concepts in Structural Complexity Theory.
Erich Grädel
1989On Test Classes for Universal Theories.
Bernd I. Dahn
1989On the Average Time Complexity of Set Partitioning.
Ewald Speckenmeyer, Rainer Kemp
1989On the Representation of Data in Lambda-Calculus.
Michel Parigot
1989On the Verification of Modules.
Grigoris Antoniou, Volker Sperschneider
1989Polymorphic Recursion and Semi-Unification.
Hans Leiß
1989Propositional Provability and Models of Weak Arithmetic.
Jan Krajícek, Pavel Pudlák
1989Reducibility of Monotone Formulas to µ-Formulas.
Daniele Mundici
1989Semantic for Abstract Fairness using Metric Spaces.
Lutz Priese, Doris Nolte
1989Sequential Representation of Primitive Recursive Functions, and Complexity Classes.
Elisabeth Wette
1989Set-Theoretic Reductions of Hilbert's Tenth Problem.
Domenico Cantone, Vincenzo Cutello, Alberto Policriti
1989Stratification of Definite Clause Programs and of General Logic Programs.
Olga Stepánková, Petr Stepánek
1989The Complexity of Subtheories of the Existential Linear Theory of Reals.
Elias Dahlhaus
1989The Semantics of Disjunctive Deductive Databases.
Hugo Volger