We propose a new definition of the representation theorem for many-valued logics, with modal operators as well, and define the stronger relationship between algebraic models of a given logic and relational structures used to define the Kripke possible-world semantics for it. Such a new framework offers a new semantics for many-valued logics based on the truth-invariance entailment. Consequently...

Non-clausal refinement of Boolean Constraint Propagation inference procedure for classical logic, called P-BCP, is introduced within a new knowledge representational formalism of polarized formulas. P-BCP is a sound, incomplete, and linear-time inference procedure. It is shown that P-BCP can be adopted for tractable reasoning in a number of non-classical logics (including some modal and finitel...

After a short analysis of the requirements that a knowledge representation language must satisfy, we introduce Description Logics, Modal Logics, and Nonmonotonic Logics as formalisms for representing terminological knowledge, time-dependent or subjective knowledge, and incomplete knowledge respectively. At the end of each section, we brieey comment on the connection to Logic Programming.

In this paper we introduce and investigate various classes of multi-modal logics based on frames with relative accessibility relations. We discuss their applicability to representation and analysis of incomplete information. We provide axiom systems for these logics and we prove their completeness.

First, we show with two examples that in test semirings with an incomplete test algebra a domain operation may or may not exist. Second, we show that two notions of separability in test semirings coincide, respectively, with locality of composition and with extensionality of the diamond operators in domain semirings. We conclude with a brief comparison of dynamic algebras and modal Kleene algeb...

In order to reconstruct small changes in the interface of an elastic inclusion from modal measurements, we rigorously derive an asymptotic formula which is in some sense dual to the leading-order term in the asymptotic expansion of the perturbations in the eigenvalues due to interface changes of the inclusion. Based on this (dual) formula we propose an algorithm to reconstruct the interface per...

Abstract: Modal analysis is a powerful technique for understanding the behavior and performance of structures. Modal analysis can be conducted via artificial excitation, e.g. shaker or instrument hammer excitation. Input force and output responses are measured. That is normally referred to as experimental modal analysis (EMA). EMA consists of three steps: data acquisition, system identificatio...

We present a generalization of Levesque's logic All I Know by presenting it as an extension of usual modal logics. We study how logic All I Know can represent complete and incomplete knowledge in Logical Information Systems. In these information systems, a knowledge base is a collection of objects (e.g., les, bibliographical references) described in a logical way, furthermore in the same logic ...

In this paper, a computationally simple approach for damage localization and quantification in beam-like structures is proposed. This method is based on using modal flexibility curvature (MFC) and particle swarm optimization (PSO) algorithm. Analytical studies in the literature have shown that changes in the modal flexibility curvature can be considered as a sensitive and suitable criterion for...