On simple expectations and observations of intelligent agents: A complexity study

TL;DR

This paper investigates the computational complexity of reasoning about agent expectations and observations in Public Observation Logic (POL), revealing connections with Public Announcement Logic and contributing to understanding agent epistemic reasoning.

Contribution

It provides a complexity analysis of various POL fragments and highlights their relationship with Public Announcement Logic, advancing theoretical understanding of agent epistemic reasoning.

Findings

Complexity results for different POL fragments

Identification of links between POL and Public Announcement Logic

Insights into agent epistemic reasoning processes

Abstract

Public observation logic (POL) reasons about agent expectations and agent observations in various real world situations. The expectations of agents take shape based on certain protocols about the world around and they remove those possible scenarios where their expectations and observations do not match. This in turn influences the epistemic reasoning of these agents. In this work, we study the computational complexity of the satisfaction problems of various fragments of POL. In the process, we also highlight the inevitable link that these fragments have with the well-studied Public announcement logic.