A satisfiability algorithm for the $\mu-$calculus interpreted on tree models and extended with converse modalities and Presburger arithmetic operators, based on a breadth-first search in a Fischer-Lardner construction of tree models is described.Expand

This paper proposes a satisfiability algorithm for the mu-calculus extended with converse modalities and interpreted on unranked trees based on a depth-first search and proves the algorithm to be correct (sound and complete) and optimal.Expand

This paper proposes a satisfiability algorithm for the μ-calculus with converse interpreted on finite unranked trees based on a depth-first search, and proves the algorithm to be correct and optimal and provides an implementation, which shows significant performance improvement with respect to a known breadth- first search based algorithm.Expand

This work proposes a reasoning (satisability) algorithm for the multi-modal Km with converse based on the nite tree model property and a Fischer-Ladner construction and provides the corresponding complexity analysis.Expand

This work describes a consistency model for a context-aware communication system characterized in term of the satisfiability of the μ-calculus (an expressive modal logic) and proposes the use of expressivemodal logics as a reasoning framework for context- aware pervasive systems.Expand

This work study a formal notion of consistency in attention aware systems for the educational setting, and proposes an expressive modal logic as specification language, and a consistency checking algorithm defined in terms of the satisfiability problem of the logic.Expand