We show that the first-order theory of structural subtyping of non-recursive types is decidable. Let be a language consisting of function symbols (representing type constructors)...
Starting from a logic which speci es how to make deductions from a set of sentences (a ` at theory'), a way to generalise this toa partiallyordered bag ofsentences (a `struct...
Abstract In this paper we describe a form of communication that could be used for lifelong learning as contribution to cultural computing. We call it Kansei Mediation. It is a mult...
We propose to extend the ontology of logical AI to include approximate objects, approximate predicates and approximate theories. Besides the ontology we treat the relations among ...
Abstract. This paper presents the extension of an existing mimimally supervised rule acquisition method for relation extraction by coreference resolution (CR). To this end, a novel...