The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

M. R. K. Krishna Rao: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  38. Learnability of Term Rewrite Systems from Positive Examples. [Citation Graph (, )][DBLP]


  39. Infusing Critical Thinking Skill Classification into a Software Engineering Course. [Citation Graph (, )][DBLP]


  40. Learning Hereditary and Reductive Prolog Programs from Entailment. [Citation Graph (, )][DBLP]


Search in 0.372secs, Finished in 0.374secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002