SCIENCE@home

Probabilistic Temporal Logic for Reasoning about Bounded Policies

N. Motamed,N. Alechina,M. Dastani,D. Doder,B. Logan

Published 2023 in International Joint Conference on Artificial Intelligence

ABSTRACT

To build a theory of intention revision for agents operating in stochastic environments, we need a logic in which we can explicitly reason about their decision-making policies and those policies' uncertain outcomes. Towards this end, we propose PLBP, a novel probabilistic temporal logic for Markov Decision Processes that allows us to reason about policies of bounded size. The logic is designed so that its expressive power is sufficient for the intended applications, whilst at the same time possessing strong computational properties. We prove that the satisfiability problem for our logic is decidable, and that its model checking problem is PSPACE-complete. This allows us to e.g. algorithmically verify whether an agent's intentions are coherent, or whether a specific policy satisfies safety and/or liveness properties.

PUBLICATION RECORD

  • Publication year

    2023

  • Venue

    International Joint Conference on Artificial Intelligence

  • Publication date

    2023-08-01

  • Fields of study

    Computer Science

  • Identifiers
    DOI 10.24963/ijcai.2023/367
  • External record

    Open on Semantic Scholar

  • Source metadata

    Semantic Scholar

CITATION MAP

EXTRACTION MAP

CLAIMS

  • No claims are published for this paper.

CONCEPTS

  • No concepts are published for this paper.

REFERENCES

Showing 1-27 of 27 references · Page 1 of 1

CITED BY