Algorithms can be instructed to use an abstraction scheme to reason about an element (see AbstractionScheme.
In an abstraction, the values of an element are reduced to a smaller, abstract set of values.
The general class of Figaro algorithms.
An anytime algorithm is able to improve its estimated answers over time.
Anytime algorithms that compute most likely values of elements.
Anytime algorithms that compute probability of evidence.
Anytime algorithms that compute conditional probability of query elements.
General Response (String)
A message to the handler to handle the given service.
Algorithms that compute the most likely values of elements.
Messages to or from the actor.
A one-time algorithm runs in a single step to produce its answers.
One-time algorithms that compute the most likely values of elements.
One-time algorithms that compute probability of evidence.
One-time algorithms that compute conditional probability of query elements.
Trait of algorithms that learn parameters
Trait of functions that map concrete points to abstract points.
A predicate defined on an element.
Algorithms that compute probability of evidence.
Algorithms that compute conditional probabilities of queries.
Class of responses to services.
Class of services implemented by the anytime algorithm.
Object for computing the range of values of elements in a universe.
Trait of elements for which range of values can be computed.
Constructors for Abstraction