Mike Richter

This volume presents the proceedings of an international workshop on the processing of declarative knowledge. The workshop was organized and hosted by the German Research Center for Artificial Intelligence (DFKI) in cooperation with the Association for Logic Programming (ALP) and the Gesellschaft f}r Informatik (GI). Knowledge is often represented using definite clauses, rules, constraints, functions, conceptual graphs, and related formalisms. The workshop addressed such high-level representations and their efficient implementation required for declarative knowledge bases. Many of the papers treat representation methods, mainly concept languages, and many treat implementation methods, such as transformation techniques and WAM-like abstract machines. Several papers describe implemented knowledge-processing systems. The competition between procedural and declarative paradigms was discussed in a panel session, and position statements of the panelists are included in the volume.

In diesem Buch werden Aspekte der Aussagenlogik und der Prädikaten­ logik der ersten Stufe behandelt. Eine Mathematisierung und Kalkü­ lisierung der Logik kann natürlich ganz verschieden ausfallen, je nach dem, von welchen Motiven man sich primär leiten läßt. Wir stellen drei Gesichtspunkte, die uns auch als die wesentlichsten erscheinen, in den Vordergrund: Die Formalisierung des Wahrheits­ begriffes, die Formalisierung des Beweisbarkeitsbegriffes und das Problem des Suchens nach Beweisen. Diese drei Aspekte führen zu drei verschiedenen Arten von Kalkülen. Die Betonung des Wahrheitsbegriffes führte auf die untersuchung der Hilberttypkalküle von einem Standpunkt, wie er etwa auch im Buch von Rasiowa-Sikorski [Ra-Si] eingenommen wird. Hierbei wurde besonderen Wert auf die algebraischen Techniken gelegt, denn die Natur der Vollständigkeitsbeweise in diesen Kalkülen läßt sich u. E. eigentlich nur algebraisch verstehen. Etwas überspitzt könnte man formulieren, daß die Vollständigkeitsbeweise in Hilberttypkal­ külen Korollare zu Betrachtungen über Kongruenzrelationen in ge­ wissen Boole'schen Algebren sind. Bei den modelltheoretischen Be­ trachtungen haben wir uns kurz ge faßt und nur einige grundlegende Begriffe vorgestellt.

The workshop Computer Science Logic '90 was held at the Max-Planck-Haus in Heidelberg, Germany, October 1-5, 1990. It was the fourth in a series of worskhops, following CSL '89 at the University of Kaiserslautern (see LNCS 440), CSL '88 at the University of Duisberg (see LNCS 385), and CSL '87 at the University of Karlsruhe (see LNCS 329). This volume contains 24 papers, chosen by means of a review procedure from the 35 papers presented at the workshop, some of which were invited and some selected from a total of 89 submissions. The papers cover a wide range of topics arising from the applications of logic to computer science.

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.

This workshop on stochastic theory and adaptive control assembled many of the leading researchers on stochastic control and stochastic adaptive control to increase scientific exchange and cooperative research between these two subfields of stochastic analysis. The papers included in the proceedings include survey and research. They describe both theoretical results and applications of adaptive control. There are theoretical results in identification, filtering, control, adaptive control and various other related topics. Some applications to manufacturing systems, queues, networks, medicine and other topics are gien.

This volume presents the proceedings of the workshop CSL '91 (Computer Science Logic) held at the University of Berne, Switzerland, October 7-11, 1991. This was the fifth in a series of annual workshops on computer sciencelogic (the first four are recorded in LNCS volumes 329, 385, 440, and 533). The volume contains 33 invited and selected papers on a variety of logical topics in computer science, including abstract datatypes, bounded theories, complexity results, cut elimination, denotational semantics, infinitary queries, Kleene algebra with recursion, minimal proofs, normal forms in infinite-valued logic, ordinal processes, persistent Petri nets, plausibility logic, program synthesis systems, quantifier hierarchies, semantics of modularization, stable logic, term rewriting systems, termination of logic programs, transitive closure logic, variants of resolution, and many others.