@inproceedings{bd40e3272cba4098a6bdbf4c51fb9699,
title = "Characterizing definability in decidable fixpoint logics",
abstract = "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.",
keywords = "Automata, Bisimulation, Definability, Guarded logics",
author = "Michael Benedikt and Pierre Bourhis and \{Vanden Boom\}, Michael",
note = "Publisher Copyright: {\textcopyright} Michael Benedikt, Pierre Bourhis, and Michael Vanden Boom;.; 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017 ; Conference date: 10-07-2017 Through 14-07-2017",
year = "2017",
month = jul,
day = "1",
doi = "10.4230/LIPIcs.ICALP.2017.107",
language = "English",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
editor = "Anca Muscholl and Piotr Indyk and Fabian Kuhn and Ioannis Chatzigiannakis",
booktitle = "44th International Colloquium on Automata, Languages, and Programming, ICALP 2017",
}