A Query-Driven Decision Procedure for Distributed Autoepistemic Logic with Inductive Definitions

TL;DR

This paper introduces a query-driven decision procedure for distributed autoepistemic logic with inductive definitions, enhancing security and privacy in access control systems by minimizing redundant information flow.

Contribution

It presents a novel decision procedure for dAEL(ID) implemented in the IDP system, improving understanding of the logic and its application in access control.

Findings

Decision procedure determines access rights efficiently in theory.

Reduces redundant information flow between principals.

Provides a proof of concept despite exponential worst-case runtime.

Abstract

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.