| 1990 | A Generalization of Stability and its Application to Circumscription of Positive Introspective Knowledge. | Jan Jaspars |
| 1990 | Logics for Belief Dependence. | Zhisheng Huang |
| 1990 | Interactive Proof Systems: Provers, Rounds, and Error Bounds. | Ulrich Hertrampf, Klaus W. Wagner |
| 1990 | Towards an Efficient Tableau Proof Procedure for Multiple-Valued Logics. | Reiner Hhnle |
| 1990 | Randomness and Turing Reducibility Restraints. | Karol Habart |
| 1990 | RAM with Compact Memory: A Realistic and Robust Model of Computation. | Etienne Grandjean, J. M. Robson |
| 1990 | Cuting Plane Versus Frege Proof Systems. | Andreas Goerdt |
| 1990 | Algorithmic Proof with Diminishing Resources, Part 1. | Dov M. Gabbay |
| 1990 | Subclasses of Quantified Boolean Formulas. | Andreas Flgel, Marek Karpinski, Hans Kleine Bning |
| 1990 | A Resolution Variant Deciding some Classes of Clause Sets. | Christian G. Fermller |
| 1990 | A Fast Garbage Collection Algorithm for WAM-Based Prolog. | Igor Durdanovic |
| 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 | A Formal Operational Semantics for Languages of Type Prolog III. | Egon Brger, Peter H. Schmitt |
| 1990 | From Prolog Algebras Towards WAM - A Mathematical Study of Implementation. | Egon Brger, Dean Rosenzweig |
| 1990 | On the Reduction Theory for Average Case Complexity. | Andreas Blass, Yuri Gurevich |
| 1990 | Monadic Second Order Logic, Tree Automata and Forbidden Minors. | Stefan Arnborg, Andrzej Proskurowski, Detlef Seese |
| 1989 | Sequential Representation of Primitive Recursive Functions, and Complexity Classes. | Elisabeth Wette |
| 1989 | The Semantics of Disjunctive Deductive Databases. | Hugo Volger |
| 1989 | Stratification of Definite Clause Programs and of General Logic Programs. | Olga Stepnkov, Petr Stepnek |
| 1989 | A Quantifier-Free Completion of Logic Programs. | Robert F. Strk |
| 1989 | A Direct Proof for the Completeness of SLD-Resolution. | Robert F. Strk |
| 1989 | On the Average Time Complexity of Set Partitioning. | Ewald Speckenmeyer, Rainer Kemp |
| 1989 | Semantic for Abstract Fairness using Metric Spaces. | Lutz Priese, Doris Nolte |
| 1989 | A Concurrent Branching Time Temporal Logic. | Wojciech Penczek |