default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKyoichi Nakashima
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2003
[j4]Noboru Takagi, Kyoichi Nakashima:
Mathematical Foundation on Static Hazards in Multiple-Valued Logic Circuits. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86-A(6): 1525-1534 (2003)- [c15]Noboru Takagi, Kyoichi Nakashima:
Hyperoperations on {0, 1, 2} Based on Min, Max, and Universal Literal Operations. ISMVL 2003: 11-16 - 2002
- [c14]Noboru Takagi, Kyoichi Nakashima:
Logic for Static Hazard Detection of Multiple-Valued Logic Circuits with Tsum, Min, and Literals. ISMVL 2002: 46-53 - 2001
- [c13]Noboru Takagi, Hiroaki Kikuchi, Kyoichi Nakashima:
Multi-Interval Truth Valued Logic. FUZZ-IEEE 2001: 1119-1122 - 2000
- [j3]Noboru Takagi, Kyoichi Nakashima:
Discrete Interval Truth Values Logic and Its Application. IEEE Trans. Computers 49(3): 219-229 (2000) - [c12]Noboru Takagi, Kyoichi Nakashima:
Some Properties of Discrete Interval Truth Valued Logic. ISMVL 2000: 101-106
1990 – 1999
- 1999
- [c11]Noboru Takagi, Akimitsu Hon-nami, Kyoichi Nakashima:
Logical Model for Representing Uncertain Statuses of Multiple-Valued Logic Systems Realized by Min, Max and Literals. ISMVL 1999: 110-115 - 1998
- [j2]Noboru Takagi, Hiroaki Kikuchi, Kyoichi Nakashima, Masao Mukaidono:
Identification of incompletely specified multiple-valued Kleenean functions. IEEE Trans. Syst. Man Cybern. Part A 28(5): 637-647 (1998) - [c10]Noboru Takagi, Akimitsu Hon-nami, Kyoichi Nakashima:
A Characterization of r-Valued Functions Monotonic in an Order Based on Regularity. ISMVL 1998: 71-76 - 1997
- [c9]Noboru Takagi, Y. Nakamura, Kyoichi Nakashima:
Set-Valued Functions and Regularity. ISMVL 1997: 89-96 - 1996
- [c8]Noboru Takagi, Kyoichi Nakashima, Masao Mukaidono:
A Necessary and Sufficient Condition for Lukasiewicz Logic Functions. ISMVL 1996: 37-42 - [c7]Kyoichi Nakashima, Y. Nakamura, Noboru Takagi:
Logic Expressions of Monotonic Multiple-Valued Functions. ISMVL 1996: 290-295 - 1995
- [c6]Noboru Takagi, Hiroaki Kikuchi, Kyoichi Nakashima, Masao Mukaidono:
A Characterization of Kleenean Functions. ISMVL 1995: 236-241 - 1994
- [c5]Noboru Takagi, Kyoichi Nakashima, Masao Mukaidono:
Minimization for Kleene-Stone Logic Functions. ISMVL 1994: 124-113 - 1993
- [j1]Yutaka Hata, Kyoichi Nakashima, Kazuharu Yamato:
Some Fundamental Properties of Multiple-Valued Kleenean Functions and Determination of Their Logic Formulas. IEEE Trans. Computers 42(8): 950-961 (1993) - [c4]Noboru Takagi, Kyoichi Nakashima, Masao Mukaidono:
A Canonical Disjunctive Form of Extended Kleene-Stone Logic Functions. ISMVL 1993: 36-41 - 1992
- [c3]Kyoichi Nakashima, Noboru Takagi:
On Multiple-Valued Logic Functions Monotonic with Respect to Ambiguity. ISMVL 1992: 236-242 - [c2]Noboru Takagi, Kyoichi Nakashima, Masao Mukaidono:
Fundamental Properties of Extended Kleene-Stone Logic Functions. ISMVL 1992: 243-249 - 1990
- [c1]Yutaka Hata, Kyoichi Nakashima, Kazuharu Yamato:
Some Relationships Between Multiple-Valued Kleenean Functions and Ternary Input Multiple-Valued Output Functions. ISMVL 1990: 410-417
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
