Language of Higher Level of Abstraction for Programming Mobile Intelligent Agents

Cílem této práce je návrh jazyka vyšší urovně abstrakce pro programování mobilních inteligentních agentů a implementace překladače pro tento jazyk. Bude představen nástroj ANTLR pro generování syntaktických a lexikálnych analyzátorů. Čtěnář bude seznámen s teoretickou i praktickou stránkou implementace překladače tak jako s programovaním v tomto jazyce. V závěre práce bude představeno prostredí pro programování spomínaném jazyce a příklady agentních kódů.The aim of this work is to design a language of higher level of abstraction for programming mobile intelligent agents and implement a compiler for this language. There will also be presented the ANTLR tool for generating syntax and lexical analyzers. The reader will become familiar with theoretical and practical aspects of implementation of the compiler and also with programming in this language. There will be shown the environment for programming in this language and some examples of agent codes at the end.

Designing intelligent computer‐based simulations: A pragmatic approach

This paper examines the design of intelligent multimedia simulations. A case study is presented which uses an approach based in part on intelligent tutoring system design to integrate formative assessment into the learning of clinical decision‐making skills for nursing students. The approach advocated uses a modular design with an integrated intelligent agent within a multimedia simulation. The application was created using an object‐orientated programming language for the multimedia interface (Delphi) and a logic‐based interpreted language (Prolog) to create an expert assessment system. Domain knowledge is also encoded in a Windows help file reducing some of the complexity of the expert system. This approach offers a method for simplifying the production of an intelligent simulation system. The problems developing intelligent tutoring systems are examined and an argument is made for a practical approach to developing intelligent multimedia simulation systems

ARBEITSBEREICH WISSENSBASIERTE SYSTEME TEAM PROGRAMMING IN GOLOG UNDER PARTIAL OBSERVABILITY

Abstract. We present and explore the agent programming language TEAMGOLOG, which is a novel approach to programming a team of cooperative agents under partial observability. Every agent is associated with a partial control program in Golog, which is completed by the TEAMGOLOG interpreter in an optimal way by assuming a decision-theoretic semantics. The approach is based on the key concepts of a synchronization state and a communication state, which allow the agents to passively resp. actively coordinate their behavior, while keeping their belief states, observations, and activities invisible to the other agents. We show the practical usefulness of the TEAMGOLOG approach in a rescue simulated domain. We describe the algorithms behind the TEAMGOLOG interpreter and provide a prototype implementation. We also show through experimental results that the TEAMGOLOG approach outperforms a standard greedy one in the rescue simulated domain

Rational Agents: Prioritized Goals, Goal Dynamics, and Agent Programming Languages with Declarative Goals

I introduce a specification language for modeling an agent's prioritized goals and their dynamics. I use the situation calculus along with Reiter's solution to the frame problem and predicates for describing agents' knowledge as my base formalism. I further enhance this language by introducing a new sort of infinite paths. Within this language, I discuss how to systematically specify prioritized goals and how to precisely describe the effects of actions on these goals. These actions include adoption and dropping of goals and subgoals. In this framework, an agent's intentions are formally specified as the prioritized intersection of her goals. The ``prioritized'' qualifier above means that the specification must respect the priority ordering of goals when choosing between two incompatible goals. I ensure that the agent's intentions are always consistent with each other and with her knowledge. I investigate two variants with different commitment strategies. Agents specified using the ``optimizing'' agent framework always try to optimize their intentions, while those specified in the ``committed'' agent framework will stick to their intentions even if opportunities to commit to higher priority goals arise when these goals are incompatible with their current intentions. For these, I study properties of prioritized goals and goal change. I also give a definition of subgoals, and prove properties about the goal-subgoal relationship. As an application, I develop a model for a Simple Rational Agent Programming Language (SR-APL) with declarative goals. SR-APL is based on the ``committed agent'' variant of this rich theory, and combines elements from Belief-Desire-Intention (BDI) APLs and the situation calculus based ConGolog APL. Thus SR-APL supports prioritized goals and is grounded on a formal theory of goal change. It ensures that the agent's declarative goals and adopted plans are consistent with each other and with her knowledge. In doing this, I try to bridge the gap between agent theories and practical agent programming languages by providing a model and specification of an idealized BDI agent whose behavior is closer to what a rational agent does. I show that agents programmed in SR-APL satisfy some key rationality requirements

An Implementation of Nested Pattern Matching in Interaction Nets

Reduction rules in interaction nets are constrained to pattern match exactly one argument at a time. Consequently, a programmer has to introduce auxiliary rules to perform more sophisticated matches. In this paper, we describe the design and implementation of a system for interaction nets which allows nested pattern matching on interaction rules. We achieve a system that provides convenient ways to express interaction net programs without defining auxiliary rules