One of the open problems listed in Rivest and Schapire, 1989] is whether and how that the copies of L in their algorithm can be combined into one for better performance. This pape...
Polynomial time complexity is the usual ‘threshold’ for distinguishing the tractable from the intractable and it may seem reasonable to adopt this notion of tractability in th...
This paper explores different techniques for explanation within the framework of the situation calculus, using the so-called stolen car problem as its main example. Two approaches...
We introduce and use a new methodology for the study of logics for action and change. The methodology allows one to define a taxonomy of reasoning problems, based in particular on...
Since its inception, arti cial intelligence has relied upon a theoretical foundation centred around perfect rationality as the desired property of intelligent systems. We argue, a...
Stuart J. Russell, Devika Subramanian, Ronald Parr
agent-oriented system. We show the complexity to be linear time for one of these logics and polynomial time for another, thus providing encouraging results with respect to the prac...
We study multiple predicate learning in an empirical setting. Problems with existing inductive logic programming approaches in this setting are sketched and an empirical ILP syste...