M. R. K. Krishna Rao

Publication Activity (10 Years)

Years Active: 1991-2009
Publications (10 Years): 0

Publications

Shahid Hussain, M. R. K. Krishna Rao
Learning Hereditary and Reductive Prolog Programs from Entailment. ICIC (2) (2009)
M. R. K. Krishna Rao
Some classes of term rewriting systems inferable from positive data. Theor. Comput. Sci. 397 (1-3) (2008)
Muhammad Shafique, Kanaan A. Faisal, M. R. K. Krishna Rao
Infusing Critical Thinking Skill Classification into a Software Engineering Course. FECS (2007)
M. R. K. Krishna Rao
Learnability of Term Rewrite Systems from Positive Examples. CATS (2006)
Kanaan A. Faisal, Ahmed Bagais, M. R. K. Krishna Rao
Finding Reasons and Conclusion in a Basic Computer Science Course. FECS (2006)
Muhammad Shafique, M. R. K. Krishna Rao
Infusing Parts-whole Relationship Critical Thinking Skill into Basic Computer Science Education. FECS (2006)
M. R. K. Krishna Rao, Muhammad Shafique, Kanaan A. Faisal, Ahmed Bagais
Infusing Critical Thinking Skill Compare and Contrast into Content of Data Structures Course. FECS (2006)
M. R. K. Krishna Rao
Storytelling and puzzles in a software engineering course. SIGCSE (2006)
M. R. K. Krishna Rao
A Class of Prolog Programs with Non-linear Outputs Inferable from Positive Data. ALT (2005)
M. R. K. Krishna Rao
Infusing critical thinking skills into content of AI course. ITiCSE (2005)
M. R. K. Krishna Rao
Learning Recursive Prolog Programs with Local Variables from Examples. AAIP (2005)
M. R. K. Krishna Rao, S. Junaidu, Talal Maghrabi, Muhammad Shafique, M. Ahmed, Kanaan A. Faisal
Principles of curriculum design and revision: a case study in implementing computing curricula CC2001. ITiCSE (2005)
M. R. K. Krishna Rao
Input-Termination of Logic Programs. LOPSTR (2004)
M. R. K. Krishna Rao
Learnability of Simply-Moded Logic Programs from Entailment. ASIAN (2004)
M. R. K. Krishna Rao
Inductive Inference of Term Rewriting Systems from Positive Data. ALT (2004)
M. R. K. Krishna Rao
Polynomial-Time Learnability from Entailment. ICLP (2003)
M. R. K. Krishna Rao, Abdul Sattar
Polynomial-time learnability of logic programs with local variables from entailment. Theor. Comput. Sci. 268 (2) (2001)
M. R. K. Krishna Rao
Some characteristics of strong innermost normalization. Theor. Comput. Sci. 239 (1) (2000)
M. R. K. Krishna Rao
Some classes of prolog programs inferable from positive data. Theor. Comput. Sci. 241 (1-2) (2000)
M. R. K. Krishna Rao, Abdul Sattar
Learning Logic Programs with Local Variables from Positive Examples. Australian Joint Conference on Artificial Intelligence (1999)
M. R. K. Krishna Rao, Abdul Sattar
Learning Linearly-Moded Programs from Entailment. PRICAI (1998)
M. R. K. Krishna Rao, Abdul Sattar
Learning from Entailment of Logic Programs with Local Variables. ALT (1998)
M. R. K. Krishna Rao
Modular Aspects of Term Graph Rewriting. Theor. Comput. Sci. 208 (1-2) (1998)
M. R. K. Krishna Rao, Deepak Kapur, R. K. Shyamasundar
Transformational Methodology for Proving Termination of Logic Programs. J. Log. Program. 34 (1) (1998)
M. R. K. Krishna Rao, Deepak Kapur, R. K. Shyamasundar
Proving Termination of GHC Programs. New Gener. Comput. 15 (3) (1997)
M. R. K. Krishna Rao
A Framework for Incremental Learning of Logic Programs. Theor. Comput. Sci. 185 (1) (1997)
M. R. K. Krishna Rao
Some Characteristics of Strong Innermost Normalization. AMAST (1996)
M. R. K. Krishna Rao
A Class of Prolog Programs Inferable from Positive Data. ALT (1996)
M. R. K. Krishna Rao
Relating Confluence, Innermost-Confluence and Outermost-Confluence Properties of Term Rewriting Systems. Acta Informatica 33 (6) (1996)
M. R. K. Krishna Rao
Completeness Results for Basic Narrowing in Non-Copying Implementations. JICSLP (1996)
M. R. K. Krishna Rao
Modularity of Termination in Term Graph Rewriting. RTA (1996)
M. R. K. Krishna Rao
Semi-Completeness of Hierarchical and Super-Hierarchical Combinations of Term Rewriting Systems. TAPSOFT (1995)
M. R. K. Krishna Rao
Incremental Learning of Logic Programs. ALT (1995)
M. R. K. Krishna Rao, R. K. Shyamasundar
Unification-Free Execution of Well-Moded and Well-Typed Prolog Programs SAS (1995)
M. R. K. Krishna Rao
Modular Proofs for Completeness of Hierarchical Term Rewriting Systems. Theor. Comput. Sci. 151 (2) (1995)
M. R. K. Krishna Rao
Graph Reducibility of Term Rewriting Systems. MFCS (1995)
M. R. K. Krishna Rao
Simple Termination of Hierarchical Combinations of Term Rewriting Systems. TACS (1994)
M. R. K. Krishna Rao, Paritosh K. Pandya, R. K. Shyamasundar
Verification Tools in the Development of Provably Correct Compilers. FME (1993)
M. R. K. Krishna Rao
Completeness of Hierarchical Combinations of term Rewriting Systems. FSTTCS (1993)
M. R. K. Krishna Rao, Deepak Kapur, R. K. Shyamasundar
Proving Termination of GHC Programs. ICLP (1993)
R. K. Shyamasundar, M. R. K. Krishna Rao, Deepak Kapur
Rewriting Concepts in the Study of Termination of Logic Programs. ALPUK (1992)
M. R. K. Krishna Rao, Deepak Kapur, R. K. Shyamasundar
A Transformational Methodology for Proving Termination of Logic Programs. CSL (1991)