Dynamic Logic Programming and 3APL

3APL is a widely known multi-agent programming language. However, 3APL, when to be used in certain domains and environments, has the following limitations: • limited update operator that only allows for updates to the extensional part of the belief base; • lack of a language with both default and strong negation to enable the representation and reasoning about knowledge with the open and closed world assumptions; • limited expressiveness of goals. Agents can’t express negated, conditional nor maintenance goals. In this dissertation, we propose to address these issues by modifying the belief base and the goal base of 3APL to be represented by Dynamic Logic Programming, an extension of Answer-Set Programming that allows for the representation of knowledge that changes with time. We show that the new system is an extension of 3APL, and agents constructed with it are more expressive than the 3APL agents, they • don’t have the limitations stated above; • are able to have more expressive communications, where rules instead of atoms are transmitted; • have dynamic goals, i.e. goals can be adopted, dropped, or changed.