M. R. K. Krishna Rao

Proceedings of the Emerging Intelligent Computing Technology and Applications. With Aspects of Artificial Intelligence, 2009

2008

Some classes of term rewriting systems inferable from positive data.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

2007

Infusing Critical Thinking Skill Classification into a Software Engineering Course.

[BibT_eX]

Muhammad Shafique

Kanaan A. Faisal

Proceedings of the 2007 International Conference on Frontiers in Education: Computer Science & Computer Engineering, 2007

2006

Storytelling and puzzles in a software engineering course.

[BibT_eX]

[DOI]

Proceedings of the 37th SIGCSE Technical Symposium on Computer Science Education, 2006

Infusing Parts-whole Relationship Critical Thinking Skill into Basic Computer Science Education.

[BibT_eX]

Muhammad Shafique

Proceedings of the 2006 International Conference on Frontiers in Education: Computer Science & Computer Engineering, 2006

Infusing Critical Thinking Skill Compare and Contrast into Content of Data Structures Course.

[BibT_eX]

Proceedings of the 2006 International Conference on Frontiers in Education: Computer Science & Computer Engineering, 2006

Finding Reasons and Conclusion in a Basic Computer Science Course.

[BibT_eX]

Kanaan A. Faisal

Ahmed Bagais

Proceedings of the 2006 International Conference on Frontiers in Education: Computer Science & Computer Engineering, 2006

Learnability of Term Rewrite Systems from Positive Examples.

[BibT_eX]

[DOI]

Proceedings of the Theory of Computing 2006, 2006

2005

Principles of curriculum design and revision: a case study in implementing computing curricula CC2001.

[BibT_eX]

[DOI]

Proceedings of the 10th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 2005

Infusing critical thinking skills into content of AI course.

[BibT_eX]

[DOI]

Proceedings of the 10th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 2005

A Class of Prolog Programs with Non-linear Outputs Inferable from Positive Data.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 16th International Conference, 2005

Learning Recursive Prolog Programs with Local Variables from Examples.

[BibT_eX]

[DOI]

Proceedings of the Workshop on Approaches and Applications of Inductive Programming, 2005

2004

Input-Termination of Logic Programs.

[BibT_eX]

[DOI]

Proceedings of the Logic Based Program Synthesis and Transformation, 2004

Learnability of Simply-Moded Logic Programs from Entailment.

[BibT_eX]

[DOI]

Proceedings of the Advances in Computer Science, 2004

Inductive Inference of Term Rewriting Systems from Positive Data.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 15th International Conference, 2004

2003

Polynomial-Time Learnability from Entailment.

[BibT_eX]

[DOI]

Proceedings of the Logic Programming, 19th International Conference, 2003

2001

Polynomial-time learnability of logic programs with local variables from entailment.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

2000

Some classes of prolog programs inferable from positive data.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

Some characteristics of strong innermost normalization.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

1999

Learning Logic Programs with Local Variables from Positive Examples.

[BibT_eX]

[DOI]

Proceedings of the Advanced Topics in Artificial Intelligence, 1999

1998

Modular Aspects of Term Graph Rewriting.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1998

Transformational Methodology for Proving Termination of Logic Programs.

[BibT_eX]

[DOI]

Deepak Kapur

J. Log. Program., 1998

Learning Linearly-Moded Programs from Entailment.

[BibT_eX]

[DOI]

Proceedings of the PRICAI'98, 1998

Learning from Entailment of Logic Programs with Local Variables.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 9th International Conference, 1998

1997

A Framework for Incremental Learning of Logic Programs.

[BibT_eX]

Theor. Comput. Sci., 1997

Proving Termination of GHC Programs.

[BibT_eX]

[DOI]

Deepak Kapur

New Gener. Comput., 1997

1996

Relating Confluence, Innermost-Confluence and Outermost-Confluence Properties of Term Rewriting Systems.

[BibT_eX]

[DOI]

Acta Informatica, 1996

Modularity of Termination in Term Graph Rewriting.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 7th International Conference, 1996

Completeness Results for Basic Narrowing in Non-Copying Implementations.

[BibT_eX]

[DOI]

Proceedings of the Logic Programming, 1996

A Class of Prolog Programs Inferable from Positive Data.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 7th International Workshop, 1996

1995

Modular Proofs for Completeness of Hierarchical Term Rewriting Systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1995

Semi-Completeness of Hierarchical and Super-Hierarchical Combinations of Term Rewriting Systems.

[BibT_eX]

[DOI]

Proceedings of the TAPSOFT'95: Theory and Practice of Software Development, 1995

Unification-Free Execution of Well-Moded and Well-Typed Prolog Programs

[BibT_eX]

[DOI]

Proceedings of the Static Analysis, 1995

Graph Reducibility of Term Rewriting Systems.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1995, 1995

Incremental Learning of Logic Programs.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 6th International Conference, 1995

1994

Simple Termination of Hierarchical Combinations of Term Rewriting Systems.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Aspects of Computer Software, 1994

1993

Completeness of Hierarchical Combinations of term Rewriting Systems.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1993

Verification Tools in the Development of Provably Correct Compilers.

[BibT_eX]

[DOI]

Paritosh K. Pandya

Proceedings of the FME '93: Industrial-Strength Formal Methods, 1993

1992

Rewriting Concepts in the Study of Termination of Logic Programs.

[BibT_eX]

[DOI]