We investigate the applicability of classical resolution-based theorem proving methods for the Semantic Web. We consider several well-known search strategies, propose a general sch...
A general game player is a system that can play previously unknown games given nothing but their rules. A key to success in this endeavour is the ability to automatically gain know...
In many cases, a logic program can be divided into two parts, so that one of them, the \bottom" part, does not refer to the predicates de ned in the \top" part. The \bot...
Abstract. This is a short survey illustrating some of the essential aspects of the theory of canonical extensions. In addition some topological results about canonical extensions o...
The first extensive number-theoretical computation run on the world's first U.S. digital general-purpose electronic computer, the ENIAC, is reconstructed. The problem, computi...