( en | de | ru )

 

Disambiguation of "Fervari, Raul"

Author of the publication

copydeleteadd this publication to your clipboard
How Easy it is to Know How: An Upper Bound for the Satisfiability Problem.

, , , , and . CoRR, (2023)

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.

Helmut Raulf

Hartwig Rauleder

Gitta Raulin

Monika Raulf

Gerhard Rauls

 

Other publications of authors with the same name

The power of modal separation logics., and . J. Log. Comput., 29 (8): 1139-1184 (2019)Mechanizing Bisimulation Theorems for Relation-Changing Logics in Coq., , and . DaLí, volume 12005 of Lecture Notes in Computer Science, page 3-18. Springer, (2019)On Composing Finite Forests with Modal Logics., , , and . ACM Trans. Comput. Log., 24 (2): 12:1-12:46 (April 2023)Modal Logics and Local Quantifiers: A Zoo in the Elementary Hierarchy., and . FoSSaCS, volume 13242 of Lecture Notes in Computer Science, page 305-324. Springer, (2022)Axiomatizations for downward XPath on Data Trees., , , and . CoRR, (2016)Beyond the Spell: A Dynamic Logic Analysis of Misdirection., and . CoRR, (2024)Non-monotonic Reasoning via Dynamic Consequence., , and . WoLLIC, volume 13468 of Lecture Notes in Computer Science, page 395-410. Springer, (2022)Verification of dynamic bisimulation theorems in Coq., , and . J. Log. Algebraic Methods Program., (2021)Algebraic tools for default modal systems., , , and . J. Log. Comput., 33 (6): 1301-1325 (August 2023)A Deontic Logic of Knowingly Complying., , , , and . AAMAS, page 364-372. ACM, (2023)