DeepAI AI Chat
Log In Sign Up

ExpTime Tableaux for Type PDL

09/01/2019
by   Agathoklis Kritsimallis, et al.
0

The system of Type PDL (τPDL) is an extension of Propositional Dynamic Logic (PDL) and its main goal is to provide a formal basis for reasoning about types of actions (modeled by their preconditions and effects) and agent capabilities. The system has two equivalent interpretations, namely the standard relational semantics and the type semantics, where process terms are interpreted as types, i.e. sets of binary relations. Its satisfiability problem is decidable, as a NExpTime decision procedure was provided based on a filtration argument and it was suggested that the satisfiability problem for τPDL should be solvable in deterministic, single exponential time. In this paper, we address the problem of the complexity of the satisfiability problem of τPDL. We present a deterministic tableau-based satisfiability algorithm and prove that it is sound and complete and that it runs in ExpTime. Additionally, the algorithm detects satisfiability as earlier as possible, by restricting or-branching whenever possible.

READ FULL TEXT

page 1

page 2

page 3

page 4

08/07/2014

A Logic for Reasoning about Upper Probabilities

We present a propositional logic to reason about the uncertainty of even...
02/05/2018

Unary negation fragment with equivalence relations has the finite model property

We consider an extension of the unary negation fragment of first-order l...
11/22/2022

A Complete Diagrammatic Calculus for Boolean Satisfiability

We propose a calculus of string diagrams to reason about satisfiability ...
06/05/2014

On the satisfiability problem for SPARQL patterns

The satisfiability problem for SPARQL patterns is undecidable in general...
08/30/2021

Satisfiability and Containment of Recursive SHACL

The Shapes Constraint Language (SHACL) is the recent W3C recommendation ...
08/31/2020

SHACL Satisfiability and Containment (Extended Paper)

The Shapes Constraint Language (SHACL) is a recent W3C recommendation la...
06/24/2014

SROIQsigma is decidable

We consider a dynamic extension of the description logic SROIQ. This mea...