Author of the publication

Branching-time logic ECTL# and its tree-style one-pass tableau: Extending fairness expressibility of ECTL+.

, , and . Theor. Comput. Sci., (2020)

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

Verified Model Checking for Conjunctive Positive Logic., , , and . SN Comput. Sci., 2 (5): 344 (2021)Learnability of Kolmogorov-easy circuit expressions via queries., , and . EuroCOLT, volume 904 of Lecture Notes in Computer Science, page 112-124. Springer, (1995)The Structure of Logarithmic Advice Complexity Classes., and . Theor. Comput. Sci., 207 (1): 217-244 (1998)Negative results on learning multivalued dependencies with queries., and . Inf. Process. Lett., 111 (19): 968-972 (2011)Exact Learning: On the Boundary between Horn and CNF., and . ACM Trans. Comput. Theory, 12 (1): 4:1-4:25 (2020)Invariant-Free Clausal Temporal Resolution., , , , and . J. Autom. Reason., 50 (1): 1-49 (2013)Dual Systems of Tableaux and Sequents for PLTL., , , , and . J. Log. Algebraic Methods Program., 78 (8): 701-722 (2009)Exact Learning of Multivalued Dependencies., and . ALT, volume 9355 of Lecture Notes in Computer Science, page 73-88. Springer, (2015)Characterizations of Logarithmic Advice Complexity Classes., , and . IFIP Congress (1), volume A-12 of IFIP Transactions, page 315-321. North-Holland, (1992)A Cut-Free and Invariant-Free Sequent Calculus for PLTL., , , , and . CSL, volume 4646 of Lecture Notes in Computer Science, page 481-495. Springer, (2007)