Automata-Theoretic Decision Procedures for Information Logics - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Fundamenta Informaticae Année : 2002

Automata-Theoretic Decision Procedures for Information Logics

Résumé

Automata-theoretic decision procedures for solving model-checking and satisfiability problems for temporal, dynamic, and description logics have flourished during the past decades. In the paper we define an EXPTIME decision procedure based on the emptiness problem of Büchi automata on infinite trees for the very expressive information logic SIM designed for reasoning about information systems. This logic involves modal parameters satisfying certain properties to capture the relevant nominals at the formula level, Boolean expressions and nominals at the modal level, an implicit intersection operation for relations, and a universal modality. The original combination of known techniques allows us to solve the open question related to the EXPTIME-completeness of SIM. Furthermore, we discuss how variants of SIM can be treated similarly although the decidability status of some of them is still unknown.
Fichier principal
Vignette du fichier
ds-fund-02.pdf (324.21 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03194002 , version 1 (09-04-2021)

Identifiants

Citer

Stéphane Demri, Ulrike Sattler. Automata-Theoretic Decision Procedures for Information Logics. Fundamenta Informaticae, 2002, 53 (1), pp.1-22. ⟨10.5555/1220762.1220763⟩. ⟨hal-03194002⟩
27 Consultations
50 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More