—This paper presents various semantic interpretations for logics of knowledge and time with prefect recall. We allow both past and future operators and examine the interpretation...
In this paper, we continue to explore many-valued disjunctive logic programs with probabilistic semantics. In particular, we newly introduce the least model state semantics for suc...
In this paper we summarize results on perfect MV-algebras and we show that the class of first order Lukasiewicz formulas valid in all interpretations over perfect MV-chains is ax...
Lawrence Peter Belluce, Antonio di Nola, Brunella ...
Abstract. We present a method based on logic program transformation, for verifying Computation Tree Logic (CTL∗ ) properties of finite state reactive systems. The finite state ...
Alberto Pettorossi, Maurizio Proietti, Valerio Sen...
IMTL logic was introduced in [12] as a generalization of the infinitely-valued logic of Lukasiewicz, and in [11] it was proved to be the logic of left-continuous t-norms with an i...