M. R. K. Krishna Rao

According to our database1, M. R. K. Krishna Rao
  • authored at least 41 papers between 1991 and 2009.
  • has a "Dijkstra number"2 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2009
Learning Hereditary and Reductive Prolog Programs from Entailment.
Proceedings of the Emerging Intelligent Computing Technology and Applications. With Aspects of Artificial Intelligence, 2009

2008
Some classes of term rewriting systems inferable from positive data.
Theor. Comput. Sci., 2008

2007
Infusing Critical Thinking Skill Classification into a Software Engineering Course.
Proceedings of the 2007 International Conference on Frontiers in Education: Computer Science & Computer Engineering, 2007

2006
Storytelling and puzzles in a software engineering course.
Proceedings of the 39th SIGCSE Technical Symposium on Computer Science Education, 2006

Infusing Parts-whole Relationship Critical Thinking Skill into Basic Computer Science Education.
Proceedings of the 2006 International Conference on Frontiers in Education: Computer Science & Computer Engineering, 2006

Infusing Critical Thinking Skill Compare and Contrast into Content of Data Structures Course.
Proceedings of the 2006 International Conference on Frontiers in Education: Computer Science & Computer Engineering, 2006

Finding Reasons and Conclusion in a Basic Computer Science Course.
Proceedings of the 2006 International Conference on Frontiers in Education: Computer Science & Computer Engineering, 2006

Learnability of Term Rewrite Systems from Positive Examples.
Proceedings of the Theory of Computing 2006, 2006

2005
Principles of curriculum design and revision: a case study in implementing computing curricula CC2001.
Proceedings of the 10th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 2005

Infusing critical thinking skills into content of AI course.
Proceedings of the 10th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 2005

A Class of Prolog Programs with Non-linear Outputs Inferable from Positive Data.
Proceedings of the Algorithmic Learning Theory, 16th International Conference, 2005

2004
Input-Termination of Logic Programs.
Proceedings of the Logic Based Program Synthesis and Transformation, 2004

Learnability of Simply-Moded Logic Programs from Entailment.
Proceedings of the Advances in Computer Science, 2004

Inductive Inference of Term Rewriting Systems from Positive Data.
Proceedings of the Algorithmic Learning Theory, 15th International Conference, 2004

2003
Polynomial-Time Learnability from Entailment.
Proceedings of the Logic Programming, 19th International Conference, 2003

2001
Polynomial-time learnability of logic programs with local variables from entailment.
Theor. Comput. Sci., 2001

2000
Some classes of prolog programs inferable from positive data.
Theor. Comput. Sci., 2000

Some characteristics of strong innermost normalization.
Theor. Comput. Sci., 2000

1999
Learning Logic Programs with Local Variables from Positive Examples.
Proceedings of the Advanced Topics in Artificial Intelligence, 1999

1998
Modular Aspects of Term Graph Rewriting.
Theor. Comput. Sci., 1998

Transformational Methodology for Proving Termination of Logic Programs.
J. Log. Program., 1998

Learning Linearly-Moded Programs from Entailment.
Proceedings of the PRICAI'98, 1998

Learning from Entailment of Logic Programs with Local Variables.
Proceedings of the Algorithmic Learning Theory, 9th International Conference, 1998

1997
A Framework for Incremental Learning of Logic Programs.
Theor. Comput. Sci., 1997

Proving Termination of GHC Programs.
New Generation Comput., 1997

1996
Relating Confluence, Innermost-Confluence and Outermost-Confluence Properties of Term Rewriting Systems.
Acta Inf., 1996

Modularity of Termination in Term Graph Rewriting.
Proceedings of the Rewriting Techniques and Applications, 7th International Conference, 1996

Completeness Results for Basic Narrowing in Non-Copying Implementations.
Proceedings of the Logic Programming, 1996

Some Characteristics of Strong Innermost Normalization.
Proceedings of the Algebraic Methodology and Software Technology, 1996

A Class of Prolog Programs Inferable from Positive Data.
Proceedings of the Algorithmic Learning Theory, 7th International Workshop, 1996

1995
Modular Proofs for Completeness of Hierarchical Term Rewriting Systems.
Theor. Comput. Sci., 1995

Semi-Completeness of Hierarchical and Super-Hierarchical Combinations of Term Rewriting Systems.
Proceedings of the TAPSOFT'95: Theory and Practice of Software Development, 1995

Unification-Free Execution of Well-Moded and Well-Typed Prolog Programs
Proceedings of the Static Analysis, 1995

Graph Reducibility of Term Rewriting Systems.
Proceedings of the Mathematical Foundations of Computer Science 1995, 1995

Incremental Learning of Logic Programs.
Proceedings of the Algorithmic Learning Theory, 6th International Conference, 1995

1994
Simple Termination of Hierarchical Combinations of Term Rewriting Systems.
Proceedings of the Theoretical Aspects of Computer Software, 1994

1993
Proving Termination of GHC Programs.
Proceedings of the Logic Programming, 1993

Completeness of Hierarchical Combinations of term Rewriting Systems.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1993

Verification Tools in the Development of Provably Correct Compilers.
Proceedings of the FME '93: Industrial-Strength Formal Methods, 1993

1992
Rewriting Concepts in the Study of Termination of Logic Programs.
Proceedings of the ALPUK92, Proceedings of the 4th UK Conference on Logic Programming, London, 30 March, 1992

1991
A Transformational Methodology for Proving Termination of Logic Programs.
Proceedings of the Computer Science Logic, 5th Workshop, 1991


  Loading...