Yoshiki Nakamura

Publication Activity (10 Years)

Years Active: 2016-2024
Publications (10 Years): 14

Top Topics

Transitive Closure

Regular Languages

Relation Algebra

Binary Relations

Top Venues

Publications

Yoshiki Nakamura
Undecidability of the Positive Calculus of Relations with Transitive Closure and Difference: Hypothesis Elimination Using Graph Loops. RAMiCS (2024)
Yoshiki Nakamura, Ryoma Sin'ya
Words-to-Letters Valuations for Language Kleene Algebras with Variable Complements. AFL (2023)
Yoshiki Nakamura
Note on a Translation from First-Order Logic into the Calculus of Relations Preserving Validity and Finite Validity. CoRR (2023)
Yoshiki Nakamura
Existential Calculi of Relations with Transitive Closure: Complexity and Edge Saturations. LICS (2023)
Yoshiki Nakamura
On the Finite Variable-Occurrence Fragment of the Calculus of Relations with Bounded Dot-Dagger Alternation. MFCS (2023)
Yoshiki Nakamura
On the Finite Variable-Occurrence Fragment of the Calculus of Relations with Bounded Dot-Dagger Alternation. CoRR (2023)
Yoshiki Nakamura
Expressive power and succinctness of the positive calculus of binary relations. J. Log. Algebraic Methods Program. 127 (2022)
Yoshiki Nakamura
Spatial Existential Positive Logics for Hyperedge Replacement Grammars. CSL (2022)
Yoshiki Nakamura, Naosuke Matsuda
On Implicational Intermediate Logics Axiomatizable by Formulas Minimal in Classical Logic: A Counter-Example to the Komori-Kashima Problem. Stud Logica 109 (6) (2021)
Yoshiki Nakamura
Expressive Power and Succinctness of the Positive Calculus of Relations. RAMiCS (2020)
Yoshiki Nakamura, Kazuyuki Asada, Naoki Kobayashi, Ryoma Sin'ya, Takeshi Tsukada
On Average-Case Hardness of Higher-Order Model Checking. FSCD (2020)
Yoshiki Nakamura
The Undecidability of FO3 and the Calculus of Relations with Just One Binary Relation. ICLA (2019)
Yoshiki Nakamura
Partial derivatives on graphs for Kleene allegories. LICS (2017)
Yoshiki Nakamura
The Almost Equivalence by Asymptotic Probabilities for Regular Languages and Its Computational Complexities. GandALF (2016)