Title :

Definability and Interpolation within Decidable Fixpoint Logics

Author(s) :

Benedikt, Michael [Auteur]
Computing Science Laboratory - Oxford University
Bourhis, Pierre [Auteur]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Linking Dynamic Data [LINKS]
Vanden Boom, Michael [Auteur]
Computing Science Laboratory - Oxford University

Journal title :

Logical Methods in Computer Science

Publisher :

Logical Methods in Computer Science Association

Publication date :

2019

HAL domain(s) :

Informatique [cs]/Base de données [cs.DB]
Informatique [cs]/Logique en informatique [cs.LO]
Informatique [cs]/Intelligence artificielle [cs.AI]

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 >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.Show less >

Language :

Anglais

Peer reviewed article :

Oui

Audience :

Internationale

Popular science :

Non

Collections :

• Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189

Source :

Harvested from HAL