MPI-INF Logo
Publications

Server    halma.mpi-inf.mpg.de

Publications

Entries sorted by: 1. Author,Editor - 2. by Group - 4. with BibTeX cite keys

Login to this database


 

Previous Page | Next Page | Expand All | Collapse All | Search (Full Text)


Show entries starting with: A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
YearTitleBibTeX cite key
Show details for KasperKasper
Show details for KazakovKazakov
Show details for Kazakov, de NivelleKazakov, de Nivelle
Show details for KlotzkiKlotzki
Show details for KorovinKorovin
Show details for Korovin, VoronkovKorovin, Voronkov
Show details for Kraan, Basin, BundyKraan, Basin, Bundy
Show details for Krischer, BockmayrKrischer, Bockmayr
Hide details for Krishna RaoKrishna Rao
2000Some characteristics of strong innermost normalization
In: Theoretical Computer Science [239], 141-164
Rao:2000:SCS
2000Some classes of prolog programs inferable from positive data
In: Theoretical Computer Science [241], 211-223
r-cppipd-00
1998Modular Aspects of term graph rewriting
In: Theoretical Computer Science [208], 59-86
KrishnaRao98a
1997A framework for incremental learning of logic programs
In: Theoretical Computer Science [185], 191-213
KrishnaRao97a
1996A class of Prolog programs inferable from positive data
In: Algorithmic Learning Theory, 272-284
KrishnaRao96a
1996Completeness results for basic narrowing in non-copying implementations
In: Logic Programming, 393-407
KrishnaRao96b
1996Learning Prolog programs from examples
In: Knowledge Based Computer Systems, 19-30
KrishnaRao96c
1996Modularity of termination in term graph rewriting
In: Rewriting Techniques and Applications, 230-244
KrishnaRao96d
1996Relating confluence, innermost-confluence and outermost-confluence properties of term rewriting systems
In: Acta Informatica [33], 595-606
KrishnaRaoActaInformatica
1996Some characteristics of strong innermost normalization
In: Algebraic Methodology and Software Technology, 5th International Conference, AMAST '96, 406-420
KrishnaRao96e
1995Graph reducibility of term rewriting systems
In: Proceedings of Mathematical Foundations of Computer Science, 371-381
KrishnaRao95
1995Incremental Learning of Logic Programs
In: Proceedings of International Workshop on Algorithmic Learning Theory, 95-109
KrishnaRaoALT
1995Modular Proofs for Completeness of hierarchical term rewriting systems
In: Theoretical Computer Science [151], 487-512
KrishnaRaoTCS
1995Semi-completeness of Hierarchical and Super-hierarchical Combinations of Term Rewriting Systems
In: Proceedings of the 6th Joint Conference on Theory and Practice of Software Development, 379-393
KrishnaRaoTAPSOFT
Show details for Krishna Rao, ShyamasundarKrishna Rao, Shyamasundar
Show details for Kupferschmid, Hoffmann, Dierks, BehrmannKupferschmid, Hoffmann, Dierks, Behrmann
Show details for Lang, van der Torre, WeydertLang, van der Torre, Weydert
Show details for LeeLee
Show details for Lee, PlaistedLee, Plaisted
Show details for Letz, StenzLetz, Stenz
Show details for Letz, WeidenbachLetz, Weidenbach

Previous Page | Next Page | Expand All | Collapse All | Search (Full Text)