|
|
|
|
| LEADER |
03636nmm a2200421 u 4500 |
| 001 |
EB000657352 |
| 003 |
EBX01000000000000000510434 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
140122 ||| eng |
| 020 |
|
|
|a 9783540467366
|
| 100 |
1 |
|
|a Börger, Egon
|e [editor]
|
| 245 |
0 |
0 |
|a CSL'88
|h Elektronische Ressource
|b 2nd Workshop on Computer Science Logic, Duisburg, FRG, October 3-7, 1988. Proceedings
|c edited by Egon Börger, Hans Kleine Büning, Michael M. Richter
|
| 250 |
|
|
|a 1st ed. 1989
|
| 260 |
|
|
|a Berlin, Heidelberg
|b Springer Berlin Heidelberg
|c 1989, 1989
|
| 300 |
|
|
|a VIII, 404 p
|b online resource
|
| 505 |
0 |
|
|a 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
|
| 653 |
|
|
|a Computer systems
|
| 653 |
|
|
|a Compilers (Computer programs)
|
| 653 |
|
|
|a Computer Science Logic and Foundations of Programming
|
| 653 |
|
|
|a Compilers and Interpreters
|
| 653 |
|
|
|a Computer science
|
| 653 |
|
|
|a Computer System Implementation
|
| 653 |
|
|
|a Mathematical logic
|
| 653 |
|
|
|a Formal Languages and Automata Theory
|
| 653 |
|
|
|a Machine theory
|
| 653 |
|
|
|a Discrete Mathematics
|
| 653 |
|
|
|a Discrete mathematics
|
| 653 |
|
|
|a Mathematical Logic and Foundations
|
| 700 |
1 |
|
|a Kleine Büning, Hans
|e [editor]
|
| 700 |
1 |
|
|a Richter, Michael M.
|e [editor]
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b SBA
|a Springer Book Archives -2004
|
| 490 |
0 |
|
|a Lecture Notes in Computer Science
|
| 028 |
5 |
0 |
|a 10.1007/BFb0026291
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/BFb0026291?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 004.2
|
| 520 |
|
|
|a 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
|