# Alternative axiomatics and complexity of deliberative STIT theories

**Authors:** Philippe Balbiani, Andreas Herzig, Nicolas Troquard

arXiv: 0704.3238 · 2011-04-29

## TL;DR

This paper introduces two new axiomatizations for STIT theories, one of which simplifies the logic by eliminating the historic necessity operator, and analyzes their computational complexity.

## Contribution

It offers alternative axiomatizations for Chellas and deliberative STIT, including a method to eliminate the historic necessity operator, and determines their satisfiability complexity.

## Key findings

- NP-complete satisfiability for single-agent STIT without temporal operators
- NEXPTIME-complete satisfiability for multi-agent STIT
- Two alternative axiomatizations of STIT theories

## Abstract

We propose two alternatives to Xu's axiomatization of the Chellas STIT. The first one also provides an alternative axiomatization of the deliberative STIT. The second one starts from the idea that the historic necessity operator can be defined as an abbreviation of operators of agency, and can thus be eliminated from the logic of the Chellas STIT. The second axiomatization also allows us to establish that the problem of deciding the satisfiability of a STIT formula without temporal operators is NP-complete in the single-agent case, and is NEXPTIME-complete in the multiagent case, both for the deliberative and the Chellas' STIT.

## Full text

Tomesphere does not host the full text of arXiv papers. Read it on arXiv: https://arxiv.org/abs/0704.3238

## References

10 references — full list in the complete paper: https://tomesphere.com/paper/0704.3238/full.md

---
Source: https://tomesphere.com/paper/0704.3238