#### Filter Results:

- Full text PDF available (5)

#### Publication Year

1972

2012

- This year (0)
- Last 5 years (0)
- Last 10 years (2)

#### Supplemental Content

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Leslie Lamport, Robert E. Shostak, Marshall C. Pease
- ACM Trans. Program. Lang. Syst.
- 1982

Reliable computer systems must handle malfunctioning components that give conflicting information to different parts of the system. This situation can be expressed abstractly in terms of a group of… (More)

- Marshall C. Pease, Robert E. Shostak, Leslie Lamport
- J. ACM
- 1980

The problem addressed here concerns a set of isolated processors, some unknown subset of which may be faulty, that communicate only by means of two-party messages. Each nonfaulty processor has a… (More)

- Robert E. Shostak
- J. ACM
- 1984

A method is given for deciding formulas in combinations of unquatified first-order theories. Rather than coupling separate decision procedures for the contributing theories, it makes use of a single,… (More)

- Robert E. Shostak
- J. ACM
- 1981

V R Pratt has shown that the real and integer feastbdlty of sets of linear mequallUes of the form x _< y + c can be decided quickly by examining the loops m certain graphs Pratt's method is… (More)

- Robert E. Shostak
- J. ACM
- 1979

A practical procedure is presented for an extension of quantifier-free Presburger arithmetic that permits arbitrary unmterpreted predicate and function symbols This theory includes many of the… (More)

- Robert E. Shostak
- J. ACM
- 1977

This article presents an improved version of Bledsoe's SUP-INF method for proving theorems in a subclass of Presburger ari thmetic The improved method is able to determine mvahdRy as well as vahdlty,… (More)

- Robert E. Shostak
- IJCAI
- 1977

A simple technique for reasoning about equalities that is fast and complete for ground formulas with function symbols and equality is presented. A proof of correctness is given as well.

- Brenda S. Baker, Robert E. Shostak
- Discrete Mathematics
- 1972

Answer. Let f(n) be the minimum number of calls needed for n people. It is easily shown that f(1) = 0, f(2) = 1, f(3) = 3 and f(4) = 4. For n > 4, 2n− 4 calls are sufficient according to the… (More)

- Robert E. Shostak
- Artif. Intell.
- 1976

A graph-theoretic characterization of truth-functional consistency is introduced, providing a clear perspective on some resolution-based for deciding formulas in propositional and first-order logic.… (More)

- W. W. Bledsoe, Kenneth Kunen, Robert E. Shostak
- Artif. Intell.
- 1985

A hybrid tea rose variety having a vigorous, upright plant producing straight stems; pointed yellow buds; glossy, dark green foliage; absence of prickles on lower edges of rachis.