Author of the publication

How Easy it is to Know How: An Upper Bound for the Satisfiability Problem.

, , , , and . JELIA, volume 14281 of Lecture Notes in Computer Science, page 405-419. Springer, (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.

 

Other publications of authors with the same name

Mechanizing Bisimulation Theorems for Relation-Changing Logics in Coq., , and . DaLí, volume 12005 of Lecture Notes in Computer Science, page 3-18. Springer, (2019)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)Data-Aware Hybrid Tableaux., , and . CoRR, (2024)Axiomatizations for downward XPath on Data Trees., , , and . CoRR, (2016)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)Non-monotonic Reasoning via Dynamic Consequence., , and . WoLLIC, volume 13468 of Lecture Notes in Computer Science, page 395-410. Springer, (2022)A Deontic Logic of Knowingly Complying., , , , and . AAMAS, page 364-372. ACM, (2023)Interpolation and Beth Definability in Default Logics., , , and . JELIA, volume 11468 of Lecture Notes in Computer Science, page 675-691. Springer, (2019)Data Graphs with Incomplete Information (and a Way to Complete Them)., , , and . JELIA, volume 14281 of Lecture Notes in Computer Science, page 729-744. Springer, (2023)