| 2009 | ||
|---|---|---|
| c31 | Shahid Hussain, M. R. K. Krishna Rao: Learning Hereditary and Reductive Prolog Programs from Entailment. ICIC (2) 2009: 546-555 | |
| 2008 | ||
| j10 | M. R. K. Krishna Rao: Some classes of term rewriting systems inferable from positive data. Theor. Comput. Sci. 397(1-3): 129-149 (2008) | |
| 2007 | ||
| c30 | Muhammad Shafique, Kanaan A. Faisal, M. R. K. Krishna Rao: Infusing Critical Thinking Skill Classification into a Software Engineering Course. FECS 2007: 285-289 | |
| 2006 | ||
| c29 | M. R. K. Krishna Rao: Learnability of Term Rewrite Systems from Positive Examples. CATS 2006: 133-137 | |
| c28 | 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: 53-59 | |
| c27 | Kanaan A. Faisal, Ahmed Bagais, M. R. K. Krishna Rao: Finding Reasons and Conclusion in a Basic Computer Science Course. FECS 2006: 60-66 | |
| c26 | Muhammad Shafique, M. R. K. Krishna Rao: Infusing Parts-whole Relationship Critical Thinking Skill into Basic Computer Science Education. FECS 2006: 287-292 | |
| c25 | M. R. K. Krishna Rao: Storytelling and puzzles in a software engineering course. SIGCSE 2006: 418-422 | |
| 2005 | ||
| c24 | M. R. K. Krishna Rao: A Class of Prolog Programs with Non-linear Outputs Inferable from Positive Data. ALT 2005: 312-326 | |
| c23 | M. R. K. Krishna Rao: Infusing critical thinking skills into content of AI course. ITiCSE 2005: 173-177 | |
| c22 | 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: 256-260 | |
| 2004 | ||
| c21 | M. R. K. Krishna Rao: Inductive Inference of Term Rewriting Systems from Positive Data. ALT 2004: 69-82 | |
| c20 | M. R. K. Krishna Rao: Learnability of Simply-Moded Logic Programs from Entailment. ASIAN 2004: 128-141 | |
| c19 | ||
| 2003 | ||
| c18 | ||
| 2001 | ||
| j9 | M. R. K. Krishna Rao, Abdul Sattar: Polynomial-time learnability of logic programs with local variables from entailment. Theor. Comput. Sci. 268(2): 179-198 (2001) | |
| 2000 | ||
| j8 | M. R. K. Krishna Rao: Some characteristics of strong innermost normalization. Theor. Comput. Sci. 239(1): 141-164 (2000) | |
| j7 | M. R. K. Krishna Rao: Some classes of prolog programs inferable from positive data. Theor. Comput. Sci. 241(1-2): 211-234 (2000) | |
| 1999 | ||
| c17 | M. R. K. Krishna Rao, Abdul Sattar: Learning Logic Programs with Local Variables from Positive Examples. Australian Joint Conference on Artificial Intelligence 1999: 469-471 | |
| 1998 | ||
| j6 | M. R. K. Krishna Rao, Deepak Kapur, R. K. Shyamasundar: Transformational Methodology for Proving Termination of Logic Programs. J. Log. Program. 34(1): 1-41 (1998) | |
| j5 | M. R. K. Krishna Rao: Modular Aspects of Term Graph Rewriting. Theor. Comput. Sci. 208(1-2): 59-86 (1998) | |
| c16 | M. R. K. Krishna Rao, Abdul Sattar: Learning from Entailment of Logic Programs with Local Variables. ALT 1998: 143-157 | |
| c15 | M. R. K. Krishna Rao, Abdul Sattar: Learning Linearly-Moded Programs from Entailment. PRICAI 1998: 482-493 | |
| 1997 | ||
| j4 | M. R. K. Krishna Rao, Deepak Kapur, R. K. Shyamasundar: Proving Termination of GHC Programs. New Generation Comput. 15(3): 293-338 (1997) | |
| j3 | M. R. K. Krishna Rao: A Framework for Incremental Learning of Logic Programs. Theor. Comput. Sci. 185(1): 193-213 (1997) | |
| 1996 | ||
| j2 | M. R. K. Krishna Rao: Relating Confluence, Innermost-Confluence and Outermost-Confluence Properties of Term Rewriting Systems. Acta Inf. 33(6): 595-606 (1996) | |
| c14 | ||
| c13 | ||
| c12 | M. R. K. Krishna Rao: Completeness Results for Basic Narrowing in Non-Copying Implementations. JICSLP 1996: 393-407 | |
| c11 | ||
| 1995 | ||
| j1 | M. R. K. Krishna Rao: Modular Proofs for Completeness of Hierarchical Term Rewriting Systems. Theor. Comput. Sci. 151(2): 487-512 (1995) | |
| c10 | ||
| c9 | ||
| c8 | M. R. K. Krishna Rao, R. K. Shyamasundar: Unification-Free Execution of Well-Moded and Well-Typed Prolog Programs. SAS 1995: 243-260 | |
| c7 | M. R. K. Krishna Rao: Semi-Completeness of Hierarchical and Super-Hierarchical Combinations of Term Rewriting Systems. TAPSOFT 1995: 379-393 | |
| 1994 | ||
| c6 | M. R. K. Krishna Rao: Simple Termination of Hierarchical Combinations of Term Rewriting Systems. TACS 1994: 203-223 | |
| 1993 | ||
| c5 | M. R. K. Krishna Rao, Paritosh K. Pandya, R. K. Shyamasundar: Verification Tools in the Development of Provably Correct Compilers. FME 1993: 442-461 | |
| c4 | M. R. K. Krishna Rao: Completeness of Hierarchical Combinations of term Rewriting Systems. FSTTCS 1993: 125-138 | |
| c3 | M. R. K. Krishna Rao, Deepak Kapur, R. K. Shyamasundar: Proving Termination of GHC Programs. ICLP 1993: 720-736 | |
| 1992 | ||
| c2 | R. K. Shyamasundar, M. R. K. Krishna Rao, Deepak Kapur: Rewriting Concepts in the Study of Termination of Logic Programs. ALPUK 1992: 3-20 | |
| 1991 | ||
| c1 | M. R. K. Krishna Rao, Deepak Kapur, R. K. Shyamasundar: A Transformational Methodology for Proving Termination of Logic Programs. CSL 1991: 213-226 | |
Colors in the list of coauthors
Last update Thu May 23 06:40:22 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page