Author of the publication

A Subpath Kernel for Rooted Unordered Trees.

, , , and . PAKDD (1), volume 6634 of Lecture Notes in Computer Science, page 62-74. Springer, (2011)

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

Dual Calculus with Inductive and Coinductive Types., and . RTA, volume 5595 of Lecture Notes in Computer Science, page 224-238. Springer, (2009)Restriction on Cut in Cyclic Proof System for Symbolic Heaps., , and . FLOPS, volume 12073 of Lecture Notes in Computer Science, page 88-105. Springer, (2020)Fast Computation of Subpath Kernel for Trees., and . ICML, icml.cc / Omnipress, (2012)Failure of Cut-Elimination in the Cyclic Proof System of Bunched Logic with Inductive Propositions., , and . FSCD, volume 195 of LIPIcs, page 11:1-11:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Call-by-Value and Call-by-Name Dual Calculi with Inductive and Coinductive Types, and . Logical Methods in Computer Science, (2013)Decision Procedure for Entailment of Symbolic Heaps with Arrays., and . APLAS, volume 10695 of Lecture Notes in Computer Science, page 169-189. Springer, (2017)A Subpath Kernel for Rooted Unordered Trees., , , and . PAKDD (1), volume 6634 of Lecture Notes in Computer Science, page 62-74. Springer, (2011)Decidability for Entailments of Symbolic Heaps with Arrays., and . CoRR, (2018)Classical Natural Deduction for S4 Modal Logic., and . APLAS, volume 5904 of Lecture Notes in Computer Science, page 243-258. Springer, (2009)Completeness of Cyclic Proofs for Symbolic Heaps with Inductive Definitions., , and . APLAS, volume 11893 of Lecture Notes in Computer Science, page 367-387. Springer, (2019)