Author of the publication

Computational Complexity of Multimodal Logics Based on Rough Sets.

, and . Fundam. Informaticae, 44 (4): 373-396 (2000)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Internal Calculi for Separation Logics., , and . CoRR, (2019)Axiomatising Logics with Separating Conjunction and Modalities., , and . JELIA, volume 11468 of Lecture Notes in Computer Science, page 692-708. Springer, (2019)Relative Similarity Logics are Decidable: Reduction to FO2 with Equality., and . JELIA, volume 1489 of Lecture Notes in Computer Science, page 279-293. Springer, (1998)Counter Systems for Data Logics.. JELIA, volume 6341 of Lecture Notes in Computer Science, page 10. Springer, (2010)A Complete Axiomatisation for Quantifier-Free Separation Logic., , and . CoRR, (2020)Concrete domains in logics: a survey., and . ACM SIGLOG News, 8 (3): 6-29 (2021)A Completeness Proof for a Logic with an Alternative Necessity Operator.. Stud Logica, 58 (1): 99-112 (1997)Computational Complexity of Multimodal Logics Based on Rough Sets., and . Fundam. Informaticae, 44 (4): 373-396 (2000)LTL with the freeze quantifier and register automata., and . ACM Trans. Comput. Log., 10 (3): 16:1-16:30 (2009)Expressive Completeness of Separation Logic with Two Variables and No Separating Conjunction., and . ACM Trans. Comput. Log., 17 (2): 12 (2016)