4. CSL 1990: Heidelberg, Germany

Egon Börger, Hans Kleine Büning, Michael M. Richter, Wolfgang Schönfeld (Eds.): Computer Science Logic, 4th Workshop, CSL '90, Heidelberg, Germany, October 1-5, 1990, Proceedings. Lecture Notes in Computer Science 533 Springer 1991, ISBN 3-540-54487-9 BibTeX

@proceedings{DBLP:conf/csl/1990,
  editor    = {Egon B{\"o}rger and
               Hans Kleine B{\"u}ning and
               Michael M. Richter and
               Wolfgang Sch{\"o}nfeld},
  title     = {Computer Science Logic, 4th Workshop, CSL '90, Heidelberg, Germany,
               October 1-5, 1990, Proceedings},
  booktitle = {CSL},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {533},
  year      = {1991},
  isbn      = {3-540-54487-9},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Stefan Arnborg, Andrzej Proskurowski, Detlef Seese: Monadic Second Order Logic, Tree Automata and Forbidden Minors. 1-16 BibTeX
Andreas Blass, Yuri Gurevich: On the Reduction Theory for Average Case Complexity. 17-30 BibTeX
Egon Börger, Dean Rosenzweig: From Prolog Algebras Towards WAM - A Mathematical Study of Implementation. 31-66 BibTeX
Egon Börger, Peter H. Schmitt: A Formal Operational Semantics for Languages of Type Prolog III. 67-79 BibTeX
Wolfram Burgard: Efficiency Considerations on Goal-Directed Chaining for Logic Programs. 80-94 BibTeX
Domenico Cantone, Vincenzo Cutello, Jacob T. Schwartz: Decision Problems for Tarski and Presburger Arithmetics Extended With Sets. 95-109 BibTeX
Igor Durdanovic: A Fast Garbage Collection Algorithm for WAM-Based Prolog. 110-127 BibTeX
Christian G. Fermüller: A Resolution Variant Deciding some Classes of Clause Sets. 128-144 BibTeX
Andreas Flögel, Marek Karpinski, Hans Kleine Büning: Subclasses of Quantified Boolean Formulas. 145-155 BibTeX
Dov M. Gabbay: Algorithmic Proof with Diminishing Resources, Part 1. 156-173 BibTeX
Andreas Goerdt: Cuting Plane Versus Frege Proof Systems. 174-194 BibTeX
Etienne Grandjean, J. M. Robson: RAM with Compact Memory: A Realistic and Robust Model of Computation. 195-233 BibTeX
Karol Habart: Randomness and Turing Reducibility Restraints. 234-247 BibTeX
Reiner Hähnle: Towards an Efficient Tableau Proof Procedure for Multiple-Valued Logics. 248-260 BibTeX
Ulrich Hertrampf, Klaus W. Wagner: Interactive Proof Systems: Provers, Rounds, and Error Bounds. 261-273 BibTeX
Zhisheng Huang: Logics for Belief Dependence. 274-288 BibTeX
Jan Jaspars: A Generalization of Stability and its Application to Circumscription of Positive Introspective Knowledge. 289-299 BibTeX
Daniele Mundici: The Complexity of Adaptive Error-Correcting Codes. 300-307 BibTeX
Pavel Pudlák: Ramsey's Theorem in Bounded Arithmetic. 308-317 BibTeX
Solomampionona Ranaivoson: Nontrivial Lower Bounds for some NP-Problems on Directed Graphs. 318-339 BibTeX
Cecylia Rauszer: Expansions and Models of Autoepistemic Theories. 340-353 BibTeX
Robert F. Stärk: On the Existence of Fixpoints in Moore's Autoepistemic Logic and the Non-Monotonic Logic of McDermott and Doyle. 354-365 BibTeX
M. E. Szabo: On the Tracking of Loops in Automated Deductions. 366-388 BibTeX
Heribert Vollmer: The Gap-Language-Technique Revisited. 389-399 BibTeX