Chao-Chih Yang

According to our database1, Chao-Chih Yang authored at least 21 papers between 1973 and 1991.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

1991
Integrating integer programming and probabilistic deduction graphs for probabilistic reasoning.
J. Syst. Integr., 1991

Abductive reasoning by constructing probabilistic deduction graphs for solving the diagnosis problem.
Decis. Support Syst., 1991

A Shortest Path Algorithm to Find Minimal Deduction Graphs.
Data Knowl. Eng., 1991

Using Normal Deduction Graphs in Default Reasoning.
Proceedings of the Methodologies for Intelligent Systems, 6th International Symposium, 1991

1989
Algorithms for Constructing Minimal Deduction Graphs.
IEEE Trans. Software Eng., 1989

Deduction Graphs: An Algorithm and Applications.
IEEE Trans. Software Eng., 1989

Parallel Algorithms for Solving the Satisfaction Problem of Functional and Multivalued Data Dependencies.
Data Knowl. Eng., 1989

Building multi-way gateways for local area networks.
Proceedings of the 14th Conference on Local Computer Networks, 1989

1988
An Improved Algorithm Based on Subset Closures for Synthesizing a Relational Database Scheme.
IEEE Trans. Software Eng., 1988

1987
An Algorithm for Logically Deducing Horn Clauses and Processing Logic Queries.
Int. J. Pattern Recognit. Artif. Intell., 1987

On Interpreting and Inferring Propositional Formulas of Data Dependencies in a Relational Database.
Data Knowl. Eng., 1987

A Logic Programming Perspective on Decision Table Theory and Practice.
Data Knowl. Eng., 1987

1984
Algorithms for the inverse and a generalization of the state space approach to finite automata.
Int. J. Parallel Program., 1984

1980
Algorithms for finding directed graph isomorphisms by finite automata.
Int. J. Parallel Program., 1980

1978
A Correction and Some Comments Concerning Graph Isomorphism by Finite Automata.
IEEE Trans. Computers, 1978

1976
An Algorithm for Deriving All Pairs of Compatible States by Closure Classes.
IEEE Trans. Computers, 1976

1975
Comments on "Closure Partition Method for Minimizing Incomplete Sequential Machines".
IEEE Trans. Computers, 1975

Structural Preserving Morphisms of Finite Automata and an Application to Graph Isomorphism.
IEEE Trans. Computers, 1975

On the Equivalence of Two Algorithms for Finding All Maximal Compatibles.
IEEE Trans. Computers, 1975

1974
Generation of All Closed Partitions on the State Set of a Sequential Machine.
IEEE Trans. Computers, 1974

1973
Closure Partition Method for Minimizing Incomplete Sequential Machines.
IEEE Trans. Computers, 1973


  Loading...