Studying the complexity of SAT in a normal multi-modal logic for trust in the sincerity

In the field of multi-agent systems, as some agents may be not reliable or honest, a particular attention is paid to the notion of trust. In this context, we defined a new normal multi-modal logic to reason about an agent’s trust in the sincerity towards a statement formulated by another agent. After briefly introducing this modal logic, we will study the SAT complexity in this logical system. To this end, we will propose a general methodology which relies on an extension of satisfiable Hintikka sets in order to build a model which satisfies a given formula.