|
Norihiro Kamide
Abstract:
We propose a proof-theoretical way of obtaining detailed and precise information on conceptual hierarchies. The notion of concept finding proof, which represents a hierarchy of concepts, is introduced based on a substructural logic with mingle and strong negation. Mingle, which is a structural inference rule, is used to represent a process for finding a more general (or specific) concept than some given concepts. Strong negation, which is a negation connective, is used to represent a concept inverse operator. The problem for constructing a concept finding proof is shown to be decidable in PTIME.1
1. This paper is an extended version of [1].
Keywords: concept finding proof, conceptual hierarchy, substructural logic, mingle, strong negation
Available Options:
|
