Modifier logics are considered as generalizations of "classiea1" modal logics. Thus modifier logics are soeanled multimodal logios. Multimodality means here that the basic logics are modal logics with graded modalities. The interpretation of modal operators is more generan, too. Leibniz's mottvating semantical ideas (see [8]. p. 20-21) givejustification to these generalizations. Semantics of ca...

1 Introduction: In [1] Fitch proposed a new proof proceedure for several standard modal logics. The chief characteristic of this was the inclusion in the object language, of symbols representing worlds in Kripke models. In this paper we incorporate the device into a tableau proof system and it is seen that the resulting (propositional) proof system is highly analogous to a classical first order...

This abstract describes a method, called Goal Clobbering Avoidance (GCA), to avoid some interactions in a partially-ordered plan by promoting or demoting a sequence of operators, rather than individual operators. Effectively, it simultaneously applies the Modal Truth Criterion to all operators in the sequence, using pm-compiled information about the domain. GCA will be illustrated in the famili...

This paper presents a general framework for speciication and detection of properties in distributed computations. A property of states in distributed computation in progress is deened by predicates (called behavioral patterns) and satisfaction rules (called modal operators). A behavioral pattern is obtained by combining basic predicates that are deened over either local states or consistent glo...

In this paper, we introduce subspace-frequently hypercyclic operators. We show that these operators are subspace-hypercyclic and there are subspace-hypercyclic  operators that are not subspace-frequently hypercyclic. There is a criterion like to subspace-hypercyclicity criterion that implies subspace-frequent hypercyclicity and if an operator $T$ satisfies this criterion, then $Toplus T$ is sub...

Modal logics based on Kripke style semantics are the prominent formalism in AI for modeling beliefs Kripke semantics involve a collection of possible worlds and a relation among the worlds called an accessibility relation Dependent on the properties of the accessibility relation di erent modal operators can be captured Belief operators have been modeled by an accessibility relation which produc...

We introduce our implemented modal logic programming system MProlog. This system is written in Prolog as a module for Prolog. Codes, libraries, and most features of Prolog can be used in MProlog programs. The system contains a number of built-in SLD-resolution calculi for modal logics, including calculi for useful multimodal logics of belief. Modal logics can be used to reason about knowledge, ...

We propose in this paper to construct modal logics based on mathematical morphology. The contribution of this paper is twofold. First we show that mathematical morphology can be used to define modal operators in the context of normal modal logics. We propose definitions of modal operators as algebraic dilations and erosions, based on the notion of adjunction. We detail the particular case of mo...

New properties of intuitionistic fuzzy modal logic operators are discussed and these operators are interpreted as modifications of triangular norms and conorms, and as particular kinds of aggregation operations.

In this paper we consider the class of truth-functional modal many-valued logics with the complete lattice of truth-values. The conjunction and disjunction logic operators correspond to the meet and join operators of the lattices, while the negation is independently introduced as a hierarchy of antitonic operators which invert bottom and top elements. The non-constructive logic implication will...