Yoshiki Nakamura
Orcid: 0000-0003-4106-0408Affiliations:
- Tokyo Institute of Technology, School of Computing, Tokyo, Japan
According to our database1,
Yoshiki Nakamura
authored at least 14 papers
between 2016 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Derivatives on Graphs for the Positive Calculus of Relations with Transitive Closure.
CoRR, 2024
Undecidability of the Positive Calculus of Relations with Transitive Closure and Difference: Hypothesis Elimination Using Graph Loops.
Proceedings of the Relational and Algebraic Methods in Computer Science, 2024
2023
Note on a Translation from First-Order Logic into the Calculus of Relations Preserving Validity and Finite Validity.
CoRR, 2023
Proceedings of the 16th International Conference on Automata and Formal Languages, 2023
On the Finite Variable-Occurrence Fragment of the Calculus of Relations with Bounded Dot-Dagger Alternation.
Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023
Existential Calculi of Relations with Transitive Closure: Complexity and Edge Saturations.
Proceedings of the 38th Annual ACM/IEEE Symposium on Logic in Computer Science, 2023
2022
J. Log. Algebraic Methods Program., 2022
Proceedings of the 30th EACSL Annual Conference on Computer Science Logic, 2022
2021
On Implicational Intermediate Logics Axiomatizable by Formulas Minimal in Classical Logic: A Counter-Example to the Komori-Kashima Problem.
Stud Logica, 2021
2020
Proceedings of the 5th International Conference on Formal Structures for Computation and Deduction, 2020
Proceedings of the Relational and Algebraic Methods in Computer Science, 2020
2019
The Undecidability of FO3 and the Calculus of Relations with Just One Binary Relation.
Proceedings of the Logic and Its Applications - 8th Indian Conference, 2019
2017
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017
2016
The Almost Equivalence by Asymptotic Probabilities for Regular Languages and Its Computational Complexities.
Proceedings of the Seventh International Symposium on Games, 2016