A Road-Map on Complexity for Hybrid Logics, Computer Science Logic, CSL 99, pp.307-321, 1999. ,
DOI : 10.1007/3-540-48168-0_22
URL : https://hal.archives-ouvertes.fr/inria-00000337
The Description Logic Handbook, 2003. ,
DOI : 10.1017/CBO9780511711787
Modal Logic, 2001. ,
DOI : 10.1017/CBO9781107050884
URL : https://hal.archives-ouvertes.fr/inria-00100502
Pure Extensions, Proof Rules, and Hybrid Axiomatics, Studia Logica, vol.40, issue.3, pp.277-322, 2006. ,
DOI : 10.1007/s11225-006-9009-6
URL : https://hal.archives-ouvertes.fr/inria-00119855
Hybrid languages and temporal logic, Logic Journal of IGPL, vol.7, issue.1, pp.27-54, 1999. ,
DOI : 10.1093/jigpal/7.1.27
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.192.4824
Modal Logic, 1980. ,
DOI : 10.1017/CBO9780511621192
Modal Logics are Coalgebraic, The Computer Journal, vol.54, issue.1, 2009. ,
DOI : 10.1093/comjnl/bxp004
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.147.2957
Finality regained: A coalgebraic study of Scott-sets and multisets, Archive for Mathematical Logic, vol.41, issue.3, pp.267-298, 2002. ,
DOI : 10.1007/s001530100110
Presburger modal logic is only PSPACE-complete, Automated Reasoning, IJCAR 06, pp.541-556, 2006. ,
DOI : 10.1007/11814771_44
On the Complexity of Conditional Logics, Knowledge Representation and Reasoning , KR 94, pp.202-213, 1994. ,
DOI : 10.1016/B978-1-4832-1452-8.50115-9
Conjunctive query answering for description logics with transitive roles, Description Logics, DL 06 of CEUR Workshop Proceedings. CEUR-WS.org, 2006. ,
A Proposal for Dealing with Deontic Dilemmas, In Deontic Logic in Computer Science, vol.3065, pp.74-113, 2004. ,
DOI : 10.1007/978-3-540-25927-5_7
Narcissists, stepmothers and spies, Description Logics, DL 02, CEUR Workshop Proceedings, 2002. ,
Coalgebraic Hybrid Logic, Foundations of Software Science and Computation Structures, FOSSACS 09, 2009. ,
DOI : 10.1007/3-540-48754-9_24
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.156.8128
PDL with data constants, Information Processing Letters, vol.20, issue.1, pp.35-41, 1985. ,
DOI : 10.1016/0020-0190(85)90127-9
Coalgebraic modal logic: soundness, completeness and decidability of local consequence, Theoretical Computer Science, vol.309, issue.1-3, pp.177-193, 2003. ,
DOI : 10.1016/S0304-3975(03)00201-9
A Modal Logic for Coalitional Power in Games, Journal of Logic and Computation, vol.12, issue.1, pp.149-166, 2002. ,
DOI : 10.1093/logcom/12.1.149
Hybrid Counterfactual Logics, Journal of Logic, Language and Information, vol.13, issue.3, p.515539, 2009. ,
DOI : 10.1007/s10849-009-9090-0
A finite model construction for coalgebraic modal logic, The Journal of Logic and Algebraic Programming, vol.73, issue.1-2, pp.97-110, 2007. ,
DOI : 10.1016/j.jlap.2006.11.004
Rank-1 Modal Logics are Coalgebraic, Journal of Logic and Computation, vol.20, issue.5 ,
DOI : 10.1093/logcom/exn096
Modular Algorithms for Heterogeneous Modal Logics, Automata, Languages and Programming, ICALP 07, pp.459-471, 2007. ,
DOI : 10.1007/978-3-540-73420-8_41
PSPACE bounds for rank-1 modal logics, ACM Transactions on Computational Logic, vol.10, issue.2, pp.1-33, 2009. ,
DOI : 10.1145/1462179.1462185
Strong completeness of coalgebraic modal logics, Theoretical Aspects of Computer Science, STACS 09, Leibniz International Proceedings in Informatics, pp.673-684, 2009. ,
Topological perspective on the hybrid proof rules, Hybrid Logic, HyLo 06, pp.79-94, 2007. ,