Hybrid Branching-Time Logics

Hybrid branching-time logics are introduced as extensions of CTL-like logics with state variables and the downarrow-binder. Following recent work in the linear framework, only logics with a single variable are considered. The expressive power and the complexity of satisfiability of the resulting logics is investigated. As main result, the satisfiability problem for the hybrid versions of several branching-time logics is proved to be 2EXPTIME-complete. These branching-time logics range from strict fragments of CTL to extensions of CTL that can talk about the past and express fairness-properties. The complexity gap relative to CTL is explained by a corresponding succinctness result. To prove the upper bound, the automata-theoretic approach to branching-time logics is extended to hybrid logics, showing that non-emptiness of alternating one-pebble Buchi tree automata is 2EXPTIME-complete.Comment: An extended abstract of this paper was presented at the International Workshop on Hybrid Logics (HyLo 2007

Relation-Changing Logics as Fragments of Hybrid Logics

Relation-changing modal logics are extensions of the basic modal logic that allow changes to the accessibility relation of a model during the evaluation of a formula. In particular, they are equipped with dynamic modalities that are able to delete, add, and swap edges in the model, both locally and globally. We provide translations from these logics to hybrid logic along with an implementation. In general, these logics are undecidable, but we use our translations to identify decidable fragments. We also compare the expressive power of relation-changing modal logics with hybrid logics.Comment: In Proceedings GandALF 2016, arXiv:1609.0364

A method for rigorous design of reconfigurable systems

Reconfigurability, understood as the ability of a system to behave differently in different modes of operation and commute between them along its lifetime, is a cross-cutting concern in modern Software Engineering. This paper introduces a specification method for reconfigurable software based on a global transition structure to capture the system's reconfiguration space, and a local specification of each operation mode in whatever logic (equational, first-order, partial, fuzzy, probabilistic, etc.) is found expressive enough for handling its requirements. In the method these two levels are not only made explicit and juxtaposed, but formally interrelated. The key to achieve such a goal is a systematic process of hybridisation of logics through which the relationship between the local and global levels of a specification becomes internalised in the logic itself.This work is financed by the ERDF – European Regional Development Fund through the Operational Programme for Competitiveness and Internationalisation – COMPETE 2020 Programme and by National Funds through the Portuguese funding agency, FCT – Fundação para a Ciência e a Tecnologia within projects POCI-01-0145-FEDER-016692 and UID/MAT/04106/2013. The first author is further supported by the BPD FCT Grant SFRH/BPD/103004/2014, and R. Neves is sponsored by FCT Grant SFRH/BD/52234/2013. M.A. Martins is also funded by the EU FP7 Marie Curie PIRSESGA-2012-318986 project GeTFun: Generalizing Truth-Functionality

Quantification in Frame Semantics with Binders and Nominals of Hybrid Logic

International audienceThis paper aims at integrating logical operators into frame-based semantics. Frames are semantic graphs that allow to capture lexical meaning in a fine-grained way but that do not come with a natural way to integrate logical operators such as quantifiers. The approach we propose starts from the observation that modal logic is a powerful tool for describing relational structures, hence frames. We use its hybrid logic extension in order to incorporate quantification and thereby allow for inference and reasoning. We integrate our approach to a type theoretic compositional semantics, formulated within Abstract Categorial Grammars. We also show how the key ingredients of hybrid logic, nominals and binders, can be used to model semantic coercion, such as the one induced by the begin predicate. In order to illustrate the effectiveness of the proposed syntax-semantics interface, all the examples can be run and tested with the Abstract Categorial Grammar development toolkit

For-Adverbials and Aspectual Interpretation: An LTAG Analysis Using Hybrid Logic and Frame Semantics

International audienceIn this paper, we propose to use Hybrid Logic (HL) as a means to combine frame-based lexical semantics with quantification. We integrate this into a syntax-semantics interface using LTAG (Lexicalized Tree Adjoining Grammar) and show that this architecture allows a fine-grained description of event structures by quantifying, for instance, over subevents. As a case study, we provide an analysis of for-adverbials and the aspectual interpretations they induce. The basic idea is that for-adverbials introduce a universal quantification over subevents that are characterized by the predication contributed by the verb. Depending on whether these subevents are bounded or not, the resulting overall event is then an iteration or a progression. We show that by combining the HL approach with standard techniques of underspecification and by using HL to formulate general constraints on event frames, we can account for the aspectual coercion triggered by these adverbials. Furthermore, by pairing this with syntactic building blocks in LTAG, we provide a working syntax-semantics interface for these phenomena