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

	Year		Title	BibTeX cite key
Fehrer
Fehrer, Hustadt, Jaeger, Nonnengart, Ohlbach, Schmidt, Weidenbach, Weydert
Fermüller, Leitsch, Hustadt, Tammet
Firozabadhi, van der Torre
Fischmann
Frank, Basin
Frank, Basin, Bundy
Freiheit, Luuk, Münch, Sijanski, Zangl
Freiheit, Münch, Schöttle, Sijanski, Zangl
Freiheit, Zangl
Friedrich
Furbach, Ganzinger, Hasegawa, Kapur (ed.)
Gabbay, Kruse, Nonnengart, Ohlbach (ed.)
Gabbay, Ohlbach
Gabbay, Ohlbach (ed.)
Gaede
Gaillourdet, Hillenbrand, Löchner, Spies
Gamkrelidze
Ganzinger
	2002		Shostak Light In: Automated deduction, CADE-18 : 18th International Conference on Automated Deduction, 332-346	Ganzinger-02-cade
	2001		Bottom-Up Deduction with Deletion and Priorities In: Programs as Data Objects (PADO-01) : Second Symposium PADO 2001, 276-277	Ganzinger2003a
	2001		Efficient deductive methods for program analysis In: ACM SIGPLAN Notices [36], 102-103	Ganzinger:2001:EDM
	2001		Relating Semantic and Proof-Theoretic Concepts for Polynomial Time Decidability of Uniform Word Problems In: Proceedings of the 16th IEEE Symposium on Logic in Computer Science (LICS-01), 81-90	Ganzinger-01-lics
	1998		Preface In: Theoretical Computer Science [208], 1	Ganzinger98
	1996		Saturation-based theorem proving (abstract) In: Automata, Languages and Programming: International Colloquium (ICALP-23), 1-3	Ganzinger96-ICALP-23
	1994		The Saturate System	Ganzinger-94-sat
	1991		A completion procedure for conditional equations In: Journal of Symbolic Computation [11], 51-81	Ganzinger-91-jsc
	1991		Order-Sorted Completion: The Many-Sorted Way In: Theoretical Computer Science [89], 3-32	Ganzinger-91-tcs
Ganzinger (ed.)
Ganzinger, de Nivelle

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