A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
Anne Condon, Joan Feigenbaum, Carsten Lund, Peter ...
— In this paper, a new method is proposed to evaluate the reliability of stochastic mechanical systems. This technique is based on the combination of the probabilistic transforma...
Human interpersonal face-to-face interaction can be considered in terms of successions of speech acts. These are utterances which contain an intention, and the act of creating an ...
There are numerous cases where a reasoning agent needs to reason about the behavior of an opponent agent. In this paper, we propose a hybrid probabilistic logic language within wh...
Gerardo I. Simari, Amy Sliva, Dana S. Nau, V. S. S...
We derive an easy-to-compute approximate bound for the range of step-sizes for which the constant-modulus algorithm (CMA) will remain stable if initialized close to a minimum of t...