Logic programs with classical negation
Logic programming
Knowledge Representation, Reasoning, and Declarative Problem Solving
Knowledge Representation, Reasoning, and Declarative Problem Solving
Autonomous Agents and Multi-Agent Systems
Generalizing Updates: From Models to Programs
LPKR '97 Selected papers from the Third International Workshop on Logic Programming and Knowledge Representation
A Logic Programming Language for Multi-agent Systems
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
MINERVA - A Dynamic Logic Programming Agent Architecture
ATAL '01 Revised Papers from the 8th International Workshop on Intelligent Agents VIII
Logic-based specification languages for intelligent software agents
Theory and Practice of Logic Programming
Reasoning about actions: non-deterministic effects, constraints, and qualification
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Reasoning Robots: The Art and Science of Programming Robotic Agents
Reasoning Robots: The Art and Science of Programming Robotic Agents
A dynamic logic programming based system for agents with declarative goals
DALT'06 Proceedings of the 4th international conference on Declarative Agent Languages and Technologies
Query-based argumentation in agent programming
IBERAMIA'10 Proceedings of the 12th Ibero-American conference on Advances in artificial intelligence
A dynamic logic programming based system for agents with declarative goals
DALT'06 Proceedings of the 4th international conference on Declarative Agent Languages and Technologies
| Hi-index | 0.00 |
3APL is a widely known multi-agent programming language. However, when to be used in certain domains and environments, 3APL has some limitations related to its simplistic update operator that only allows for updates to the extensional part of the belief base and its 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. In this paper, we propose to address these issues by modifying the belief 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.