Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

Tadashi Kanamori

dblp:65/3481 · DBLP profile ↗
← Back
5ranked-venue papers
4as first author
0since 2021 · last 1990
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 4 · 3 first-authorArtificial intelligence and machine learning · 2 · 2 first-authorSoftware engineering, systems software and programming languages · 2 · 2 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Logic in computer science · 100%
Software engineering, system software, and programming languages
1 paper
Programming languages and type systems · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Programming languages and type systems
type inference		 0.011985
Type Inference in Prolog and Its Application · IJCAI 1985
Logic in computer science
logic programming		 0.011985
Type Inference in Prolog and Its Application · IJCAI 1985
Logic in computer science › logic programming
prolog		 0.011985
Type Inference in Prolog and Its Application · IJCAI 1985
YearPublicationVenuePosition
1990 Preservation of Stronger Equivalence in Unfold/Fold Logic Program Transformation
Tadashi Kawamura, Tadashi Kanamori
 Theor. Comput. Sci.2
1987 Construction of Logic Programs Based on Generalized Unfold/Fold Rules
Tadashi Kanamori, Kenji Horiuchi
 ICLP1
1986 Formulation of Induction Formulas in Verification of Prolog Programs
Tadashi Kanamori
 CADE1
1986 Verification of Prolog Programs Using an Extension of Execution
Tadashi Kanamori, Hirohisa Seki
 ICLP1
1985 Type Inference in Prolog and Its Application
Tadashi Kanamori, Kenji Horiuchi
 IJCAI1