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 Iturrioz, Sofronie-StokkermansIturrioz, Sofronie-Stokkermans
Show details for JacobsJacobs
Show details for Jacobs, Sofronie-StokkermansJacobs, Sofronie-Stokkermans
Show details for Jacobs, WaldmannJacobs, Waldmann
Show details for Jacquemard, Meyer, WeidenbachJacquemard, Meyer, Weidenbach
Show details for JaegerJaeger
Show details for Jaeger, Mannila, WeydertJaeger, Mannila, Weydert
Show details for Jaulin, Ratschan, HardouinJaulin, Ratschan, Hardouin
Show details for Jensen, PodelskiJensen, Podelski
Show details for Jensen, Podelski (ed.)Jensen, Podelski (ed.)
Show details for Johann, Socher-AmbrosiusJohann, Socher-Ambrosius
Show details for JungJung
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

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