CSL '88 : proceedings
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...
Gorde:
| Erakunde egilea: | |
|---|---|
| Beste egile batzuk: | , , |
| Formatua: | Livre numérique |
| Hizkuntza: | Anglais |
| Argitaratua: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Saila: | Lecture notes in computer science
385 |
| Gaiak: | |
| Sarrera elektronikoa: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Oharra: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • CSL '88, proceedings, 2nd Workshop on computer science logic, Duisburg, FRG, October 3-7, 1988, 1989, Berlin, Springer-Verlag, 1 vol. (VI-399 p.), Lecture notes in computer science, 3-540-51659-X • CSL'88, Texte imprimé, 9783662194010 |
Aurkibidea:
- On disjunctive self-reducibility
- The knowledge representation language LLILOG
- Completeness with respect to interpretations in deterministic and nondeterministic polynomial time
- A temporal logic approach to specify and to prove properties of finite state concurrent systems
- A comparison of the resolution calculus and the connection method, and a new calculus generalizing both methods
- Characterizing complexity classes by general recursive definitions in higher types
- Size of models versus length of computations
- Boolean circuit complexity of algebraic interpolation problems
- Loop detection in propositional Prolog programs
- Numberings of R1?F
- Interval temporal logic and star-free expressions
- An interpreter with lazy evaluation for Prolog with functions
- On the complexity of the decision problem in propositional nonmonotonic logic
- Gentzen-Systems for propositional temporal logics
- Predicate inequalities as a basis for automated termination proofs for Prolog programs
- On the existence of fair schedulers
- Using finite-linear temporal logic for specifying database dynamics
- Is average superlinear speedup possible?
- Enforcement of integrity constraints in a semantic data model
- Delete operations and Horn formulas
- Integration of descriptive and procedural language constructs
- Normal forms and the complexity of computations of logic programs
- A remark on minimal polynomials of Boolean functions
- On the emptiness problem of tree automata and completeness of modal logics of programs.