Proceedings of the First Workshop on Computer Science Logic
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

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

TEST
DBLP
Scholar
Full names Links ISxN
@proceedings{CSL-1987,
	address       = "Karlsruhe, Germany",
	editor        = "Egon Börger and Hans Kleine Büning and Michael M. Richter",
	isbn          = "3-540-50241-6",
	publisher     = "{Springer-Verlag}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the First Workshop on Computer Science Logic}",
	volume        = 329,
	year          = 1987,
}

Contents (24 items)

CSL-1987-Ambos-SpiesFH #polynomial
Diagonalizing over Deterministic Polynomial Time (KAS, HF, HH), pp. 1–16.
CSL-1987-BlasiusH #unification
Resolution with Feature Unification (KHB, UH), pp. 17–26.
CSL-1987-BohmP #combinator #finite #reduction #set
Surjectivity for Finite Sets of Combinators by Weak Reduction (CB, AP), pp. 27–43.
CSL-1987-BryM #database #deduction #finite #proving #satisfiability
Proving Finite Satisfiability of Deductive Databases (FB, RM), pp. 44–55.
CSL-1987-Dahlhaus #approach #parallel #programming
Is SETL a Suitable Language for Parallel Programming — A Theoretical Approach (ED), pp. 56–63.
CSL-1987-GermanoM #category theory #diagrams
Loose Diagrams, Semigroupoids, Categories, Groupoids and Iteration (GG, SM), pp. 64–80.
CSL-1987-GurevichM #algebra #semantics
Algebraic Operational Semantics and Modula-2 (YG, JMM), pp. 81–101.
CSL-1987-HeiselRS #logic #using #verification
Program Verification Using Dynamic Logic (MH, WR, WS), pp. 102–117.
CSL-1987-Jager #induction
Induction in the Elementary Theory of Types and Names (GJ), pp. 118–128.
CSL-1987-KarpinskiBS #complexity #horn clause #on the #quantifier
On the Computational Complexity of Quantified Horn Clauses (MK, HKB, PHS), pp. 129–137.
CSL-1987-LenzW #complexity #polynomial
The Conjunctive Complexity of Quadratic Boolean Functions (KL, IW), pp. 138–150.
CSL-1987-Leiss #object-oriented #on the #programming language #type inference
On Type Inference for Object-Oriented Programming Languages (HL), pp. 151–172.
CSL-1987-Lowen #aspect-oriented #logic #optimisation
Optimization Aspects of Logical Formulas (UL), pp. 173–187.
CSL-1987-Rasiowa #approximate #logic #reasoning
Logic of Approximation Reasoning (HR), pp. 188–210.
CSL-1987-RehrmannP #equivalence #problem
Deciding the Path- and Word-Fair Equivalence Problem (RR, LP), pp. 211–222.
CSL-1987-RinnS #fault #learning
Learning by Teams from Examples with Errors (RR, BS), pp. 223–234.
CSL-1987-Schmitt #overview #term rewriting
A Survey of Rewrite Systems (PHS), pp. 235–262.
CSL-1987-Schonfeld #logic
Interfacing a Logic Machine (WS), pp. 263–272.
CSL-1987-Schoning #complexity
Complexity Cores and Hard-To-Prove Formulas (US), pp. 273–280.
CSL-1987-Speckenmeyer #backtracking #complexity #on the #problem #satisfiability
On the Average Case Complexity of Backtracking for the Exact-Satisfiability Problem (ES), pp. 281–288.
CSL-1987-Spreen #nondeterminism #on the #polynomial
On Functions Computable in Nondeterministic Polynomial Time: Some Characterizations (DS), pp. 289–303.
CSL-1987-StepankovaS #logic programming #normalisation #source code
Developing Logic Programs: Computing Through Normalizing (OS, PS), pp. 304–321.
CSL-1987-Volger #database #deduction
Model Theory of Deductive Databases (HV), pp. 322–334.
CSL-1987-Weber #algorithm
Algorithms for Propositional Updates (AW0), pp. 335–346.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.