Publications

Entries sorted by: 1. Author,Editor - 2. by Group - 1. by Names of First Author,Editor

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

#		Year		Title	Type
1	Kasper
3	Kazakov
2	Kazakov, de Nivelle
1	Klotzki
1	Korovin
4	Korovin, Voronkov
4	Kraan, Basin, Bundy
1	Krischer, Bockmayr
14	Krishna Rao
		2000		Some characteristics of strong innermost normalization In: Theoretical Computer Science [239], 141-164	Journal Article
		2000		Some classes of prolog programs inferable from positive data In: Theoretical Computer Science [241], 211-223	Journal Article
		1998		Modular Aspects of term graph rewriting In: Theoretical Computer Science [208], 59-86	Journal Article
		1997		A framework for incremental learning of logic programs In: Theoretical Computer Science [185], 191-213	Journal Article
		1996		A class of Prolog programs inferable from positive data In: Algorithmic Learning Theory, 272-284	Proceedings Article
		1996		Completeness results for basic narrowing in non-copying implementations In: Logic Programming, 393-407	Proceedings Article
		1996		Learning Prolog programs from examples In: Knowledge Based Computer Systems, 19-30	Proceedings Article
		1996		Modularity of termination in term graph rewriting In: Rewriting Techniques and Applications, 230-244	Proceedings Article
		1996		Relating confluence, innermost-confluence and outermost-confluence properties of term rewriting systems In: Acta Informatica [33], 595-606	Journal Article
		1996		Some characteristics of strong innermost normalization In: Algebraic Methodology and Software Technology, 5th International Conference, AMAST '96, 406-420	Proceedings Article
		1995		Graph reducibility of term rewriting systems In: Proceedings of Mathematical Foundations of Computer Science, 371-381	Proceedings Article
		1995		Incremental Learning of Logic Programs In: Proceedings of International Workshop on Algorithmic Learning Theory, 95-109	Proceedings Article
		1995		Modular Proofs for Completeness of hierarchical term rewriting systems In: Theoretical Computer Science [151], 487-512	Journal Article
		1995		Semi-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	Proceedings Article
1	Krishna Rao, Shyamasundar
1	Kupferschmid, Hoffmann, Dierks, Behrmann
2	Lang, van der Torre, Weydert
2	Lee
2	Lee, Plaisted
1	Letz, Stenz
1	Letz, Weidenbach

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