Egon Börger, Gerhard Jäger, Hans Kleine Büning, Michael M. Richter
Proceedings of the Fifth Workshop on Computer Science Logic
CSL, 1991.

@proceedings{CSL-1991,
	address       = "Berne, Switzerland",
	editor        = "Egon Börger and Gerhard Jäger and Hans Kleine Büning and Michael M. Richter",
	isbn          = "3-540-55789-X",
	publisher     = "{Springer-Verlag}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the Fifth Workshop on Computer Science Logic}",
	volume        = 626,
	year          = 1991,
}

Contents (32 items)

9 ×#logic
6 ×#proving
4 ×#on the
3 ×#semantics
3 ×#transitive
2 ×#automaton
2 ×#bound
2 ×#data type
2 ×#first-order
2 ×#query

CSL-1991-BarguryM #automaton #multi #power of #transitive

The Expressive Power of Transitive Closue and 2-way Multihead Automata (YB, JAM), pp. 1–14.

CSL-1991-BeierleB #correctness #proving

Correctness Proof For the WAM with Types (CB, EB), pp. 15–34.

CSL-1991-BestE #model checking #persistent #petri net

Model Checking of Persistent Petri Nets (EB, JE), pp. 35–52.

CSL-1991-ChirimarL

Provability in TBLL: A Decision Procedure (JC, JL), pp. 53–67.

CSL-1991-Dahlhaus #first-order #how #memory management #modelling

How to Implement First Order Formulas in Local Memory Machine Models (ED), pp. 68–78.

CSL-1991-Feferman #approach #data type

A New Approach to Abstract Data Types II: Computation on ADTs as Ordinary Computation (SF), pp. 79–95.

CSL-1991-Fernando #bisimulation #complexity #logic #recursion #set

A Primitive Recursive Set Theory and AFA: On the Logical Complexity of the Largest Bisimulation (TF), pp. 96–110.

CSL-1991-Flum #bound #on the

On Bounded Theories (JF), pp. 111–118.

CSL-1991-Goerdt #bound #proving

The Cutting Plane Proof System with Bounded Degree of Falsity (AG), pp. 119–133.

CSL-1991-Gonzalez-MorenoHR #declarative #functional #programming #semantics

Denotational Versus Declarative Semantics for Functional Programming (JCGM, MTHG, MRA), pp. 134–148.

CSL-1991-Gradel #logic #on the #transitive

On Transitive Closure Logic (EG), pp. 149–163.

CSL-1991-HeuschS #aspect-oriented #behaviour #probability

Some Aspects of the Probabilistic Behavior of Variants of Resolution (PH, ES), pp. 164–172.

CSL-1991-Hirshfeld #database #query #relational

Safe Queries in Relational Databases with Functions (YH), pp. 173–183.

CSL-1991-Hooker #logic

Logical Inference and Polyhedral Projection (JNH), pp. 184–200.

CSL-1991-Bosli #logic

Stable Logic (BB), pp. 201–212.

CSL-1991-RaoKS #logic programming #proving #source code #termination

A Transformational Methodology for Proving Termination of Logic Programs (MRKKR, DK, RKS), pp. 213–226.

CSL-1991-Lehmann #logic

Plausibility Logic (DJL), pp. 227–241.

CSL-1991-Leiss #algebra #recursion #towards

Towards Kleene Algebra with Recursion (HL), pp. 242–256.

CSL-1991-Meinke #combinator #data type #equation #specification

Equational Specification of Abstract Types and Combinators (KM), pp. 257–271.

CSL-1991-Mundici #logic #normalisation

Normal Forms in Infinite-Valued Logic: The Case of One Variable (DM), pp. 272–277.

CSL-1991-Oguztuzun #equivalence #first-order #logic

A Fragment of First Order Logic Adequate for Observation Equivalence (HO), pp. 278–292.

CSL-1991-Pinchinat #comparative #concurrent #process #semantics

Ordinal Processes in Comparative Concurrency Semantics (SP), pp. 293–305.

CSL-1991-Lavalette #composition #logic #semantics

Logical Semantics of Modularisation (GRRdL), pp. 306–315.

CSL-1991-Schmerl #proving #source code

A Cut-Elimination Procedure Designed for Evaluating Proofs as Programs (URS), pp. 316–325.

CSL-1991-Schwichtenberg #proving

Minimal from Classical Proofs (HS), pp. 326–328.

CSL-1991-Seibert #quantifier #word

Quantifier Hierarchies over Word Relations (SS), pp. 329–352.

CSL-1991-Stewart #on the

On Completeness for NP via Projection Translations (IAS), pp. 353–366.

CSL-1991-ThistleW #automaton #problem

Control of ω-Automata, Church’s Problem, and the Emptiness Problem for Tree ω-Automata (JGT, WMW), pp. 367–382.

CSL-1991-Troelstra #formal method

Comparing the Theory of Representations and Constructive Mathematics (AST), pp. 383–395.

CSL-1991-Tyszkiewicz #logic #query #transitive

Infinitary Queries and Their Asymptotic Probabilities I: Properties Definable in Transitive Closue Logic (JT), pp. 396–410.

CSL-1991-Voronkov #on the #synthesis

On Completeness of Program Synthesis Systems (AV), pp. 411–418.

CSL-1991-Weiermann #proving #term rewriting #termination

Proving Termination for Term Rewriting Systems (AW), pp. 419–428.