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].
Publisher
Fuji Technology Press Ltd.
Subject
Artificial Intelligence,Computer Vision and Pattern Recognition,Human-Computer Interaction
Reference16 articles.
1. N. Kamide, “A logic for conceptual hierarchies,” Proc. of the 20th Brazilian Symposium on Artificial Intelligence (SBIA 2010), Lecture Notes in Artificial Intelligence, Vol.6404, pp. 303-312, 2010.
2. B. Ganter and R. Wille, “Formal concept analysis: Mathematical foundations,” Springer, 1999.
3. F. Baader, D. Calvanese, D. McGuinness, D. Nardi, and P. F. Patel-Schneider (Eds.), “The description logic handbook: Theory, implementation and applications,” Cambridge University Press, 2003.
4. A. R. Anderson and N. D. Belnap, Jr., “Entailment: The logic of relevance and necessity,” Vol.1, Princeton University Press, 1975.
5. N. Kamide, “Substructural logic with mingle,” J. of Logic, Language and Information, Vol.11, No.2, pp. 227-249, 2002.