| 2008 |
|---|
| 40 | EE | 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 |
|---|
| 39 | | 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 |
|---|
| 38 | EE | M. R. K. Krishna Rao:
Learnability of Term Rewrite Systems from Positive Examples.
CATS 2006: 133-137 |
| 37 | | Muhammad Shafique,
M. R. K. Krishna Rao:
Infusing Parts-whole Relationship Critical Thinking Skill into Basic Computer Science Education.
FECS 2006: 287-292 |
| 36 | | 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 |
| 35 | | Kanaan A. Faisal,
Ahmed Bagais,
M. R. K. Krishna Rao:
Finding Reasons and Conclusion in a Basic Computer Science Course.
FECS 2006: 60-66 |
| 34 | EE | M. R. K. Krishna Rao:
Storytelling and puzzles in a software engineering course.
SIGCSE 2006: 418-422 |
| 2005 |
|---|
| 33 | EE | M. R. K. Krishna Rao:
A Class of Prolog Programs with Non-linear Outputs Inferable from Positive Data.
ALT 2005: 312-326 |
| 32 | EE | M. R. K. Krishna Rao:
Infusing critical thinking skills into content of AI course.
ITiCSE 2005: 173-177 |
| 31 | EE | 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 |
|---|
| 30 | EE | M. R. K. Krishna Rao:
Inductive Inference of Term Rewriting Systems from Positive Data.
ALT 2004: 69-82 |
| 29 | EE | M. R. K. Krishna Rao:
Learnability of Simply-Moded Logic Programs from Entailment.
ASIAN 2004: 128-141 |
| 28 | EE | M. R. K. Krishna Rao:
Input-Termination of Logic Programs.
LOPSTR 2004: 215-230 |
| 2003 |
|---|
| 27 | EE | M. R. K. Krishna Rao:
Polynomial-Time Learnability from Entailment.
ICLP 2003: 489-491 |
| 2001 |
|---|
| 26 | EE | 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 |
|---|
| 25 | EE | M. R. K. Krishna Rao:
Some characteristics of strong innermost normalization.
Theor. Comput. Sci. 239(1): 141-164 (2000) |
| 24 | EE | M. R. K. Krishna Rao:
Some classes of prolog programs inferable from positive data.
Theor. Comput. Sci. 241(1-2): 211-234 (2000) |
| 1999 |
|---|
| 23 | | 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 |
|---|
| 22 | EE | M. R. K. Krishna Rao,
Abdul Sattar:
Learning from Entailment of Logic Programs with Local Variables.
ALT 1998: 143-157 |
| 21 | | M. R. K. Krishna Rao,
Abdul Sattar:
Learning Linearly-Moded Programs from Entailment.
PRICAI 1998: 482-493 |
| 20 | | 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) |
| 19 | EE | M. R. K. Krishna Rao:
Modular Aspects of Term Graph Rewriting.
Theor. Comput. Sci. 208(1-2): 59-86 (1998) |
| 1997 |
|---|
| 18 | | M. R. K. Krishna Rao,
Deepak Kapur,
R. K. Shyamasundar:
Proving Termination of GHC Programs.
New Generation Comput. 15(3): 293-338 (1997) |
| 17 | | M. R. K. Krishna Rao:
A Framework for Incremental Learning of Logic Programs.
Theor. Comput. Sci. 185(1): 193-213 (1997) |
| 1996 |
|---|
| 16 | | M. R. K. Krishna Rao:
A Class of Prolog Programs Inferable from Positive Data.
ALT 1996: 272-284 |
| 15 | | M. R. K. Krishna Rao:
Some Characteristics of Strong Innermost Normalization.
AMAST 1996: 406-420 |
| 14 | | M. R. K. Krishna Rao:
Completeness Results for Basic Narrowing in Non-Copying Implementations.
JICSLP 1996: 393-407 |
| 13 | | M. R. K. Krishna Rao:
Modularity of Termination in Term Graph Rewriting.
RTA 1996: 230-244 |
| 12 | | M. R. K. Krishna Rao:
Relating Confluence, Innermost-Confluence and Outermost-Confluence Properties of Term Rewriting Systems.
Acta Inf. 33(6): 595-606 (1996) |
| 1995 |
|---|
| 11 | | M. R. K. Krishna Rao:
Incremental Learning of Logic Programs.
ALT 1995: 95-109 |
| 10 | | M. R. K. Krishna Rao:
Graph Reducibility of Term Rewriting Systems.
MFCS 1995: 371-381 |
| 9 | | M. R. K. Krishna Rao,
R. K. Shyamasundar:
Unification-Free Execution of Well-Moded and Well-Typed Prolog Programs
SAS 1995: 243-260 |
| 8 | | M. R. K. Krishna Rao:
Semi-Completeness of Hierarchical and Super-Hierarchical Combinations of Term Rewriting Systems.
TAPSOFT 1995: 379-393 |
| 7 | EE | M. R. K. Krishna Rao:
Modular Proofs for Completeness of Hierarchical Term Rewriting Systems.
Theor. Comput. Sci. 151(2): 487-512 (1995) |
| 1994 |
|---|
| 6 | | M. R. K. Krishna Rao:
Simple Termination of Hierarchical Combinations of Term Rewriting Systems.
TACS 1994: 203-223 |
| 1993 |
|---|
| 5 | | M. R. K. Krishna Rao,
Paritosh K. Pandya,
R. K. Shyamasundar:
Verification Tools in the Development of Provably Correct Compilers.
FME 1993: 442-461 |
| 4 | | M. R. K. Krishna Rao:
Completeness of Hierarchical Combinations of term Rewriting Systems.
FSTTCS 1993: 125-138 |
| 3 | | M. R. K. Krishna Rao,
Deepak Kapur,
R. K. Shyamasundar:
Proving Termination of GHC Programs.
ICLP 1993: 720-736 |
| 1992 |
|---|
| 2 | | 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 |
|---|
| 1 | | M. R. K. Krishna Rao,
Deepak Kapur,
R. K. Shyamasundar:
A Transformational Methodology for Proving Termination of Logic Programs.
CSL 1991: 213-226 |
