|
|
|
|
| LEADER |
03805nmm a2200325 u 4500 |
| 001 |
EB000656899 |
| 003 |
EBX01000000000000000509981 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
140122 ||| eng |
| 020 |
|
|
|a 9783540459606
|
| 100 |
1 |
|
|a Börger, Egon
|e [editor]
|
| 245 |
0 |
0 |
|a CSL '87
|h Elektronische Ressource
|b 1st Workshop on Computer Science Logic, Karlsruhe, FRG, October 12-16, 1987. Proceedings
|c edited by Egon Börger, Hans Kleine Büning, Michael M. Richter
|
| 250 |
|
|
|a 1st ed. 1988
|
| 260 |
|
|
|a Berlin, Heidelberg
|b Springer Berlin Heidelberg
|c 1988, 1988
|
| 300 |
|
|
|a VIII, 348 p
|b online resource
|
| 505 |
0 |
|
|a Diagonalizing over deterministic polynomial time -- Resolution with feature unification -- Surjectivity for finite sets of combinators by weak reduction -- Proving finite satisfiability of deductive databases -- Is setl a suitable language for parallel programming — a theoretical approach -- Loose diagrams, semigroupoids, categories, groupoids and iteration -- Algebraic operational semantics and modula-2 -- Program verification using dynamic logic -- Induction in the elementary theory of types and names -- On the computational complexity of quantified Horn clauses -- The conjunctive complexity of quadratic boolean functions -- On type inference for object-oriented programming languages -- Optimization aspects of logical formulas -- Logic of approximation reasoning -- Deciding the path- and word-fair equivalence problem -- Learning by teams from examples with errors -- A survey of rewrite systems -- Interfacing a logic machine -- Complexity cores and hard-to-prove formulas -- On the average case complexity of backtracking for the exact-satisfiability problem -- On functions computable in nondeterministic polynomial time: Some characterizations -- Developing logic programs: Computing through normalizing -- Model theory of deductive databases -- Algorithms for propositional updates
|
| 653 |
|
|
|a Computer systems
|
| 653 |
|
|
|a Computer Science Logic and Foundations of Programming
|
| 653 |
|
|
|a Computer science
|
| 653 |
|
|
|a Computer System Implementation
|
| 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/3-540-50241-6
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/3-540-50241-6?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 004.2
|
| 520 |
|
|
|a This volume contains the papers which were presented to the workshop "Computer-Science Logic" held in Karlsruhe on October 12-16, 1987. Traditionally Logic, or more specifically, Mathematical Logic splits into several subareas: Set Theory, Proof Theory, Recursion Theory, and Model Theory. In addition there is what sometimes is called Philosophical Logic which deals with topics like nonclassical logics and which for historical reasons has been developed mainly at philosphical departments rather than at mathematics institutions. Today Computer Science challenges Logic in a new way. The theoretical analysis of problems in Computer Science for intrinsic reasons has pointed back to Logic. A broad class of questions became visible which is of a basically logical nature. These questions are often related to some of the traditional disciplines of Logic but normally without being covered adequately by any of them. The novel and unifying aspect of this new branch of Logic is the algorithmic point of view which is based on experiences people had with computers. The aim of the "Computer-Science Logic" workshop and of this volume is to represent the richness of research activities in this field in the German-speaking countries and to point to their underlying general logical principles
|