Ein contract-net-basiertes Lernverfahren für eine benutzeradaptive Interface-Agentur (Abstract)

Lenzmann B, Wachsmuth I. Ein contract-net-basiertes Lernverfahren für eine benutzeradaptive Interface-Agentur (Abstract). In: Thielscher M, Bornscheuer S-E, eds. Fortschritte der Künstlichen Intelligenz / Workshops KI-96. Dresden: Dresden University Press; 1996: 13

Massively Parallel Reasoning about Actions

In [2] C. Baral and M. Gelfond present the language AC for representing concurrent actions in dynamic systems, and give a sound but incomplete encoding of this language in terms of extended logic programming. Using their program, the time the computation of the transition from one situation to another takes increases quadraticly with the size of the considered domain. In this paper, we present a mapping of domain descriptions in AC into neural networks of linear size. These networks take only four steps for the sound and complete computation of the transition of situations. This allows for reasoning about concurrent actions wrt. extensive real-time domains

On the Combination of Partial Action Descriptions

. We investigate the problems of precondition interactions and effect cumulations, typically caused by the concurrent execution of actions. Our analysis leads to an integration of property oriented and resource oriented approaches to the representation of action and change. We formalize our ideas by introducing an extension AORC of the Action Description Language AC [2]. In order to enable sound and complete automated inference, we give a corresponding encoding in terms of the Fluent Calculus [10]. 1 Introduction In order to avoid domain descriptions of intractable length, most approaches to the representation of actions (e.g. [16,10,18,1,7]) obtain the effects and conditions of actions by combining various partial action descriptions. In particular, this is common if concurrent 1 actions are considered, and the partial descriptions of the relevant (sub)actions have to be taken into account. In this paper, we will argue that approaches to concurrent actions have to incorporate differ..

Representing Concurrent Actions and Solving Conflicts

As an extension of the well--known Action Description language A introduced by M. Gelfond and V. Lifschitz [7], C. Baral and M. Gelfond recently defined the dialect AC which allows the description of concurrent actions [1]. Also, a sound but incomplete encoding of AC by means of an extended logic program was presented there. In this paper, we work on interpretations of contradictory inferences from partial action descriptions. Employing an interpretation different from the one implicitly used in AC , we present a new dialect A + C , which allows to infer non-contradictory information from contradictory descriptions and to describe nondeterminism and uncertainty. Furthermore, we give the first sound and complete encoding of AC , using equational logic programming, and extend it to A + C as well. In

Explicit and Implicit Indeterminism: Reasoning About Uncertain and Contradictory Specifications of Dynamic Systems

A high-level action semantics to specify and reason about dynamic systems is presented which supports both uncertain knowledge (taken as explicit indeterminism) and contradictory information (taken as implicit indeterminism). We start by developing an action description language for intentionally representing nondeterministic actions in dynamic systems. We then study the different possibilities of interpreting contradictory specifications of concurrent actions. We argue that the most reasonable interpretation which allows for exploiting as much information as possible is to take such conflicts as implicit indeterminism. As the second major contribution, we present a calculus for our resulting action semantics based on the logic programming paradigm including negation-as-failure and equational theories. Soundness and completeness of this encoding wrt the notion of entailment in our high-level action language is proved by taking the completion semantics for equational logic programs with..

Concurrent Productions, Consumptions and Occupations

We investigate the problems of precondition interactions and effect cumulations, typically caused by the concurrent execution of actions. Our analysis leads to an integration of property oriented and resource oriented approaches to the representation of action and change. We formalize our ideas by introducing an extension AORC of the Action Description Language AC [1], and give a sound and complete encoding of domain descriptions in AORC in terms of the Fluent Calculus [8], thereby enabling sound and complete automated inference using SLDENF-Resolution [17, 15]

Rational Models of Normal Logic Programs

In general, the application of the meaning function TP to a normal logic program P results in infinite expressions and, hence, is infeasible in practice. On the other hand, the iteration of TP is of interest for several fields in AI. Therefore, we introduce a new representation of interpretations and adopt TP to this. The resulting function always results in finite expressions of tractable length and overcomes some limitations of usual model generating systems. 1 Motivation Model generation is of interest for several fields in AI. For example, the computation of the extensions of a default logic [7] is a generation of models, and P. N. Johnson--Laird assumes that the human way of reasoning corresponds to the generation of models [3]. Wrt. logic programming, the iteration of the meaning function TP corresponding to a logic program P is the basic method of model generation 1 . In general, the application of the meaning function TP corresponding to a normal logic program P results in ..

Representing Concurrent Actions and Solving Conflicts

As an extension of the well--known Action Description language introduced by M. Gelfond and V. Lifschitz [7], C. Baral and M. Gelfond recently defined the dialect which allows the description of concurrent actions [1]. Also, a sound but incomplete encoding of by means of an extended logic program was presented there. In this paper, we work on interpretations of contradictory inferences from partial action descriptions. Employing an interpretation di#erent from the one implicitly used in , we present a new dialect , which allows to infer non-contradictory information from contradictory descriptions and to describe nondeterminism and uncertainty. Furthermore, we give the first sound and complete encoding of , using equational logic programming, and extend it to C as well

Eine multimodale Eingabeagentur

Lenzmann B, Wachsmuth I. Eine multimodale Eingabeagentur. In: Thielscher M, Bornscheuer S-E, eds. Fortschritte der Künstlichen Intelligenz / Workshops KI-96. Dresden: Dresden University Press; 1996: 93