Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Gabbay's separation theorem

Known as: Separation theorem 
In mathematical logic and computer science, Gabbay's separation theorem, named after Dov Gabbay, states that any arbitrary temporal logic formula can… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2019
Review
2019
Thanks to the recent advances in processing speed, data acquisition and storage, machine learning (ML) is penetrating every facet… Expand
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2007
Highly Cited
2007
The problem of reliably reconstructing a function of sources over a multiple-access channel (MAC) is considered. It is shown that… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2005
Highly Cited
2005
The capacity of a particular large Gaussian relay network is determined in the limit as the number of relays tends to infinity… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
In this paper, stochastic optimal controllers of networked control systems whose network-induced delay is longer than a sampling… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Sensors acquire data, and communicate this to an interested party. The arising coding problem is often split into two parts… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1995
Highly Cited
1995
The single-user separation theorem of joint source-channel coding has been proved previously for wide classes of sources and… Expand
  • figure 1
Is this relevant?
Highly Cited
1988
Highly Cited
1988
A computer-controlled portfolio selection task with three risky assets and either with or without a riskless asset was devised to… Expand
Is this relevant?
Highly Cited
1987
Highly Cited
1987
A theory of “discrete convex analysis” is developed for integer-valued functions defined on integer lattice points. The theory… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1983
Highly Cited
1983
In this paper we study two classes of sets, strongly and weakly convex sets. For each class we derive a series of properties… Expand
Is this relevant?
Highly Cited
1965
Highly Cited
1965
A fuzzy set is a class of objects with a continuum of grades of membership. Such a set is characterized by a membership… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?