In this paper, a fast frequency domain global modal parameter identification algorithm is proposed. The modal parameters are identified with amplitude square of FRF instead of its traditional real part & imaginary part. By discrete transformation, all additional pseudo roots are reciprocal of the real roots and their conjugates. The physical roots can be separated from mathematical roots with s...

Allegories are enriched categories generalizing a category of sets and binary relations. In this paper, we extend a new, recently-introduced conceptual data model based on allegories by adding support for modal operators and developing a modal interpretation of the model in any allegory satisfying certain additional (but natural) axioms. The possibility of using different allegories allows us t...

We give sound and complete analytic tableau systems for the propositional bimodal logics KB, KB C , KB 5, and KB 5C . These logics have two universal modal operators K and B , where K stands for knowing and B stands for believing. The logic KB is a combination of the modal logic S5 (for K ) and KD45 (for B ) with the interaction axioms I : Kφ → Bφ and C : Bφ → K Bφ. The logics KB C , KB 5, KB 5...

Proper epistemic knowledge bases (PEKBs) are syntactic knowledge bases that use multi-agent epistemic logic to represent nested multi-agent knowledge and belief. PEKBs have certain syntactic restrictions that lead to desirable computational properties; primarily, a PEKB is a conjunction of modal literals, and therefore contains no disjunction. Sound entailment can be checked in polynomial time,...

1. I n t r o d u c t i o n Graded normal logics ( G N L s ) are the extensions of modal normal logics to a language with graded modalities. The interpretation in usual Kripke models of a formula <>hA (n < w), whose main operator is a graded possibility, is there are more than n accessible worlds where A is true. When graded modalities were introduced (in [7], independently rediscovering a forme...

The concept of knowledge can be modelled in epistemic modal logic and, if modelled by using a standard modal operator, it is subject to the problem of logical omniscience. The classical solution to this problem is to distinguish between implicit and explicit knowledge and to construe the knowledge operator as capturing the concept of implicit knowledge. In addition, since a proposition is said ...

The main goal of this paper is to establish a nonmonotonic epistemic logic EB with two modalities – provability and belief – capable of expressing and comparing a variety of known semantics for extended logic programs, and clarify their meaning. In particular we present here, for the first time, embeddings into epistemic logic of logic programs extended with a second kind of negation under the ...

Formal treatments of epistemology and epistemological issues have come a great way in recent years. Valuable results have been produced by Bayesians, in formal learning theory (also known as computational epistemology in [Kelly 96] and epistemic logic. While the first to formal approaches concentrate on learning and knowledge acquisition issues, the latter concentrate on axiomatics and validity...

The affine Dynkin diagram of type A (1) n has a cyclic symmetry. The analogue of this Dynkin diagram automorphism on the level of crystals is called a promotion operator. In this paper we show that the only irreducible type An crystals which admit a promotion operator are the highest weight crystals indexed by rectangles. In addition we prove that on the tensor product of two type An crystals l...