| 2006 |
|---|
| 19 | EE | 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 | EE | 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) |
