## CSL '88: 2nd Workshop on Computer Science Logic, Duisburg, FRG, October 3-7, 1988 : ProceedingsEgon Börger, Hans Kleine Büning, Michael M. Richter "This volume contains the papers which were presented at the second workshop "Computer Science Logic" held in Duisburg, FRG, October 3-7, 1988. These proceedings cover a wide range of topics both from theoretical and applied areas of computer science. More specifically, the papers deal with problems arising at the border of logic and computer science: e.g. in complexity, data base theory, logic programming, artificial intelligence, and concurrency. The volume should be of interest to all logicians and computer scientists working in the above fields."--Publisher's website. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

On disjunctive selfreducibility | 1 |

The knowledge representation language Lulog | 14 |

Completeness with respect to interpretations in deterministic | 52 |

A comparison of the Resolution Calculus and the Connection | 80 |

Characterizing complexity classes by general recursive | 99 |

Size of models versus length of computations on inseparability | 118 |

Erich Gradel 118 | 137 |

Numberings of Rt U | 166 |

GentzenSystems for propositional Temporal Logics | 240 |

Predicate inequalities as a basis for automated termination | 254 |

On the existence of fair schedulers | 272 |

Using finitelinear Temporal Logic | 288 |

Is average superlinear speedup possible? | 301 |

Delete operations and Horn formulas | 329 |

Integration of descriptive and procedural language constructs | 344 |

Normal forms and the complexity of computations of logic programs | 357 |

Interval Temporal Logic and Starfree Expressions | 187 |

An interpreter with lazy evaluation for Prolog with functions | 199 |

On the complexity of the decision problem in propositional | 226 |

A remark on minimal polynomials of Boolean functions | 372 |

Copyright | |