Characterizing Definability in Decidable ...

Document type :
Communication dans un congrès avec actes
DOI :
10.4230/LIPIcs.ICALP.2017.107
Title :
Characterizing Definability in Decidable Fixpoint Logics
Author(s) :
Benedikt, Michael [Auteur]
Department of Computer Science [Oxford]
Bourhis, Pierre [Auteur] refId
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Linking Dynamic Data [LINKS]
Boom, Michael [Auteur]
Department of Computer Science [Oxford]
Scientific editor(s) :
Ioannis Chatzigiannakis
Piotr Indyk
Fabian Kuhn
Anca Muscholl
Conference title :
ICALP 2017 - 44th International Colloquium on Automata, Languages, and Programming
City :
Varsovie
Country :
Pologne
Start date of the conference :
2017-07-10
English keyword(s) :
bisimulation
definability
automata
Guarded logics
HAL domain(s) :
Informatique [cs]/Base de données [cs.DB]
English abstract : [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 ...
Show more >
Language :
Anglais
Peer reviewed article :
Oui
Audience :
Internationale
Popular science :
Non
Collections :
Source :
Harvested from HAL
Files
Thumbnail
Thumbnail
Thumbnail