default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChao-Chih Yang
Person information
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1991
[j19]Wen-Bing Horng, Chao-Chih Yang:
A Shortest Path Algorithm to Find Minimal Deduction Graphs. Data Knowl. Eng. 6: 27-46 (1991)- [j18]Han-Lin Li, Chao-Chih Yang:
Abductive reasoning by constructing probabilistic deduction graphs for solving the diagnosis problem. Decis. Support Syst. 7(2): 121-131 (1991) - [j17]Han-Lin Li, Chao-Chih Yang:
Integrating integer programming and probabilistic deduction graphs for probabilistic reasoning. J. Syst. Integr. 1(2): 195-214 (1991) - [c2]Ricardo A. Munoz, Chao-Chih Yang:
Using Normal Deduction Graphs in Default Reasoning. ISMIS 1991: 203-212
1980 – 1989
- 1989
- [j16]Chao-Chih Yang, Weicong Shen:
Parallel Algorithms for Solving the Satisfaction Problem of Functional and Multivalued Data Dependencies. Data Knowl. Eng. 3(4): 323-338 (1989) - [j15]Chao-Chih Yang:
Deduction Graphs: An Algorithm and Applications. IEEE Trans. Software Eng. 15(1): 60-67 (1989) - [j14]Chao-Chih Yang, Jennifer Jau-Yin Chen, H. Lewis Chau:
Algorithms for Constructing Minimal Deduction Graphs. IEEE Trans. Software Eng. 15(6): 760-770 (1989) - [c1]Cui-Qing Yang, Chao-Chih Yang, Guohong Xu:
Building multi-way gateways for local area networks. LCN 1989: 278-284 - 1988
- [j13]Chao-Chih Yang, Guang Li, Peter A. Ng:
An Improved Algorithm Based on Subset Closures for Synthesizing a Relational Database Scheme. IEEE Trans. Software Eng. 14(11): 1731-1738 (1988) - 1987
- [j12]Kevin D. Reilly, Akram Salah, Chao-Chih Yang:
A Logic Programming Perspective on Decision Table Theory and Practice. Data Knowl. Eng. 2: 191-212 (1987) - [j11]Chao-Chih Yang:
On Interpreting and Inferring Propositional Formulas of Data Dependencies in a Relational Database. Data Knowl. Eng. 2: 323-338 (1987) - [j10]Chao-Chih Yang:
An Algorithm for Logically Deducing Horn Clauses and Processing Logic Queries. Int. J. Pattern Recognit. Artif. Intell. 1(1): 157-168 (1987) - 1984
- [j9]Chao-Chih Yang, Houkuan Huang:
Algorithms for the inverse and a generalization of the state space approach to finite automata. Int. J. Parallel Program. 13(1): 59-76 (1984) - 1980
- [j8]Chao-Chih Yang, Charmane P. May:
Algorithms for finding directed graph isomorphisms by finite automata. Int. J. Parallel Program. 9(2): 117-140 (1980)
1970 – 1979
- 1978
- [j7]Chao-Chih Yang, Charmane P. May:
A Correction and Some Comments Concerning Graph Isomorphism by Finite Automata. IEEE Trans. Computers 27(1): 95-96 (1978) - 1976
- [j6]Chao-Chih Yang, Marilyn A. Tarpy:
An Algorithm for Deriving All Pairs of Compatible States by Closure Classes. IEEE Trans. Computers 25(2): 202-207 (1976) - 1975
- [j5]Chao-Chih Yang, Marek K. Babinski:
Comments on "Closure Partition Method for Minimizing Incomplete Sequential Machines". IEEE Trans. Computers 24(1): 106-108 (1975) - [j4]Chao-Chih Yang:
On the Equivalence of Two Algorithms for Finding All Maximal Compatibles. IEEE Trans. Computers 24(10): 977-979 (1975) - [j3]Chao-Chih Yang:
Structural Preserving Morphisms of Finite Automata and an Application to Graph Isomorphism. IEEE Trans. Computers 24(11): 1133-1139 (1975) - 1974
- [j2]Chao-Chih Yang:
Generation of All Closed Partitions on the State Set of a Sequential Machine. IEEE Trans. Computers 23(5): 530-533 (1974) - 1973
- [j1]Chao-Chih Yang:
Closure Partition Method for Minimizing Incomplete Sequential Machines. IEEE Trans. Computers 22(12): 1109-1122 (1973)
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 23:12 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:
