Haim Gaifman

	2011
21		Haim Gaifman: Erratum to: Vagueness, tolerance and contextual logic. Synthese 179(3): 501-502 (2011)
	2010
20		Haim Gaifman: Vagueness, tolerance and contextual logic. Synthese 174(1): 5-46 (2010)
	2006
19		Haim Gaifman: Naming and Diagonalization, from Cantor to Gödel to Kleene. Logic Journal of the IGPL 14(5): 709-728 (2006)
	1999
18		Haim Gaifman: Self-Reference and the Acyclicity of Rational Choice. Ann. Pure Appl. Logic 96(1-3): 117-140 (1999)
	1993
17		Haim Gaifman, Harry G. Mairson, Yehoshua Sagiv, Moshe Y. Vardi: Undecidable Optimization Problems for Database Logic Programs. J. ACM 40(3): 683-713 (1993)
	1991
16		Haim Gaifman, Michael J. Maher, Ehud Y. Shapiro: Replay, Recovery, Replication, and Snapshots of Nondeterministic Concurrent Programs. PODC 1991: 241-255
	1990
15		Haim Gaifman: Semantics of Logic Programs. ICLP 1990: 779-782
	1989
14		Haim Gaifman, Ehud Y. Shapiro: Proof Theory and Semantics of Logic Programs LICS 1989: 50-62
13		Haim Gaifman, Michael J. Maher, Ehud Y. Shapiro: Reactive Behaviour Semantics for Concurrent Constraint Logic Programs. NACLP 1989: 553-569
12		Haim Gaifman, Ehud Y. Shapiro: Fully Abstract Compositional Semantics for Logic Programs. POPL 1989: 134-142
	1988
11		Haim Gaifman: Modeling concurrency by partial orders and nonlinear transition systems. REX Workshop 1988: 467-488
10		Stavros S. Cosmadakis, Haim Gaifman, Paris C. Kanellakis, Moshe Y. Vardi: Decidable Optimization Problems for Database Logic Programs (Preliminary Report) STOC 1988: 477-490
9		Haim Gaifman: Operational Pointer Semantics: Solution to Self-Referential Puzzles I. TARK 1988: 43-59
	1987
8		Haim Gaifman, Harry G. Mairson, Yehoshua Sagiv, Moshe Y. Vardi: Undecidable Optimization Problems for Database Logic Programs LICS 1987: 106-115
7		Haim Gaifman, Vaughan R. Pratt: Partial Order Models of Concurrency and the Computation of Functions LICS 1987: 72-85
	1986
6		Haim Gaifman: A Theory of Higher Order Probabilities. TARK 1986: 275-292
	1985
5		Haim Gaifman, Moshe Y. Vardi: A simple proof that connectivity of finite graphs is not first-order definable. Bulletin of the EATCS 26: 43-44 (1985)
4		Elias Dahlhaus, Haim Gaifman: Concerning Two-Adjacent Context-Free Languages. Theor. Comput. Sci. 41: 169-184 (1985)
	1982
3		Haim Gaifman, Marc Snir: Probabilities Over Rich Languages, Testing and Randomness. J. Symb. Log. 47(3): 495-548 (1982)
	1977
2		Haim Gaifman, Azriel Levy, Gert H. Muller: Meeting of the Association for Symbolic Logic: Jerusalem, Israel, 1975. J. Symb. Log. 42(1): 140-142 (1977)
	1965
1		Haim Gaifman: Dependency Systems and Phrase-Structure Systems Information and Control 8(3): 304-337 (1965)

Coauthor Index

1	Stavros S. Cosmadakis	[10]
2	Elias Dahlhaus	[4]
3	Paris C. Kanellakis	[10]
4	Azriel Levy	[2]
5	Michael J. Maher	[13] [16]
6	Harry G. Mairson	[8] [17]
7	Gert H. Muller	[2]
8	Vaughan R. Pratt	[7]
9	Yehoshua Sagiv	[8] [17]
10	Ehud Y. Shapiro	[12] [13] [14] [16]
11	Marc Snir	[3]
12	Moshe Y. Vardi	[5] [8] [10] [17]

Colors in the list of coauthors

Last update Wed May 30 22:34:44 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page