Conferences in DBLP

Conference for Computer Science Logic (CSL) (csl)
1988 (conf/csl/1988)

1. Klaus Ambos-Spies, Jürgen Kämper
   On Disjunctive Self-Reducibility. [Citation Graph (0, 0)][DBLP]
   CSL, 1988, pp:1-13 [Conf]
   
2. Christoph Beierle, Jochen Dörre, Udo Pletat, Claus-Rainer Rollinger, Peter H. Schmitt, Rudi Studer
   The Knowledge Representation Language L_LILOG. [Citation Graph (1, 0)][DBLP]
   CSL, 1988, pp:14-51 [Conf]
   
3. Elias Dahlhaus
   Completeness with Respect to Interpretations in Deterministic and Nondeterministic Polynomial Time. [Citation Graph (0, 0)][DBLP]
   CSL, 1988, pp:52-62 [Conf]
   
4. Marco Danelutto, A. Masini
   A temporal Logic Approach to Specify and to Prove Properties of Finite State Concurrent Systems. [Citation Graph (0, 0)][DBLP]
   CSL, 1988, pp:63-79 [Conf]
   
5. Elmar Eder
   A Comparison of the Resolution Caculus and the Connection Method, and a new Calculus Generalizing Both Methods. [Citation Graph (0, 0)][DBLP]
   CSL, 1988, pp:80-98 [Conf]
   
6. Andreas Goerdt
   Characterizing Complexity Classes by General Recursive Definitions in Higher Types. [Citation Graph (0, 0)][DBLP]
   CSL, 1988, pp:99-117 [Conf]
   
7. Erich Grädel
   Size of Models versus Length of Computations: On Inseparability by Nondeterministic Time Complexity Classes. [Citation Graph (0, 0)][DBLP]
   CSL, 1988, pp:118-137 [Conf]
   
8. Marek Karpinski
   Boolean Complexity of Algebraic Interpolation Problems. [Citation Graph (0, 0)][DBLP]
   CSL, 1988, pp:138-147 [Conf]
   
9. Hans Kleine Büning, Ulrich Löwen, Stefan Schmitgen
   Loop Detection in Propositional Prolog Programs. [Citation Graph (0, 0)][DBLP]
   CSL, 1988, pp:148-165 [Conf]
   
10. Martin Kummer
    Numberings of R₁ union F. [Citation Graph (0, 0)][DBLP]
    CSL, 1988, pp:166-186 [Conf]
    
11. D. Lippert
    Interval Temporal Logic and Star-Free Expressions. [Citation Graph (0, 0)][DBLP]
    CSL, 1988, pp:187-198 [Conf]
    
12. Stefan Lüttringhaus
    An Interpreter with Lazy Evaluation for Prolog with Functions. [Citation Graph (0, 0)][DBLP]
    CSL, 1988, pp:199-225 [Conf]
    
13. Ilkka Niemelä
    On the Complexity of the Decision Problem in Propositional Nonmonotonic Logic. [Citation Graph (0, 0)][DBLP]
    CSL, 1988, pp:226-239 [Conf]
    
14. Barbara Paech
    Gentzen-Systems for Propositional Temporal Logics. [Citation Graph (0, 0)][DBLP]
    CSL, 1988, pp:240-253 [Conf]
    
15. Lutz Plümer
    Predicate Inequalities as a Basis for Automated Termination Proofs for Prolog Programs. [Citation Graph (0, 0)][DBLP]
    CSL, 1988, pp:254-271 [Conf]
    
16. Lutz Priese
    On the Existence of Fair Schedulers. [Citation Graph (0, 0)][DBLP]
    CSL, 1988, pp:272-287 [Conf]
    
17. Gunter Saake, Udo W. Lipeck
    Using Finite-Linear Temporal Logic for Specifying Database Dynamics. [Citation Graph (3, 0)][DBLP]
    CSL, 1988, pp:288-300 [Conf]
    
18. Ewald Speckenmeyer
    Is Average Superlinear Speedup Possible? [Citation Graph (0, 0)][DBLP]
    CSL, 1988, pp:301-312 [Conf]
    
19. Norbert Südkamp, Peter Kandzia
    Enforcement of Integrity Constraints in a Semantic Data Model. [Citation Graph (1, 0)][DBLP]
    CSL, 1988, pp:313-328 [Conf]
    
20. Rüdiger Schätz
    Delete Operations and Horn Formulas. [Citation Graph (0, 0)][DBLP]
    CSL, 1988, pp:329-343 [Conf]
    
21. Wolfgang Schönfeld, Werner Stephan
    Integration of Descriptive and Procedural Language Constructs. [Citation Graph (0, 0)][DBLP]
    CSL, 1988, pp:344-356 [Conf]
    
22. Vít Ochozka, Olga Stepánková, Petr Stepánek
    Normal Forms and the Complexity of Computations of Logic Programs. [Citation Graph (0, 0)][DBLP]
    CSL, 1988, pp:357-371 [Conf]
    
23. Bernd Voigt, Ingo Wegener
    A Remark on Minimal Polynomials of Boolean Functions. [Citation Graph (0, 0)][DBLP]
    CSL, 1988, pp:372-383 [Conf]
    
24. Hubert Wagener
    On the Emptiness Problem of Tree Automata and Completeness of Modal Logics of Programs. [Citation Graph (0, 0)][DBLP]
    CSL, 1988, pp:384-399 [Conf]