Foundations of Computer Science
Potential-Theory-Cognition
Published on 24. October 1997
Book
Paperback/Softback
XII, 524 pages
978-3-540-63746-2 (ISBN)
Description
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.
More details
Series
Edition
1997 ed.
Language
English
Place of publication
Berlin
Germany
Publishing group
Springer Berlin
Target group
Professional and scholarly
Research
Illustrations
XII, 524 p.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 29 mm
Weight
803 gr
ISBN-13
978-3-540-63746-2 (9783540637462)
DOI
10.1007/BFb0052071
Schweitzer Classification
Content
The might of formulas and their limits.- Hardware - Software.- Defining discipline.- Computer science as cultural development.- Towards adjusting informatics education to information era.- Informatics and society: A curriculum for distance education.- Syntactic and semantic aspects of parallelism.- Unique fixpoints in complete lattices with applications to formal languages and semantics.- On abstract families of languages, power series, and elements.- Are there formal languages complete for SymSPACE(log n)?.- On twist-closed trios: A new morphic characterization of r.e. sets.- An automata approach to some problems on context-free grammars.- On aperiodic sets of Wang tiles.- Closure under complementation of logspace complexity classes - A survey -.- A relation between sparse and printable sets in NSPACE(log n).- A foundation for computable analysis.- A computer scientist's view of life, the universe, and everything.- Calendars and chronologies.- A uniform approach to Petri Nets.- Observing partial order runs of Petri Nets.- Representation theorems for Petri Nets.- A remark on trace equations.- Verification of distributed algorithms with algebraic Petri Nets.- A short story on action refinement.- Interactive and reactive systems: States, observations, experiments, input, output, nondeterminism, compositionality and all that.- Discrete time analysis of a state dependent tandem with different customer types.- How distributed algorithms play the token game.- The asynchronous stack revisited: Rounds set the twilight reeling.- Online scheduling of continuous media streams.- Contribution to Goodenough's and Gerhart's theory of software testing and verification: Relation between strong compiler test and compiler implementation verification.- On the arrangement complexity ofuniform trees.- A relational-functional integration for declarative programming.- Inside and outside the Chinese room.- Abstract structures in spatial cognition.- Spatial and temporal structures in cognitive processes.- Qualitative vs. Fuzzy representations of spatial distance.- What's a part? On formalizing part-whole relations.- SPOCK: A feasibility study on the completeness of parts lists.- Decision support systems with adaptive reasoning strategies.- Knowledge discovery in databases - An inductive logic programming approach.- The composition heuristic.- The job assignment problem: A study in parallel and distributed machine learning.- Self-improving behavior arbitration.- Neural networks for manipulator path planning.- Path planning using a subgoal graph.- A nonlinear markovian characterization of time series using neural networks.- Feature-based perception of semantic concepts.- Automatic detection of thesaurus relations for information retrieval applications.- InfoSphere ? -V: a new approach to 3D-visualization of information.