default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID2nd CSL 1988: Duisburg, Germany
- Egon Börger, Hans Kleine Büning, Michael M. Richter:
CSL '88, 2nd Workshop on Computer Science Logic, Duisburg, Germany, October 3-7, 1988, Proceedings. Lecture Notes in Computer Science 385, Springer 1989, ISBN 3-540-51659-X - Klaus Ambos-Spies, Jürgen Kämper:
On Disjunctive Self-Reducibility. 1-13 - Christoph Beierle, Jochen Dörre, Udo Pletat, Claus-Rainer Rollinger, Peter H. Schmitt, Rudi Studer:
The Knowledge Representation Language LLILOG. 14-51 - Elias Dahlhaus:
Completeness with Respect to Interpretations in Deterministic and Nondeterministic Polynomial Time. 52-62 - Marco Danelutto
, Andrea Masini:
A temporal Logic Approach to Specify and to Prove Properties of Finite State Concurrent Systems. 63-79 - Elmar Eder:
A Comparison of the Resolution Caculus and the Connection Method, and a new Calculus Generalizing Both Methods. 80-98 - Andreas Goerdt:
Characterizing Complexity Classes by General Recursive Definitions in Higher Types. 99-117 - Erich Grädel:
Size of Models versus Length of Computations: On Inseparability by Nondeterministic Time Complexity Classes. 118-137 - Marek Karpinski:
Boolean Complexity of Algebraic Interpolation Problems. 138-147 - Hans Kleine Büning, Ulrich Löwen, Stefan Schmitgen:
Loop Detection in Propositional Prolog Programs. 148-165 - Martin Kummer:
Numberings of R1 union F. 166-186 - D. Lippert:
Interval Temporal Logic and Star-Free Expressions. 187-198 - Stefan Lüttringhaus:
An Interpreter with Lazy Evaluation for Prolog with Functions. 199-225 - Ilkka Niemelä:
On the Complexity of the Decision Problem in Propositional Nonmonotonic Logic. 226-239 - Barbara Paech:
Gentzen-Systems for Propositional Temporal Logics. 240-253 - Lutz Plümer:
Predicate Inequalities as a Basis for Automated Termination Proofs for Prolog Programs. 254-271 - Lutz Priese:
On the Existence of Fair Schedulers. 272-287 - Gunter Saake, Udo W. Lipeck:
Using Finite-Linear Temporal Logic for Specifying Database Dynamics. 288-300 - Ewald Speckenmeyer:
Is Average Superlinear Speedup Possible? 301-312 - Norbert Südkamp, Peter Kandzia:
Enforcement of Integrity Constraints in a Semantic Data Model. 313-328 - Rüdiger Schätz:
Delete Operations and Horn Formulas. 329-343 - Wolfgang Schönfeld, Werner Stephan:
Integration of Descriptive and Procedural Language Constructs. 344-356 - Vít Ochozka, Olga Stepánková, Petr Stepánek:
Normal Forms and the Complexity of Computations of Logic Programs. 357-371 - Bernd Voigt, Ingo Wegener:
A Remark on Minimal Polynomials of Boolean Functions. 372-383 - Hubert Wagener:
On the Emptiness Problem of Tree Automata and Completeness of Modal Logics of Programs. 384-399
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-15 19:47 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
