A logic for conceptual hierarchies

Authors:
Norihiro Kamide
Affiliations:
Waseda Institute for Advanced Study, Waseda University, Tokyo, Japan
Venue:
SBIA'10 Proceedings of the 20th Brazilian conference on Advances in artificial intelligence
Year:
2010

Citing 5
Cited 0

Logic of Information Structures

Logic of Information Structures
Formal Concept Analysis: Mathematical Foundations

Formal Concept Analysis: Mathematical Foundations
Substructural Logics with Mingle

Journal of Logic, Language and Information
The description logic handbook: theory, implementation, and applications

The description logic handbook: theory, implementation, and applications
Linear Logics with Communication-merge

Journal of Logic and Computation

Quantified Score

Hi-index	0.00

Visualization

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.