The SCEAS System
| |||||||

## Search the dblp DataBase
Haim Gaifman:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Haim Gaifman, Harry G. Mairson, Yehoshua Sagiv, Moshe Y. Vardi
**Undecidable Optimization Problems for Database Logic Programs**[Citation Graph (26, 0)][DBLP] LICS, 1987, pp:106-115 [Conf] - Stavros S. Cosmadakis, Haim Gaifman, Paris C. Kanellakis, Moshe Y. Vardi
**Decidable Optimization Problems for Database Logic Programs (Preliminary Report)**[Citation Graph (20, 0)][DBLP] STOC, 1988, pp:477-490 [Conf] - Haim Gaifman, Harry G. Mairson, Yehoshua Sagiv, Moshe Y. Vardi
**Undecidable Optimization Problems for Database Logic Programs.**[Citation Graph (9, 0)][DBLP] J. ACM, 1993, v:40, n:3, pp:683-713 [Journal] - Haim Gaifman
**Semantics of Logic Programs.**[Citation Graph (0, 0)][DBLP] ICLP, 1990, pp:779-782 [Conf] - Haim Gaifman, Vaughan R. Pratt
**Partial Order Models of Concurrency and the Computation of Functions**[Citation Graph (0, 0)][DBLP] LICS, 1987, pp:72-85 [Conf] - Haim Gaifman, Ehud Y. Shapiro
**Proof Theory and Semantics of Logic Programs**[Citation Graph (0, 0)][DBLP] LICS, 1989, pp:50-62 [Conf] - Haim Gaifman, Michael J. Maher, Ehud Y. Shapiro
**Replay, Recovery, Replication, and Snapshots of Nondeterministic Concurrent Programs.**[Citation Graph (0, 0)][DBLP] PODC, 1991, pp:241-255 [Conf] - Haim Gaifman, Ehud Y. Shapiro
**Fully Abstract Compositional Semantics for Logic Programs.**[Citation Graph (0, 0)][DBLP] POPL, 1989, pp:134-142 [Conf] - Haim Gaifman
**Modeling concurrency by partial orders and nonlinear transition systems.**[Citation Graph (0, 0)][DBLP] REX Workshop, 1988, pp:467-488 [Conf] - Haim Gaifman, Michael J. Maher, Ehud Y. Shapiro
**Reactive Behaviour Semantics for Concurrent Constraint Logic Programs.**[Citation Graph (0, 0)][DBLP] NACLP, 1989, pp:553-569 [Conf] - Haim Gaifman
**Operational Pointer Semantics: Solution to Self-Referential Puzzles I.**[Citation Graph (0, 0)][DBLP] TARK, 1988, pp:43-59 [Conf] - Haim Gaifman
**A Theory of Higher Order Probabilities.**[Citation Graph (0, 0)][DBLP] TARK, 1986, pp:275-292 [Conf] - Haim Gaifman
**Self-Reference and the Acyclicity of Rational Choice.**[Citation Graph (0, 0)][DBLP] Ann. Pure Appl. Logic, 1999, v:96, n:1-3, pp:117-140 [Journal] - Haim Gaifman, Moshe Y. Vardi
**A simple proof that connectivity of finite graphs is not first-order definable.**[Citation Graph (0, 0)][DBLP] Bulletin of the EATCS, 1985, v:26, n:, pp:43-44 [Journal] - Haim Gaifman
**Dependency Systems and Phrase-Structure Systems**[Citation Graph (0, 0)][DBLP] Information and Control, 1965, v:8, n:3, pp:304-337 [Journal] - Haim Gaifman
**Naming and Diagonalization, from Cantor to Gödel to Kleene.**[Citation Graph (0, 0)][DBLP] Logic Journal of the IGPL, 2006, v:14, n:5, pp:709-728 [Journal] - Haim Gaifman, Azriel Levy, Gert H. Muller
**Meeting of the Association for Symbolic Logic: Jerusalem, Israel, 1975.**[Citation Graph (0, 0)][DBLP] J. Symb. Log., 1977, v:42, n:1, pp:140-142 [Journal] - Haim Gaifman, Marc Snir
**Probabilities Over Rich Languages, Testing and Randomness.**[Citation Graph (0, 0)][DBLP] J. Symb. Log., 1982, v:47, n:3, pp:495-548 [Journal] - Elias Dahlhaus, Haim Gaifman
**Concerning Two-Adjacent Context-Free Languages.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1985, v:41, n:, pp:169-184 [Journal]
Search in 0.184secs, Finished in 0.185secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |