MPI-INF Logo
Publications

Server    halma.mpi-inf.mpg.de

Publications

Entries sorted by: 1. Author,Editor - 2. by Group - 3. by Names Including [Non Members]

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
#YearTitleType
1
Show details for Kasper [-]Kasper [-]
2
Show details for Kazakov [-]Kazakov [-]
1
Show details for Kazakov [Alferes, Leite]Kazakov [Alferes, Leite]
1
Show details for Kazakov, de Nivelle [Basin, Rusinowitch]Kazakov, de Nivelle [Basin, Rusinowitch]
1
Show details for Kazakov, de Nivelle [Calvanese, De Giacomo, Franconi]Kazakov, de Nivelle [Calvanese, De Giacomo, Franconi]
1
Show details for Klotzki [-]Klotzki [-]
1
Show details for Korovin [-]Korovin [-]
1
Show details for Korovin, Voronkov [Voronkov, Baader]Korovin, Voronkov [Voronkov, Baader]
1
Show details for Korovin, Voronkov [Voronkov, Kolaitis, Voronkov, Kolaitis]Korovin, Voronkov [Voronkov, Kolaitis, Voronkov, Kolaitis]
2
Show details for Korovin, Voronkov [Voronkov]Korovin, Voronkov [Voronkov]
2
Show details for Kraan, Basin, Bundy [-]Kraan, Basin, Bundy [-]
2
Show details for Kraan, Basin, Bundy [Kraan, Bundy]Kraan, Basin, Bundy [Kraan, Bundy]
1
Show details for Krischer, Bockmayr [-]Krischer, Bockmayr [-]
12
Hide details for Krishna Rao [-]Krishna Rao [-]
2000Some characteristics of strong innermost normalization
In: Theoretical Computer Science [239], 141-164		Journal Article
2000Some classes of prolog programs inferable from positive data
In: Theoretical Computer Science [241], 211-223		Journal Article
1998Modular Aspects of term graph rewriting
In: Theoretical Computer Science [208], 59-86		Journal Article
1997A framework for incremental learning of logic programs
In: Theoretical Computer Science [185], 191-213		Journal Article
1996A class of Prolog programs inferable from positive data
In: Algorithmic Learning Theory, 272-284		Proceedings Article
1996Completeness results for basic narrowing in non-copying implementations
In: Logic Programming, 393-407		Proceedings Article
1996Learning Prolog programs from examples
In: Knowledge Based Computer Systems, 19-30		Proceedings Article
1996Modularity of termination in term graph rewriting
In: Rewriting Techniques and Applications, 230-244		Proceedings Article
1996Relating confluence, innermost-confluence and outermost-confluence properties of term rewriting systems
In: Acta Informatica [33], 595-606		Journal Article
1996Some characteristics of strong innermost normalization
In: Algebraic Methodology and Software Technology, 5th International Conference, AMAST '96, 406-420		Proceedings Article
1995Incremental Learning of Logic Programs
In: Proceedings of International Workshop on Algorithmic Learning Theory, 95-109		Proceedings Article
1995Modular Proofs for Completeness of hierarchical term rewriting systems
In: Theoretical Computer Science [151], 487-512		Journal Article
1
Show details for Krishna Rao [Mosses, Nielsen, Schwartzbach]Krishna Rao [Mosses, Nielsen, Schwartzbach]
1
Show details for Krishna Rao [Wiedermann, Hájek]Krishna Rao [Wiedermann, Hájek]
1
Show details for Krishna Rao, Shyamasundar [Shyamasundar]Krishna Rao, Shyamasundar [Shyamasundar]
1
Show details for Kupferschmid, Hoffmann, Dierks, Behrmann [Kupferschmid, Dierks, Behrmann, Valmari]Kupferschmid, Hoffmann, Dierks, Behrmann [Kupferschmid, Dierks, Behrmann, Valmari]

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