Definability and Interpolation within ...
Type de document :
Compte-rendu et recension critique d'ouvrage
Titre :
Definability and Interpolation within Decidable Fixpoint Logics
Auteur(s) :
Benedikt, Michael [Auteur]
Computing Science Laboratory - Oxford University
Bourhis, Pierre [Auteur]
Linking Dynamic Data [LINKS]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Vanden Boom, Michael [Auteur]
Computing Science Laboratory - Oxford University
Computing Science Laboratory - Oxford University
Bourhis, Pierre [Auteur]
Linking Dynamic Data [LINKS]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Vanden Boom, Michael [Auteur]
Computing Science Laboratory - Oxford University
Titre de la revue :
Logical Methods in Computer Science
Éditeur :
Logical Methods in Computer Science Association
Date de publication :
2019
Discipline(s) HAL :
Informatique [cs]/Base de données [cs.DB]
Informatique [cs]/Logique en informatique [cs.LO]
Informatique [cs]/Intelligence artificielle [cs.AI]
Informatique [cs]/Logique en informatique [cs.LO]
Informatique [cs]/Intelligence artificielle [cs.AI]
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
Vulgarisation :
Non
Collections :
Source :