A focused framework for emulating modal proof systems

International audienceSeveral deductive formalisms (e.g., sequent, nested sequent, labeled sequent, hyperse-quent calculi) have been used in the literature for the treatment of modal logics, and some connections between these formalisms are already known. Here we propose a general framework, which is based on a focused version of the labeled sequent calculus by Negri, augmented with some parametric devices allowing to restrict the set of proofs. By properly defining such restrictions and by choosing an appropriate polarization of formulas, one can obtain different, concrete proof systems for the modal logic K and for its extensions by means of geometric axioms. In particular, we show how to use the expressiveness of the labeled approach and the control mechanisms of focusing in order to emulate in our framework the behavior of a range of existing formalisms and proof systems for modal logic

Certification of Prefixed Tableau Proofs for Modal Logic

International audienceDifferent theorem provers tend to produce proof objects in different formats and this is especially the case for modal logics, where several deductive formalisms (and provers based on them) have been presented. This work falls within the general project of establishing a common specification language in order to certify proofs given in a wide range of deductive formalisms. In particular, by using a translation from the modal language into a first-order polarized language and a checker whose small kernel is based on a classical focused sequent calculus, we are able to certify modal proofs given in labeled sequent calculi, prefixed tableaux and free-variable prefixed tableaux. We describe the general method for the logic K, present its implementation in a Prolog-like language, provide some examples and discuss how to extend the approach to other normal modal logics

A general proof certification framework for modal logic

One of the main issues in proof certification is that different theorem provers, even when designed for the same logic, tend to use different proof formalisms and to produce outputs in different formats. The project ProofCert promotes the usage of a common specification language and of a small and trusted kernel in order to check proofs coming from different sources and for different logics. By relying on that idea and by using a classical focused sequent calculus as a kernel, we propose here a general framework for checking modal proofs. We present the implementation of the framework in a prolog-like language and show how it is possible to specialize it in a simple and modular way in order to cover different proof formalisms, such as labeled systems, tableaux, sequent calculi and nested sequent calculi. We illustrate the method for the logic K by providing several examples and discuss how to further extend the approach

Sensory Substitution for Visual Impairments: A Technological Review

This work shows the study of the people who are deprived of a sensory modality that affects brain organization and cognition. By studying, the blind or visual impaired helps learn about how sensory experience in each sense is required for specific brain systems to develop, and how the technologies help in plasticity change in their absence. The sensory-motor deprivation model serves to assess the roles of critical developmental periods, compensatory cross-modal plasticity, and sensory-independent (a-modal) processes in the human brain. Sensory substitution enables a new era for blind people. Therefore, this research will commit a complete review on the sensory substitution for visual impairments

Focused Proof-search in the Logic of Bunched Implications

The logic of Bunched Implications (BI) freely combines additive and multiplicative connectives, including implications; however, despite its well-studied proof theory, proof-search in BI has always been a difficult problem. The focusing principle is a restriction of the proof-search space that can capture various goal-directed proof-search procedures. In this paper, we show that focused proof-search is complete for BI by first reformulating the traditional bunched sequent calculus using the simpler data-structure of nested sequents, following with a polarised and focused variant that we show is sound and complete via a cut-elimination argument. This establishes an operational semantics for focused proof-search in the logic of Bunched Implications.Comment: 18 pages conten

Damage identification in structural health monitoring: a brief review from its implementation to the Use of data-driven applications

The damage identification process provides relevant information about the current state of a structure under inspection, and it can be approached from two different points of view. The first approach uses data-driven algorithms, which are usually associated with the collection of data using sensors. Data are subsequently processed and analyzed. The second approach uses models to analyze information about the structure. In the latter case, the overall performance of the approach is associated with the accuracy of the model and the information that is used to define it. Although both approaches are widely used, data-driven algorithms are preferred in most cases because they afford the ability to analyze data acquired from sensors and to provide a real-time solution for decision making; however, these approaches involve high-performance processors due to the high computational cost. As a contribution to the researchers working with data-driven algorithms and applications, this work presents a brief review of data-driven algorithms for damage identification in structural health-monitoring applications. This review covers damage detection, localization, classification, extension, and prognosis, as well as the development of smart structures. The literature is systematically reviewed according to the natural steps of a structural health-monitoring system. This review also includes information on the types of sensors used as well as on the development of data-driven algorithms for damage identification.Peer ReviewedPostprint (published version

Multi-rotor virtual machine for grid-forming converter to damp sub-synchronous resonances

Grid-forming power converters (GFMC) have been widely adopted in power systems as an attractive solution against the challenges imposed by the ever-increasing penetration of renewables. Despite its versatility, GFMC is employed only to provide islanded operation, grid regulations, and synthetic inertia. To further extend the use of GFMC in enhancing power system stability, this paper proposes a multi-rotor virtual machine (MRVM) controller to attenuate sub-synchronous oscillations. Driven by the formulation of a virtual synchronous machine (VSM), the proposed MRVM implements a VSM-based GFMC with several virtual rotors whose electromechanical characteristics can be individually adjusted to target specific oscillatory modes in the system. In this work, the MRVM’s working principle is described in detail and tuning guidelines are proposed to simplify the selection of control parameters by using frequency-domain techniques and the eigenvalue locus analyses. To validate the performance of the MRVM, an IEEE benchmark grid model is adopted namely, the three-machine-infinite-bus system. It is evident from the results that the MRVM (i) provides higher degrees of freedom when dealing with sub-synchronous oscillations, and (ii) outperforms conventional GFMC, especially in damping intra-area power oscillations.This work was supported by the European Commission under Project FLEXITRANSTORE-H2020-LCE-2016-2017-SGS-774407.Peer ReviewedPostprint (published version