MPI-INF Logo
Campus Event Calendar

Event Entry

New for: D3

What and Who

Agent-Enabling Environments Using Graph Matching and Inductive Logic Programming

Dr. Adrian Pearce
University of Melbourne
DFKI-Kolloquium
AG 1, AG 2, AG 3, AG 4  
AG Audience

Date, Time and Location

Monday, 3 July 2000
14:00
-- Not specified --
43.1 - DFKI
Turing 1.01
Saarbrücken

Abstract


The potential synergy between instance-based pattern recognition and
means-end (possible world) reasoning is explored in the domain of
multi-agent air mission simulations. Graph matching and inductive logic
programming techniques are applied to traces of aeroplane behaviour during
flight manoeuvres. This enables the agents to recognise what other agents
are doing and to abstract about their activity, at the instrumentation
level. The belief, desires and internationality (BDI) model of means-end
reasoning is then used to deliberate about and invoke standard operating
procedures, based on perceived activity. The reasoning model constrains the
recognition process by framing queries according to what a pilot would
expect during the execution of the current plan(s). Of particular interest
is how the processes of graph matching and inductive logic programming have
been coupled for any-time recognition at run time. The importance of
capturing relative information in these multi-agent simulations is
emphasised, including self-agent, agent-agent and agent-environment
relationships.

Contact

Dr. Klaus Fischer
302-3917
--email hidden
passcode not visible
logged in users only