Recently, the logics of minimal knowledge and negation as failure MKNF [12] was used to introduce hybrid MKNF knowledge bases [14], a powerful formalism for combining open and clos...
In this paper we show that a large class of cut-elimination methods can be analyzed by clause terms representing sets of characteristic clauses extractable from the original proof...
— Possibilistic logic is essentially a formalism for handling qualitative uncertainty with an inference machinery that remains close to the one of classical logic. It is capable ...
Establishing a clean relationship between a robot’s spatial model and natural language components is a non-trivial task, but is key to designing verbally controlled, navigating s...
Robert J. Ross, Hui Shi, Tillman Vierhuff, Bernd K...
There is a manifold of meanings we could associate with the term \evolution" in the database arena. This paper tries to categorize some of these into a unique framework, showi...