Egon Börger, Hans Kleine Büning, Michael M. Richter, Wolfgang Schönfeld
Proceedings of the Fourth Workshop on Computer Science Logic
CSL, 1990.

@proceedings{CSL-1990,
	address       = "Heidelberg, Germany",
	editor        = "Egon Börger and Hans Kleine Büning and Michael M. Richter and Wolfgang Schönfeld",
	isbn          = "3-540-54487-9",
	publisher     = "{Springer-Verlag}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the Fourth Workshop on Computer Science Logic}",
	volume        = 533,
	year          = 1990,
}

Contents (24 items)

4 ×#logic
4 ×#proving
3 ×#bound
3 ×#on the
3 ×#performance
3 ×#prolog
2 ×#algorithm
2 ×#complexity
2 ×#problem
2 ×#set

CSL-1990-ArnborgPS #automaton #higher-order #logic #monad

Monadic Second Order Logic, Tree Automata and Forbidden Minors (SA, AP, DS), pp. 1–16.

CSL-1990-BlassG #complexity #on the #reduction

On the Reduction Theory for Average Case Complexity (AB, YG), pp. 17–30.

CSL-1990-BorgerR #algebra #implementation #prolog #towards

From Prolog Algebras Towards WAM — A Mathematical Study of Implementation (EB, DR), pp. 31–66.

CSL-1990-BorgerS #prolog #semantics

A Formal Operational Semantics for Languages of Type Prolog III (EB, PHS), pp. 67–79.

CSL-1990-Burgard #logic programming #performance #source code

Efficiency Considerations on Goal-Directed Chaining for Logic Programs (WB), pp. 80–94.

CSL-1990-CantoneCS #problem #set

Decision Problems for Tarski and Presburger Arithmetics Extended With Sets (DC, VC, JTS), pp. 95–109.

CSL-1990-Durdanovic #algorithm #garbage collection #performance #prolog

A Fast Garbage Collection Algorithm for WAM-Based Prolog (ID), pp. 110–127.

CSL-1990-Fermuller #set

A Resolution Variant Deciding some Classes of Clause Sets (CGF), pp. 128–144.

CSL-1990-FlogelKB #quantifier #subclass

Subclasses of Quantified Boolean Formulas (AF, MK, HKB), pp. 145–155.

CSL-1990-Gabbay #algorithm #proving

Algorithmic Proof with Diminishing Resources, Part 1 (DMG), pp. 156–173.

CSL-1990-Goerdt #proving

Cuting Plane Versus Frege Proof Systems (AG), pp. 174–194.

CSL-1990-GrandjeanR #memory management #ram #robust

RAM with Compact Memory: A Realistic and Robust Model of Computation (EG, JMR), pp. 195–233.

CSL-1990-Habart

Randomness and Turing Reducibility Restraints (KH), pp. 234–247.

CSL-1990-Hahnle #logic #multi #performance #proving #towards

Towards an Efficient Tableau Proof Procedure for Multiple-Valued Logics (RH), pp. 248–260.

CSL-1990-HertrampfW #bound #fault #interactive #proving

Interactive Proof Systems: Provers, Rounds, and Error Bounds (UH, KWW), pp. 261–273.

CSL-1990-Huang #dependence #logic

Logics for Belief Dependence (ZH), pp. 274–288.

CSL-1990-Jaspars #information management

A Generalization of Stability and its Application to Circumscription of Positive Introspective Knowledge (JJ), pp. 289–299.

CSL-1990-Mundici #adaptation #complexity

The Complexity of Adaptive Error-Correcting Codes (DM), pp. 300–307.

CSL-1990-Pudlak #bound #theorem

Ramsey’s Theorem in Bounded Arithmetic (PP), pp. 308–317.

CSL-1990-Ranaivoson #bound #graph #problem

Nontrivial Lower Bounds for some NP-Problems on Directed Graphs (SR), pp. 318–339.

CSL-1990-Rauszer #modelling

Expansions and Models of Autoepistemic Theories (CR), pp. 340–353.

CSL-1990-Stark #fixpoint #logic #on the

On the Existence of Fixpoints in Moore’s Autoepistemic Logic and the Non-Monotonic Logic of McDermott and Doyle (RFS), pp. 354–365.

CSL-1990-Szabo #automation #deduction #on the

On the Tracking of Loops in Automated Deductions (MES), pp. 366–388.

CSL-1990-Vollmer #revisited

The Gap-Language-Technique Revisited (HV), pp. 389–399.