M. R. K. Krishna Rao

42 papers A 1B 13C 1Journal 10Unranked 17

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