This paper gives a state of the art overview about machine learning approaches for information extraction from documents based on finite state techniques and relational learning methods related to inductive logic programming.

In this paper we describe a new multi-agent simulation system, called Spark, for physical agents in three-dimensional environments. Our goal in creating Spark was to provide a great amount of flexibility for creating new types of agents and simulations. To achieve this, we implemented a flexible application framework and exhausted the idea of replaceable components in the resulting system. In comparison to specialized simulators, users can effortless create new simulations by using a scene description language. Spark is a powerful and flexible tool to state di#erent multi-agent research questions. It is uesd

Abstract not found

The concern of this paper is to introduce and apply the concept of duality for place/transition nets. The two main consequences of the duality concept are: transition tokens and firing places that transform the transition token load of the nets. A marked transition is definitely excluded from getting enabled. So, the forward motion of transition tokens might describe cascading fails in (technical) devices, whereas the backward motion might describe the search for reasons for the non-occurrence of events.

A true-concurrency semantics is often given via pomsets. A pomset is an abstract directed acyclic graph that is in addition transitive: any grandson of a node is also a son of that node. We will drop this rather artificial transitive property in this paper and research abstract directed acyclic graphs (dags) as a true-concurrency semantics for Petri nets and their relation to regular languages of trees and forests. Therefor we regard regular graph grammars operating on unranked, unordered trees or on forests of them. Regular grammars over words with or without #-rules generate the same languages (modulo the empty word). This is not true

Recognizable sets of unranked, unordered trees have been introduced in Courcelle [C89] in a Myhill-Nerode [N58] style of inverse homomorphisms of suitable finite magmas. This is equivalent of being the the union of some congruence classes of a congruence of finite index. We will add to the well-known concept of regular tree grammars a handling of nodes labeled with #. With this rather unconventional - but nevertheless natural - treatment of the "empty node" the class of languages generated by regular trees grammars becomes equivalent to Courcelles class of recognizable sets of unranked, unordered trees.

KRHyper is a rst order logic theorem proving and model generation system based on the hyper tableau calculus. It is targeted for use as an embedded system within knowledge based applications. In contrast to most rst order theorem provers, it supports features important for those applications, for example queries with predicate extensions as answers, handling of large sets of uniformly structured input facts, arithmetic evaluation and strati ed negation as failure.

Schemas for Reverse Engineering aims at utilizing meta-technology for the development of reverse engineering toolsets. The workshop objective is to determine and specify areas in reverse engineering which will benefit from meta-technology and to discover and discuss meta-technologies which will provide significant additional support for developing and using program understanding and analysis tools.

How cheap observation techniques can be used