SEQUEL is a new-generation functional programming language, which allows the specification of types in a notation based on the sequent calculus. The sequent calculus notation suff...
objects, like elements of (abstract) data types in ordinary programming languages In the theory of abstract data types most often one only considers algebraic structures where all ...
The problem of representing and reasoning about two notions of time that are relevant in the context of knowledge bases is addressed. These are called historical time and belief t...
The output of handwritten word recognizers (HWR) tends to be very noisy due to various factors. In order to compensate for this behaviour, several choices of the HWR must be initi...
: We present a set of axioms that justify the use of belief functions to quantify the beliefs held by an agent Y at time t and based on Y's evidential corpus. It is essentiall...
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...