Incomplete types for logic databases

Abstract We propose to extend Horn-clause terms by invisibly associating them with incomplete types, that is, convenient representations of taxonomic information. We formally define typed logic databases and show their uses to reduce the length of the proofs needed to deduce some kinds of facts, to provide intensional replies, to perform quick semantic agreement verifications on natural language queries, and to achieve partial execution of some queries.