A semantics for open normal defaults via a modified preferential approach

We present a new approach for handling open normal defaults that makes it possible 1. to derive existentially quantified formulae from other existentially quantified formulae by default, 2. to derive universally quantified formulae by default, and 3. to treat cardinality formulae analogously to other formulae. This was not the case for previous approaches. Reiter uses Skolemization in his treatment of open defaults to achieve the first goal, but this has the unpleasant side-effect that logically equivalent facts may lead to different default consequences. In addition, Reiter\u27s approach does not comply with our second requirement. Lifschitz\u27s main motivation for his approach was to satisfy this second demand. However, to achieve this goal he has to violate the third requirement, and the first condition is also not observed. Differing from these two previous approaches, we will not view open defaults as schemata for certain instantiated defaults. Instead they will be used to define a preference relation on models. But unlike the usual approaches to preferential semantics we shall not always take the minimal models to construct our semantics. Due to this new treatment of preference relations the resulting nonmonotonic consequence operator has nice proof-theoretic properties such as cumulativity

A semantics for open normal defaults via a modified preferential approach

We present a new approach for handling open normal defaults that makes it possible 1. to derive existentially quantified formulae from other existentially quantified formulae by default, 2. to derive universally quantified formulae by default, and 3. to treat cardinality formulae analogously to other formulae. This was not the case for previous approaches. Reiter uses Skolemization in his treatment of open defaults to achieve the first goal, but this has the unpleasant side-effect that logically equivalent facts may lead to different default consequences. In addition, Reiter's approach does not comply with our second requirement. Lifschitz's main motivation for his approach was to satisfy this second demand. However, to achieve this goal he has to violate the third requirement, and the first condition is also not observed. Differing from these two previous approaches, we will not view open defaults as schemata for certain instantiated defaults. Instead they will be used to define a preference relation on models. But unlike the usual approaches to preferential semantics we shall not always take the minimal models to construct our semantics. Due to this new treatment of preference relations the resulting nonmonotonic consequence operator has nice proof-theoretic properties such as cumulativity

LAYLAB : a constraint-based layout manager for multimedia presentations

When developing advanced intelligent user interfaces composing text, graphics, animation, hypermedia etc., the question of automatically designing the graphical layout of such multimedia presentations in an appropriate format plays a crucial role. This paper introduces the task, the functionality and the architecture of the constraint-based multimedia layout manager LayLab

Verbmobil : translation of face-to-face dialogs

Verbmobil is a long-term project on the translation of spontaneous language in negotiation dialogs. We describe the goals of the project, the chosen discourse domains and the initial project schedule. We discuss some of the distinguishing features of Verbmobil and introduce the notion of translation on demand and variable depth of processing in speech translation. Finally, the role of anytime modules for efficient dialog translation in close to real time is described

The application of two-level morphology to non-concatenative German morphology

In this paper I describe a hybrid system for morphological analysis and synthesis. This system consists of two parts. The treatment of morphonology and non-concatenative morphology is based on the two-level approach proposed by Koskenniemi (1983). For the concatenative part of morphosyntax (i.e. affixation) a grammar based on feature-unification is made use of. Both parts rely on a morph lexicon. Combinations of two-level morphology with feature-based morphosyntactic grammars have already been proposed by several authors (c.f. Bear 1988a, Carson 1988, Görz & Paulus 1988, Schiller & Steffens 1989) to overcome the shortcomings of the continuation-classes originally proposed by Koskenniemi (1983) and Karttunen (1983) for the description of morphosyntax. But up to now no linguistically satisfying solution has been proposed for the treatment of non-concatenative morphology in such a framework. In this paper I describe an extension to the model which will allow for the description of such phenomena. Namely it is proposed to restrict the applicability of two-level rules by providing them with filters in the form of feature structures. It is demonstrated how a well-known problem of German morphology, so-called "Umlautung", can be described in this approach in a linguistically motivated and efficient way

Designing a structured lexicon for document image analysis

This paper presents a structured, multi-level architecture of a lexicon which is a central component of our knowledge-based document analysis system. Our system has the task to transform incoming business letters into an equivalent electronic representation automatically. Moreover, partial text analysis and understanding of a letter\u27s body and relevant parts are initiated to enrich the conceptual knowledge about the actual document (e.g., by a classification). In such an application domain, a well-designed lexicon has to consider requirements of both, text recognition and text analysis. For that purpose, we propose an appropriate lexicon architecture and the internal structure of corresponding lexical entries being a prerequisite for successful higher-level interpretations of documents

Corporate agents

The logic of belief and intention in situations with multiple agents is increasingly well understood, but current formal approaches appear to face problems in applications where the number of agents greatly exceeds two. We provide an informal development of Corporate Agents, an intensional approximation of individual and group states which treats groups symmetrically with autonomous agents. Corporate Charters, constraints derived from typical patterns of information flow, replace detailed reasoning about the propagation of attitudes in most contexts. The approximation to an ideal logical formulation is not tight, but the model appears to function well in information-poor environments and fails in ways related to characteristic human errors. It may therefore be particularly appropriate to application in the area of natural language discourse

Using integrated knowledge acquisition to prepare sophisticated expert plans for their re-use in novel situations

Plans which were constructed by human experts and have been repeatedly executed to the complete satisfaction of some customer in a complex real world domain contain very valuable planning knowledge. In order to make this compiled knowledge re-usable for novel situations, a specific integrated knowledge acquisition method has been developed: First, a domain theory is established from documentation materials or texts, which is then used as the foundation for explaining how the plan achieves the planning goal. Secondly, hierarchically structured problem class definitions are obtained from the practitioners\u27 highlevel problem conceptualizations. The descriptions of these problem classes also provide operationality criteria for the various levels in the hierarchy. A skeletal plan is then constructed for each problem class with an explanation-based learning procedure. These skeletal plans consist of a sequence of general plan elements, so that each plan element can be independently refined. The skeletal plan thus accounts for the interactions between the various concrete operations of the plan at a general level. The complexity of the planning problem is thereby factored in a domain-specific way and the compiled knowledge of sophisticated expert plans can be re-used in novel situations

Konzeption einer deklarativen Wissensbasis über recyclingrelevante Materialien

Das Recycling von Produkten und Produktionsreststoffen erlangt als Einflußfaktor für wirtschaftliche Entscheidungsprozesse eine immer größere Bedeutung. Die Integration von recyclingrelevanten Daten in betriebliche Informationsstrukturen sollte in Zukunft durch wissensbasierte Methoden unterstützt werden. Wir stellen Ansätze für eine Wissensbasis zur recyclinggerechten Produkt- und Produktionsplanung vor, und gehen dann genauer auf das grundlegende Modul über Materialien ein. Es wird untersucht, welche Evolutionstechniken sich zur Pflege derartiger Wissensbestände eignen, z.B. zur Validierung vorhandener und Exploration neuer Materialien im Hinblick auf ihre Recycelbarkeit

Akquisition und Repräsentation von technischem Wissen für Planungsaufgaben im Bereich der Fertigungstechnik

Im Bereich der Fertigungstechnik kann eine Fülle von Planungsaufgaben identifiziert werden, die für eine Bearbeitung mit Methoden der KI geeignet erscheinen. Das Projekt ARC-TEC am DFKI wendet die KADS-Methode zur systematischen Entwicklung von Expertensystemen an und erstellt Tools für alle Phasen dieser Entwicklung. Die Brauchbarkeit der entwickelten Methoden und Tools wird am Beispiel der Erstellung von Arbeitsplänen für die Drehbearbeitung demonstriert. Besonderes Augenmerk gilt dabei der expliziten Repräsentation des konkreten Expertenwissens und der Bearbeitung des gegebenen Problems in einer der Vorgehensweise des Experten möglichst naheliegenden Weise.In the area of production engineering many planning tasks can be found which seem well-suited to be tackled using AI-methodologies. The ARC-TEC project of the DFKI uses the model based KADS approach for a systematic development of expert systems and provides tools to support the different phases of this development. The generation of work plans for manufacturing by turning is used as an example to demonstrate the applicability of the different tools and methodologies. Special focus is upon the explicit representation of the concrete experts knowledge and the problem solving strategy which closely follows the way an expert solves the problem