Abstract is missing.
- On Disjunctive Self-ReducibilityKlaus Ambos-Spies, Jürgen Kämper. 1-13
- The Knowledge Representation Language L::LILOG::Christoph Beierle, Jochen Dörre, Udo Pletat, Claus-Rainer Rollinger, Peter H. Schmitt, Rudi Studer. 14-51
- Completeness with Respect to Interpretations in Deterministic and Nondeterministic Polynomial TimeElias Dahlhaus. 52-62
- A temporal Logic Approach to Specify and to Prove Properties of Finite State Concurrent SystemsMarco Danelutto, A. Masini. 63-79
- A Comparison of the Resolution Caculus and the Connection Method, and a new Calculus Generalizing Both MethodsElmar Eder. 80-98
- Characterizing Complexity Classes by General Recursive Definitions in Higher TypesAndreas Goerdt. 99-117
- Size of Models versus Length of Computations: On Inseparability by Nondeterministic Time Complexity ClassesErich Grädel. 118-137
- Boolean Complexity of Algebraic Interpolation ProblemsMarek Karpinski. 138-147
- Loop Detection in Propositional Prolog ProgramsHans Kleine Büning, Ulrich Löwen, Stefan Schmitgen. 148-165
- Numberings of R::1:: union FMartin Kummer. 166-186
- Interval Temporal Logic and Star-Free ExpressionsD. Lippert. 187-198
- An Interpreter with Lazy Evaluation for Prolog with FunctionsStefan Lüttringhaus. 199-225
- On the Complexity of the Decision Problem in Propositional Nonmonotonic LogicIlkka Niemelä. 226-239
- Gentzen-Systems for Propositional Temporal LogicsBarbara Paech. 240-253
- Predicate Inequalities as a Basis for Automated Termination Proofs for Prolog ProgramsLutz Plümer. 254-271
- On the Existence of Fair SchedulersLutz Priese. 272-287
- Using Finite-Linear Temporal Logic for Specifying Database DynamicsGunter Saake, Udo W. Lipeck. 288-300
- Is Average Superlinear Speedup Possible?Ewald Speckenmeyer. 301-312
- Enforcement of Integrity Constraints in a Semantic Data ModelNorbert Südkamp, Peter Kandzia. 313-328
- Delete Operations and Horn FormulasRüdiger Schätz. 329-343
- Integration of Descriptive and Procedural Language ConstructsWolfgang Schönfeld, Werner Stephan. 344-356
- Normal Forms and the Complexity of Computations of Logic ProgramsVít Ochozka, Olga Stepánková, Petr Stepánek. 357-371
- A Remark on Minimal Polynomials of Boolean FunctionsBernd Voigt, Ingo Wegener. 372-383
- On the Emptiness Problem of Tree Automata and Completeness of Modal Logics of ProgramsHubert Wagener. 384-399