Foundations of Computer Science: Potential — Theory — Cognition

✍ Scribed by F. L. Bauer (auth.), Christian Freksa, Matthias Jantzen, Rüdiger Valk (eds.)

• Publisher: Springer-Verlag Berlin Heidelberg
• Year: 1997
• Tongue: English
• Leaves: 1016
• Series: Lecture Notes in Computer Science 1337
• Edition: 1
• Category: Library

✦ Synopsis

This book constitutes an anthology of refereed papers arranged to acknowledge the work of Wilfried Brauer on the occasion of his sixtieth birthday. The volume presents 49 revised refereed papers organized in topical sections on computer science and its potential, social implications of computer science, formal languages and automata, structures and complexity theory, Petri nets, systems analysis and distributed systems, software engineering and verification, cognition and artificial intelligence, knowledge representation and reasoning, machine learning, neural networks and robotics, language and information systems.

✦ Table of Contents

The might of formulas and their limits....Pages 1-8
Hardware — Software....Pages 9-19
Defining discipline....Pages 21-35
Computer science as cultural development....Pages 37-47
Towards adjusting informatics education to information era....Pages 49-67
Informatics and society: A curriculum for distance education....Pages 69-78
Syntactic and semantic aspects of parallelism....Pages 79-105
Unique fixpoints in complete lattices with applications to formal languages and semantics....Pages 107-115
On abstract families of languages, power series, and elements....Pages 117-124
Are there formal languages complete for SymSPACE(log n )?....Pages 125-134
On twist-closed trios: A new morphic characterization of r.e. sets....Pages 135-142
An automata approach to some problems on context-free grammars....Pages 143-152
On aperiodic sets of Wang tiles....Pages 153-162
Closure under complementation of logspace complexity classes - A survey -....Pages 163-175
A relation between sparse and printable sets in NSPACE(log n)....Pages 177-184
A foundation for computable analysis....Pages 185-199
A computer scientist's view of life, the universe, and everything....Pages 201-208
Calendars and chronologies....Pages 209-217
A uniform approach to Petri Nets....Pages 219-231
Observing partial order runs of Petri Nets....Pages 233-238
Representation theorems for Petri Nets....Pages 239-249
A remark on trace equations....Pages 251-260
Verification of distributed algorithms with algebraic Petri Nets....Pages 261-270
A short story on action refinement....Pages 271-278
Interactive and reactive systems: States, observations, experiments, input, output, nondeterminism, compositionality and all that....Pages 279-286
Discrete time analysis of a state dependent tandem with different customer types....Pages 287-296
How distributed algorithms play the token game....Pages 297-306
The asynchronous stack revisited: Rounds set the twilight reeling....Pages 307-312
Online scheduling of continuous media streams....Pages 313-320
Contribution to Goodenough's and Gerhart's theory of software testing and verification: Relation between strong compiler test and compiler implementation verification....Pages 321-335
On the arrangement complexity of uniform trees....Pages 337-350
A relational-functional integration for declarative programming....Pages 351-358
Inside and outside the Chinese room....Pages 359-368
Abstract structures in spatial cognition....Pages 369-378
Spatial and temporal structures in cognitive processes....Pages 379-387
Qualitative vs. Fuzzy representations of spatial distance....Pages 389-398
What's a part? On formalizing part-whole relations....Pages 399-406
SPOCK: A feasibility study on the completeness of parts lists....Pages 407-415
Decision support systems with adaptive reasoning strategies....Pages 417-427
Knowledge discovery in databases — An inductive logic programming approach....Pages 429-436
The composition heuristic....Pages 437-444
The job assignment problem: A study in parallel and distributed machine learning....Pages 445-454
Self-improving behavior arbitration....Pages 455-464
Neural networks for manipulator path planning....Pages 465-472
Path planning using a subgoal graph....Pages 473-480
A nonlinear markovian characterization of time series using neural networks....Pages 481-488
Feature-based perception of semantic concepts....Pages 489-497
Automatic detection of thesaurus relations for information retrieval applications....Pages 499-506
InfoSphere ℳ -V: a new approach to 3D-visualization of information....Pages 507-514

✦ Subjects

Theory of Computation; Artificial Intelligence (incl. Robotics); Software Engineering/Programming and Operating Systems; Computers and Society