A Query-Driven Decision Procedure for Distributed Autoepistemic Logic with Inductive Definitions
This work addresses access control and privacy concerns in distributed systems using a non-monotonic logic, but it is incremental as it builds on the recently proposed dAEL(ID) framework.
The authors tackled the problem of determining access rights in distributed autoepistemic logic with inductive definitions (dAEL(ID)) by developing a query-driven decision procedure implemented in the IDP system, which avoids redundant information flow to enhance security and privacy, though it has exponential worst-case runtime and serves as a proof of concept.
Distributed Autoepistemic Logic with Inductive Definitions (dAEL(ID)) is a recently proposed non-monotonic logic for says-based access control. We define a query-driven decision procedure for dAEL(ID) that is implemented in the knowledge-base system IDP. The decision procedure is designed in such a way that it allows one to determine access rights while avoiding redundant information flow between principals in order to enhance security and reduce privacy concerns. Given that the decision procedure has in the worst case an exponential runtime, it is to be regarded as a proof of concept that increases our understanding of dAEL(ID), rather than being deployed for an access control system.