140 search results - page 26 / 28 » Interpretation and Transformation for Abstracting Conversati... |
SLP
1993
14 years 11 months ago
1993
In this paper we describe a method of programspecialisation and give an extended example of its application to specialisation of a refutation proof procedure for rst order logic. ...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. Weighted logic programming, a generalization of bottom-up logic programming, is a successful framework for specifying dynamic programming algorithms. In this setting, pro...
KES
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. A mobile robot that interacts with its environment needs a machineunderstandable representation of objects and their usages. We present an ontology of objects, with gener...
ECSQARU
2009
Springer
15 years 2 months ago
2009
Springer
Abstract. Even though in Artificial Intelligence, a set of classical logical formulae is often called a belief base, reasoning about beliefs requires more than the language of cla...
STOC
1993
ACM
15 years 1 months ago
1993
ACM
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...