Tractable reasoning about Agent Programming in Dynamic Preference LogicDownload PDFOpen Website

Published: 01 Jan 2019, Last Modified: 27 Jun 2023CoRR 2019Readers: Everyone
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.
0 Replies

Loading