441 search results - page 45 / 89 » A Method for Proving Observational Equivalence |
ICMAS
2000
13 years 10 months ago
2000
In this paper we focus on the problem of how infinite belief hierarchies can be represented and reasoned with in a computationally tractable way. When modeling nested beliefs one ...
DATE
1999
IEEE
14 years 1 months ago
1999
IEEE
If real number calculations are implemented as circuits, only a limited preciseness can be obtained. Hence, formal verification can not be used to prove the equivalence between th...
IJAR
2008
13 years 9 months ago
2008
Credal networks are models that extend Bayesian nets to deal with imprecision in probability, and can actually be regarded as sets of Bayesian nets. Credal nets appear to be power...
JFP
2000
13 years 8 months ago
2000
In this paper we present two type inference systems for detecting useless-code in higher-order typed functional programs. Type inference can be performed in an efficient and compl...
WDAG
2010
Springer
13 years 7 months ago
2010
Springer
Leader election and arbitrary pattern formation are fundammental tasks for a set of autonomous mobile robots. The former consists in distinguishing a unique robot, called the lead...