Tractable reasoning about Agent Programming in Dynamic Preference Logic
Marlo Souza, \'Alvaro Moreira, Renata Vieira
TL;DR
This paper introduces a semantic foundation for BDI agent programming using Dynamic Preference Logic and explores tractable fragments for practical reasoning about agent programs.
Contribution
It connects BDI logics to agent programs through Dynamic Preference Logic and identifies tractable fragments for efficient reasoning.
Findings
Semantic foundation for BDI languages established
Identification of tractable fragments of Dynamic Preference Logic
Potential for implementing efficient agent programming languages
Abstract
While several BDI logics have been proposed in the area of Agent Programming, it is not clear how these logics are connected to the agent programs they are supposed to specify. More yet, the reasoning problems in these logics, being based on modal logic, are not tractable in general, limiting their usage to tackle real-world problems. In this work, we use of Dynamic Preference Logic to provide a semantic foundation to BDI agent programming languages and investigate tractable expressive fragments of this logic to reason about agent programs. With that, we aim to provide a way of implementing semantically grounded agent programming languages with tractable reasoning cycles.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.