The following pages link to M. R. K. Krishna Rao (Q924173):
Displaying 19 items.
- Some classes of term rewriting systems inferable from positive data (Q924174) (← links)
- Modular aspects of term graph rewriting (Q1275016) (← links)
- Modular proofs for completeness of hierarchical term rewriting systems (Q1350349) (← links)
- A framework for incremental learning of logic programs (Q1390950) (← links)
- Some characteristics of strong innermost normalization (Q1575274) (← links)
- Some classes of Prolog programs inferable from positive data (Q1575466) (← links)
- Relating confluence, innermost-confluence and outermost-confluence properties of term rewriting system (Q1901710) (← links)
- A class of prolog programs inferable from positive data (Q3556998) (← links)
- Graph reducibility of term rewriting systems (Q3569026) (← links)
- Transformational methodology for proving termination of logic programs (Q3841095) (← links)
- (Q4202945) (← links)
- (Q4268467) (← links)
- (Q4490728) (← links)
- Modularity of termination in term graph rewriting (Q5055863) (← links)
- Semi-completeness of hierarchical and super-hierarchical combinations of term rewriting systems (Q5096744) (← links)
- Algorithmic Learning Theory (Q5395047) (← links)
- Input-Termination of Logic Programs (Q5458804) (← links)
- Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making (Q5463967) (← links)
- Algorithmic Learning Theory (Q5464524) (← links)
