CSL'88 [electronic resource] : 2nd Workshop on Computer Science Logic, Duisburg, FRG, October 3-7, 1988. Proceedings / edited by Egon Börger, Hans Kleine Büning, Michael M. Richter.
Format
Book
Language
English
Εdition
1st ed. 1989.
Published/Created
Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1989.
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.
Notes
Bibliographic Level Mode of Issuance: Monograph
Language note
English
Contents
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.
ISBN
3-540-46736-X
Doi
10.1007/BFb0026291
Statement on language in description
Princeton University Library aims to describe library materials in a manner that is respectful to the individuals and communities who create, use, and are represented in the collections we manage. Read more...