Logical Foundations This file is under construction.
Abstract
A formal approach to modelling and specifying complex dynamic tasks is
introduced. A basic assumption is that complex (reasoning) tasks can be
modelled by a compositional architecture wherein components correspond to
tasks. Explicitation of the control of a system's problem solving behaviour is
essential when modelling complex reasoning tasks. The semantics of the task
models and problem solving methods involved is a description of a
compositional system's behaviour, and a temporal approach provides a means
to describe the dynamics involved. Temporal models are used to formalise
this semantics. The compositional structure of information states, transitions
and reasoning traces provides a transparant model of the system's behaviour,
both conceptually and formally.
Abstract
When a compositional multi-agent system is to be verified, it is natural to do
this compositionally. In this paper we explore the use of a temporal epistemic
logic to formalize specification, properties, and their proofs, of compositional
multi-agent systems. The specification of the system, its properties and their
proofs are of a compositional nature. It is shown that compositional proofs
are valid under certain restrictions. Finally, the possibility of incorporating
default persistence of information in a system into a temporal specification, is
explored.