Egon Börger, Hans Kleine Büning, Michael M. Richter
Proceedings of the Second Workshop on Computer Science Logic
CSL, 1988.

@proceedings{CSL-1988,
	address       = "Duisburg, Germany",
	editor        = "Egon Börger and Hans Kleine Büning and Michael M. Richter",
	isbn          = "3-540-51659-X",
	publisher     = "{Springer-Verlag}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the Second Workshop on Computer Science Logic}",
	volume        = 385,
	year          = 1988,
}

Contents (24 items)

6 ×#logic
5 ×#complexity
4 ×#on the
4 ×#source code
3 ×#problem
3 ×#prolog
2 ×#nondeterminism

CSL-1988-Ambos-SpiesK #on the #self

On Disjunctive Self-Reducibility (KAS, JK), pp. 1–13.

CSL-1988-BeierleDPRSS #information management #representation

The Knowledge Representation Language LLILOG (CB, JD, UP, CRR, PHS, RS), pp. 14–51.

CSL-1988-Dahlhaus #nondeterminism #polynomial

Completeness with Respect to Interpretations in Deterministic and Nondeterministic Polynomial Time (ED), pp. 52–62.

CSL-1988-DaneluttoM #approach #concurrent #finite #logic

A temporal Logic Approach to Specify and to Prove Properties of Finite State Concurrent Systems (MD, AM), pp. 63–79.

CSL-1988-Eder #calculus #comparison

A Comparison of the Resolution Caculus and the Connection Method, and a new Calculus Generalizing Both Methods (EE), pp. 80–98.

CSL-1988-Goerdt #complexity #recursion

Characterizing Complexity Classes by General Recursive Definitions in Higher Types (AG), pp. 99–117.

CSL-1988-Gradel #complexity #modelling #nondeterminism

Size of Models versus Length of Computations: On Inseparability by Nondeterministic Time Complexity Classes (EG), pp. 118–137.

CSL-1988-Karpinski #algebra #complexity #problem

Boolean Complexity of Algebraic Interpolation Problems (MK), pp. 138–147.

CSL-1988-BuningLS #detection #prolog #source code

Loop Detection in Propositional Prolog Programs (HKB, UL, SS), pp. 148–165.

CSL-1988-Kummer

Numberings of R1 union F (MK), pp. 166–186.

CSL-1988-Lippert #logic

Interval Temporal Logic and Star-Free Expressions (DL), pp. 187–198.

CSL-1988-Luttringhaus #evaluation #interpreter #lazy evaluation #prolog

An Interpreter with Lazy Evaluation for Prolog with Functions (SL), pp. 199–225.

CSL-1988-Niemela #complexity #logic #on the #problem

On the Complexity of the Decision Problem in Propositional Nonmonotonic Logic (IN), pp. 226–239.

CSL-1988-Paech #logic

Gentzen-Systems for Propositional Temporal Logics (BP), pp. 240–253.

CSL-1988-Plumer #automation #prolog #proving #source code #termination

Predicate Inequalities as a Basis for Automated Termination Proofs for Prolog Programs (LP), pp. 254–271.

CSL-1988-Priese #on the

On the Existence of Fair Schedulers (LP), pp. 272–287.

CSL-1988-SaakeL #database #logic #specification #using

Using Finite-Linear Temporal Logic for Specifying Database Dynamics (GS, UWL), pp. 288–300.

CSL-1988-Speckenmeyer #question

Is Average Superlinear Speedup Possible? (ES), pp. 301–312.

CSL-1988-SudkampK #constraints #semantics

Enforcement of Integrity Constraints in a Semantic Data Model (NS, PK), pp. 313–328.

CSL-1988-Schatz

Delete Operations and Horn Formulas (RS), pp. 329–343.

CSL-1988-SchonfeldS #integration

Integration of Descriptive and Procedural Language Constructs (WS, WS), pp. 344–356.

CSL-1988-OchozkaSS #complexity #logic programming #normalisation #source code

Normal Forms and the Complexity of Computations of Logic Programs (VO, OS, PS), pp. 357–371.

CSL-1988-VoigtW

A Remark on Minimal Polynomials of Boolean Functions (BV, IW), pp. 372–383.

CSL-1988-Wagner #automaton #logic #on the #problem #source code

On the Emptiness Problem of Tree Automata and Completeness of Modal Logics of Programs (HW), pp. 384–399.