Traditionally, the estimation of modal parameters from a set of measured data has required significant experience. However, as the technology has matured, increasingly, analysis is being performed by less experienced engineers or technicians. To address this development, frequently software solutions are focusing upon either wizard-based or autonomous/semiautonomous approaches. A number of auto...

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...

Cross-modal retrieval has drawn wide interest for retrieval across different modalities of data (such as text, image, video, audio and 3D model). However, existing methods based on deep neural network (DNN) often face the challenge of insufficient cross-modal training data, which limits the training effectiveness and easily leads to overfitting. Transfer learning is usually adopted for relievin...

We show how labelled deductive systems can be combined with a logical framework to provide a natural deduction implementation of a large and well-known class of propositional modal logics (including K, D, T, B, S4, S4:2, KD45, S5). Our approach is modular and based on a separation between a base logic and a labelling algebra, which interact through a xed interface. While the base logic stays xe...

In this paper, we exploit graph-theoretic techniques to efficiently reason about partially ordered events in the Event Calculus. We replace the traditional generate-and-test reasoning strategy by a more efficient generate-only one that operates on the underlying directed acyclic graph of events representing ordering information by pairing breadth-first and depth-first visits in a suitable way. ...

Given modal logics 1, 2, their lexicographic product 1 ⇤ 2 is a new logic whose frames are the Cartesian products of a 1-frame and a 2-frame, but with the new accessibility relations reminiscent of a lexicographic ordering. This article considers the lexicographic products of several modal logics with linear temporal logic (LTL) based on “next” and “always in the future”. We provide axiomatizat...

We propose modal Markov logic as an extension of propositional Markov logic to reason under the principle of maximum entropy for modal logics K45, KD45, and S5. Analogous to propositional Markov logic, the knowledge base consists of weighted formulas, whose weights are learned from data. However, in contrast to Markov logic, in our framework we use the knowledge base to define a probability dis...

The output data from a structure is the building block for output-only modal analysis. The structure response in the output data, however, is usually contaminated with noise. Naturally, the success of output-only methods in determining the modal parameters of a structure depends on noise level. In this paper, the possibility and accuracy of identifying the modal parameters of a simply supported...

We show how labelled deductive systems can be combined with a logical framework to provide a natural deduction implementation of a large and well-known class of propositional modal logics (including K, D, T, B, S4, S4:2, KD45, S5). Our approach is modular and based on a separation between a base logic and a labelling algebra, which interact through a xed interface. While the base logic stays xe...