Norihiro Kamide

Norihiro Kamide

Auto-generated profile, based on publicly available information

Norihiro Kamide

School of Data Science, Nagoya City University, Nagoya, Japan

Research Focus & Metrics

Academic Career Length

24Years (2003-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
28 May 2017 in Studia Logica
Verified
Journal Article
Closed access
PDF file
NKNorihiro Kamide
Norihiro Kamide

7 November 2013 in Studia Logica
Verified
Journal Article
Closed access
PDF file
NKNorihiro Kamide
Norihiro Kamide

6 March 2017 in Journal of Philosophical Logic
Verified
Journal Article
Closed access
PDF file
NKNorihiro Kamide
Norihiro Kamide

1 January 2011 in Fundamenta Informaticae
Verified
Journal Article
Closed access
PDF file
NKNorihiro Kamide
Norihiro Kamide
HWHeinrich Wansing
Heinrich Wansing
Inconsistency-tolerant reasoning and paraconsistent logic are of growing importance not only in Knowledge Representation, AI and other areas of Computer Science, but also in Philosophical Logic. In this paper, a new logic, paraconsistent linear-time temporal logic (PLTL), is obtained semantically from the linear-time temporal logic LTL by adding a paraconsistent negation. Some theorems for embedding PLTL into LTL are proved, and PLTL is shown to be decidable. A Gentzentype sequent calculus PLTω for PLTL is introduced, and the completeness and cut-elimination theorems for this calculus are proved. In addition, a display calculus δPLTω for PLTL is defined.

30 November 2010 in Applied Artificial Intelligence
Verified
Journal Article
Closed access
KKKen Kaneiwa
Ken Kaneiwa
NKNorihiro Kamide
Norihiro Kamide
We propose a proof system for reasoning on certain specifications of secure authentication systems. For this purpose, a new logic, sequence-indexed linear-time temporal logic (SLTL), is obtained semantically from standard linear-time temporal logic (LTL) by adding a sequence modal operator that represents a sequence of symbols. By this sequence modal operator, we can appropriately express message flows between clients and servers and states of servers in temporal reasoning. A Gentzen-type sequent calculus for SLTL is introduced, and the completeness and cut-elimination theorems for it are proved. SLTL is also shown to be PSPACE-complete and embeddable into LTL.

19 May 2011 in International Journal of Intelligent Systems
Verified
Journal Article
Closed access
PDF file
KKKen Kaneiwa
Ken Kaneiwa
NKNorihiro Kamide
Norihiro Kamide
In this paper, we propose a method for modeling concepts in full computation-tree logic with sequence modal operators. An extended full computation-tree logic, CTLS*, is introduced as a Kripke semantics with a sequence modal operator. This logic can appropriately represent hierarchical tree structures in cases where sequence modal operators in CTLS* are applied to tree structures. We prove a theorem for embedding CTLS* into CTL*. The validity, satisfiability, and model-checking problems of CTLS* are shown to be decidable. An illustrative example of biological taxonomy is presented using CTLS* formulas.