Designing a knowledge representation interface for cognitive agents

The design of cognitive agents involves a knowledge representation (KR) to formally represent and manipulate information relevant for that agent. In practice, agent programming frameworks are dedicated to a specific KR, limiting the use of other possible ones. In this paper we address the issue of creating a flexible choice for agent programmers regarding the technology they want to use. We propose a generic interface, that provides an easy choice of KR for cognitive agents. Our proposal is governed by a number of design principles, an analysis of functional requirements that cognitive agents pose towards a KR, and the identification of various features provided by KR technologies that the interface should capture. We provide two use-cases of the interface by describing its implementation for Prolog and OWL with rules

HNF1A-MODY is associated with an intact CRP response during human endotoxaemia

In large-scale distributed applications, a loosely-coupled event-based style of communication as in publish/subcribe systems eases the integration of autonomous, heterogeneous components. In a publish/subscribe system, content based routing - where routing is based on the content of the messages - is an alternative to address-based delivery. In this paper we compare the efficiency of two content-based routing algorithms: the flooding scheme and the more sophisticated identity-based routing scheme. Our analytical approach is based on continuous time Markov Chains and extends the steady state approach by Jaeger and Mühl [8] to systems with time-fluctuating parameters. We obtain explicit closed form solutions for the timedependent distribution of the number of active clients, taking into account the use of advertisements and roaming clients. The results allow us to investigate, for example, the switching point between optimality of flooding and identity-based routing

Reasoning about epistemic states of agents by modal logic programming

Abstract. Modal logic programming is one of appropriate approaches to deal with reasoning about epistemic states of agents. We specify here the least model semantics, the fixpoint semantics, and an SLD-resolution calculus for modal logic programs in the multimodal logic KD4Ig5a, which is intended for reasoning about belief and common belief of agents. We prove that the presented SLD-resolution calculus is sound and complete. We also present a formalization of the wise men puzzle using a modal logic program in KD4Ig5a. This shows that it is worth to study modal logic programming for multi-agent systems.