Characterizing Definability in Decidable ...
Type de document :
Communication dans un congrès avec actes
Titre :
Characterizing Definability in Decidable Fixpoint Logics
Auteur(s) :
Benedikt, Michael [Auteur]
Department of Computer Science [Oxford]
Bourhis, Pierre [Auteur]
Linking Dynamic Data [LINKS]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Boom, Michael [Auteur]
Department of Computer Science [Oxford]
Department of Computer Science [Oxford]
Bourhis, Pierre [Auteur]
Linking Dynamic Data [LINKS]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Boom, Michael [Auteur]
Department of Computer Science [Oxford]
Éditeur(s) ou directeur(s) scientifique(s) :
Ioannis Chatzigiannakis
Piotr Indyk
Fabian Kuhn
Anca Muscholl
Piotr Indyk
Fabian Kuhn
Anca Muscholl
Titre de la manifestation scientifique :
ICALP 2017 - 44th International Colloquium on Automata, Languages, and Programming
Ville :
Varsovie
Pays :
Pologne
Date de début de la manifestation scientifique :
2017-07-10
Mot(s)-clé(s) en anglais :
bisimulation
definability
automata
Guarded logics
definability
automata
Guarded logics
Discipline(s) HAL :
Informatique [cs]/Base de données [cs.DB]
Résumé en anglais : [en]
We look at characterizing which formulas are expressible in rich decidable logics such as guarded fixpoint logic, unary negation fixpoint logic, and guarded negation fixpoint logic. We consider semantic characterizations ...
Lire la suite >We look at characterizing which formulas are expressible in rich decidable logics such as guarded fixpoint logic, unary negation fixpoint logic, and guarded negation fixpoint logic. We consider semantic characterizations of definability, as well as effective characterizations. Our algorithms revolve around a finer analysis of the tree-model property and a refinement of the method of moving back-and-forth between relational logics and logics over trees.Lire moins >
Lire la suite >We look at characterizing which formulas are expressible in rich decidable logics such as guarded fixpoint logic, unary negation fixpoint logic, and guarded negation fixpoint logic. We consider semantic characterizations of definability, as well as effective characterizations. Our algorithms revolve around a finer analysis of the tree-model property and a refinement of the method of moving back-and-forth between relational logics and logics over trees.Lire moins >
Langue :
Anglais
Comité de lecture :
Oui
Audience :
Internationale
Vulgarisation :
Non
Collections :
Source :
Fichiers
- https://hal.inria.fr/hal-01639015/document
- Accès libre
- Accéder au document
- https://hal.inria.fr/hal-01639015/document
- Accès libre
- Accéder au document
- https://hal.inria.fr/hal-01639015/document
- Accès libre
- Accéder au document
- document
- Accès libre
- Accéder au document
- LIPIcs-ICALP-2017-107.pdf
- Accès libre
- Accéder au document