Sequent calculus usage for BDI agent implementation

BDI logic is widely used to describe agent based systems, since it can express a lot of different real world domains with three main operators: belief, desire and intention. There are lots of works where BDI logic is used as descriptive language, but authors do not talk about implementation issues [5,2,4,8,1]. There is even known general agent implementation scheme, which do not describe howto use formal logic for such scheme implementation [12]. The main aim of this paper is to show the bridge, which connects formal and practical parts of logic. We describe how sequent calculus can be used for implementing some parts of general scheme. In this paper, we show how flexible constraints can be implemented. Sequent calculus usage is illustrated with simple examples. Pateikta bendra BDI agento realizavimo schema. Parodyta kaip tam tikrų dalių realizavimui gali būti panaudotas sekvencinis skaičiavimas. Pasiūlyta, kaip galima realizuoti lankstesnę funkciją filter.