The Symbolic Probabilistic Inference (SPI) Algorithm [D'Ambrosio, 19891 provides an efficient framework for resolving general queries on a belief network. It applies the conc...
Ross D. Shachter, Bruce D'Ambrosio, Brendan Del Fa...
In this paper we present a purely semantic view on non-monotonic reasoning. We follow the direction pointed in [16] and claim that any non-monotonic logic can be viewed as a resul...
Programs such as Bacon, Abacus, Coper, Kepler and others are designed to find functional relationships of scientific significance in numerical data without relying on the deep dom...
To design a task-independent dialogue system, we present a task-oriented dialogue analysis in terms of finding the referents of definite descriptions and we show how this analysis...
A case-based reasoner can frequently benefit from using pieces of multiple previous cases in the course of solving a single problem. In our model, case pieces, called snippets, ar...
We describe a system called Tileworld, which consists of a simulated robot agent and a simulated environment which is both dynamic and unpredictable. Both the agent and the enviro...
This work pertains to the Knuth-Bendix (KB) algorithm which tries to find a complete set of reductions from a given set of equations. In the KB algorithm a term ordering is employ...