Modal inclusion logic is the extension of basic modal logic with inclusion atoms, and its semantics is defined on Kripke models with teams. A team of a Kripke model is just a subset of its domain. In this paper we give a complete characterisation for the expressive power of modal inclusion logic: a class of Kripke models with teams is definable in modal inclusion logic if and only if it is clos...

The complexity of model checking branching and linear time temporal logics over Kripke structures has been addressed in e.g. [SC85, CES86]. In terms of the size of the Kripke model and the length of the formula, they show that the model checking problem is solvable in polynomial time for CTL and NP-complete for L(F ). The model checking problem can be generalised by allowing more succinct descr...

Modal fuzzy logics is a research topic that has attracted increasing attention in the last years. Several papers have been published treating different aspects, see for instance [6] for a modal expansion of Lukasiewicz logic, [3, 4, 2] for modal expansions of Gödel fuzzy logic, [1] for modal logics over finite residuated lattices, and more recently [7] for a modal expansion of Product fuzzy log...

We consider the problem of the product nite model property for binary products of modal logics. First we give a new proof for the product nite model property of the logic of products of Kripke frames, a result due to Shehtman. Then we modify the proof to obtain the same result for logics of products of Kripke frames satisfying any combination of seriality, re exivity and symmetry. We do not con...

The objectives of this research are to further investigate the foundations for novel SMT and SAT-based bounded model checking (BMC) algorithms for real-time and multiagent systems. A major part of the research will involve the development of SMT-based BMC methods for standard Kripke structures, extended Kripke structures, and for different kinds of interpreted systems for different kinds of tem...

Model checking is commonly recognized as one of the most effective tools for system verification. While it has been systematically investigated in the context of classical, point-based temporal logics, it is still largely unexplored in the interval logic setting. Recently, a non-elementary model checking algorithm for Halpern and Shoham’s modal logic of time intervals HS, interpreted over finit...

in the fundamental production inventory model, in order to solve the economic production quantity (epq) we always fix both the demand quantity and the production quantity per day. but, in the real situation, both of them probably will have little disturbances every day. therefore, we should fuzzify both of them to solve the economic production quantity (q*) per cycle. using α-cut for defuzzific...

Suppose there are several experts, with some dominating others (expert A dominates expert B if B says something is true whenever A says it is). Suppose, further, that each of the experts has his or her own view of what is possible — in other words each of the experts has their own Kripke model in mind (subject, of course, to the dominance relation that may hold between experts). How will they a...