CSL '89 : 3rd Workshop on Computer Science Logic, Kaiserslautern, FRG, October 2-6, 1989 : proceedings
This volume contains the revised versions of 28 papers presented at the third workshop on Computer Science Logic held in Kaiserslautern, FRG, October 2-6, 1989. These proceedings cover a wide range of topics both from theoretical and applied areas of computer science. More specifically, the papers d...
Guardado en:
| Autor Corporativo: | |
|---|---|
| Otros Autores: | , , |
| Formato: | Livre numérique |
| Lenguaje: | Anglais |
| Publicado: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Colección: | Lecture notes in computer science
440 |
| Materias: | |
| Acceso en línea: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • CSL '89, 3rd Workshop on Computer Science Logic, Kaiserslautern, FRG, October 2-6, 1989, proceedings, E. Börger, H. Kleine Büning, M.M. Richter (eds.), 1990, Berlin, Springer-Verlag, 1 vol. (vi-437 p.), Lecture notes in computer science, 3-540-52753-2 • CSL '89, Texte imprimé, 9783662204382 |
Tabla de Contenidos:
- Honest polynomial-time degrees of elementary recursive sets
- On the verification of modules
- A logical operational semantics of full Prolog
- Set-theoretic reductions of Hilbert's tenth problem
- The complexity of subtheories of the existential linear theory of reals
- On test classes for universal theories
- Generalizing allowedness while retaining completeness of SLDNF-resolution
- Effectively given information systems and domains
- Davis-Putnam resolution versus unrestricted resolution
- On logical descriptions of some concepts in structural complexity theory
- Algebraic operational semantics and Occam
- Propositional provability and models of weak arithmetic
- Polymorphic recursion and semi-unification
- Deciding Horn classes by hyperresolution
- ?-branching programs of bounded width
- A predicate calculus with control of derivations
- Reducibility of monotone formulas to ?-formulas
- New ways for developing proof theories for first-order multi modal logics
- On the representation of data in lambda-calculus
- A streamlined temporal completeness theorem
- A concurrent branching time temporal logic
- Semantic for abstract fairness using metric spaces
- On the average time complexity of set partitioning
- A direct proof for the completeness of SLD-resolution
- A quantifier-free completion of logic programs
- Stratification of definite clause programs and of general logic programs
- The semantics of disjunctive deductive databases
- Sequential representation of primitive recursive functions, and complexity classes.