| 1991 | Computer Science Logic, 4th Workshop, CSL '90, Heidelberg, Germany, October 1-5, 1990, Proceedings Egon Börger, Hans Kleine Büning, Michael M. Richter, Wolfgang Schönfeld |
| 1990 | A Fast Garbage Collection Algorithm for WAM-Based Prolog. Igor Durdanovic |
| 1990 | A Formal Operational Semantics for Languages of Type Prolog III. Egon Börger, Peter H. Schmitt |
| 1990 | A Generalization of Stability and its Application to Circumscription of Positive Introspective Knowledge. Jan Jaspars |
| 1990 | A Resolution Variant Deciding some Classes of Clause Sets. Christian G. Fermüller |
| 1990 | Algorithmic Proof with Diminishing Resources, Part 1. Dov M. Gabbay |
| 1990 | Cuting Plane Versus Frege Proof Systems. Andreas Goerdt |
| 1990 | Decision Problems for Tarski and Presburger Arithmetics Extended With Sets. Domenico Cantone, Vincenzo Cutello, Jacob T. Schwartz |
| 1990 | Efficiency Considerations on Goal-Directed Chaining for Logic Programs. Wolfram Burgard |
| 1990 | Expansions and Models of Autoepistemic Theories. Cecylia Rauszer |
| 1990 | From Prolog Algebras Towards WAM - A Mathematical Study of Implementation. Egon Börger, Dean Rosenzweig |
| 1990 | Interactive Proof Systems: Provers, Rounds, and Error Bounds. Ulrich Hertrampf, Klaus W. Wagner |
| 1990 | Logics for Belief Dependence. Zhisheng Huang |
| 1990 | Monadic Second Order Logic, Tree Automata and Forbidden Minors. Stefan Arnborg, Andrzej Proskurowski, Detlef Seese |
| 1990 | Nontrivial Lower Bounds for some NP-Problems on Directed Graphs. Solomampionona Ranaivoson |
| 1990 | On the Existence of Fixpoints in Moore's Autoepistemic Logic and the Non-Monotonic Logic of McDermott and Doyle. Robert F. Stärk |
| 1990 | On the Reduction Theory for Average Case Complexity. Andreas Blass, Yuri Gurevich |
| 1990 | On the Tracking of Loops in Automated Deductions. Manfred E. Szabo |
| 1990 | RAM with Compact Memory: A Realistic and Robust Model of Computation. Etienne Grandjean, J. M. Robson |
| 1990 | Ramsey's Theorem in Bounded Arithmetic. Pavel Pudlák |
| 1990 | Randomness and Turing Reducibility Restraints. Karol Habart |
| 1990 | Subclasses of Quantified Boolean Formulas. Andreas Flögel, Marek Karpinski, Hans Kleine Büning |
| 1990 | The Complexity of Adaptive Error-Correcting Codes. Daniele Mundici |
| 1990 | The Gap-Language-Technique Revisited. Heribert Vollmer |
| 1990 | Towards an Efficient Tableau Proof Procedure for Multiple-Valued Logics. Reiner Hähnle |