Completeness and Decidability Results for Hybrid(ised) Logics

dc.contributor.author Renato Jorge Neves en
dc.contributor.author Martins,MA en
dc.contributor.author Luís Soares Barbosa en
dc.date.accessioned 2018-01-17T19:17:26Z
dc.date.available 2018-01-17T19:17:26Z
dc.date.issued 2015 en
dc.description.abstract Adding to the modal description of transition structures the ability to refer to specific states, hybrid(ised) logics provide an interesting framework for the specification of reconfigurable systems. The qualifier 'hybrid(ised)' refers to a generic method of developing, on top of whatever specification logic is used to model software configurations, the elements of an hybrid language, including nominals and modalities. In such a context, this paper shows how a calculus for a hybrid(ised) logic can be generated from a calculus of the base logic and that, moreover, it preserves soundness and completeness. A second contribution establishes that hybridising a decidable logic also gives rise to a decidable hybrid(ised) one. These results pave the way to the development of dedicated proof tools for such logics used in the design of reconfigurable systems. en
dc.identifier.uri http://repositorio.inesctec.pt/handle/123456789/6821
dc.identifier.uri http://dx.doi.org/10.1007/978-3-319-15075-8_10 en
dc.language eng en
dc.relation 6181 en
dc.relation 5603 en
dc.rights info:eu-repo/semantics/openAccess en
dc.title Completeness and Decidability Results for Hybrid(ised) Logics en
dc.type conferenceObject en
dc.type Publication en
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
P-00A-AC4.pdf
Size:
313.33 KB
Format:
Adobe Portable Document Format
Description: