A logic for reasoning about counterfactual emotions (Q543627)

The authors extend a certain fragment of the multi-agent {\text\textsf STIT} logic due to Belnap and Horty by knowledge operators for each agent. In this way, they are capable of formalizing so-called counterfactual emotions like regret and disappointment. As contrasted with the full {\text\textsf STIT} logic, including groups, the fragment considered in the paper turns out to be finitely axiomatizable, and its satisfiability problem to be NP-complete. Both axiomatizability and decidability extend to the logic enriched with the knowledge operators, while the complexity increases in the same way as it is known from the integrated epistemic logic then. Finally, for the purposes of giving a concrete example from the field of intelligent tutoring systems, the logic is further extended by public announcement operators. The paper contains instructive examples and an impressive list of references.