Conference item
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.
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Version of record, pdf, 555.8KB)
-
- Publisher copy:
- 10.4230/LIPIcs.ICALP.2017.107
Authors
Funding
+ Engineering and Physical Sciences Research Council
More from this funder
Funding agency for:
Benedikt, M
Vanden Boom, M
Grant:
DBOnto (EP/L012138/1
DBOnto (EP/L012138/1
Bibliographic Details
- Publisher:
- Schloss Dagstuhl Publisher's website
- Host title:
- 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)
- Series:
- Leibniz International Proceedings in Informatics (LIPIcs)
- Journal:
- ICALP 2017 Journal website
- Volume:
- 80
- Pages:
- 107:1--107:14
- Publication date:
- 2017-07-06
- Acceptance date:
- 2017-04-14
- DOI:
- ISSN:
-
1868-8969
- ISBN:
- 9783959770415
Item Description
- Keywords:
- Pubs id:
-
pubs:691550
- UUID:
-
uuid:c41ef0f2-2795-4346-82a8-b5e21628cdf3
- Local pid:
- pubs:691550
- Source identifiers:
-
691550
- Deposit date:
- 2017-04-28
Terms of use
- Copyright holder:
- Benedikt et al
- Copyright date:
- 2017
- Notes:
-
Copyright © Michael Benedikt, Pierre Bourhis, and Michael Vanden Boom;
licensed under Creative Commons License CC-BY.
- Licence:
- CC Attribution (CC BY)
Metrics
If you are the owner of this record, you can report an update to it here: Report update to this record