Concept Combination in Weighted Logic

In Proceedings of the Joint Ontology Workshops 2021 Episode {VII:} The Bolzano Summer of Knowledge co-located with the 12th International Conference on Formal Ontology in Information Systems {(FOIS} 2021), and the 12th Internati (2021)
  Copy   BIBTEX

Abstract

We present an algorithm for concept combination inspired and informed by the research in cognitive and experimental psychology. Dealing with concept combination requires, from a symbolic AI perspective, to cope with competitive needs: the need for compositionality and the need to account for typicality effects. Building on our previous work on weighted logic, the proposed algorithm can be seen as a step towards the management of both these needs. More precisely, following a proposal of Hampton [1], it combines two weighted Description Logic formulas, each defining a concept, using the following general strategy. First it selects all the features needed for the combination, based on the logical distinc- tion between necessary and impossible features. Second, it determines the threshold and assigns new weights to the features of the combined concept trying to preserve the relevance and the necessity of the features. We illustrate how the algorithm works exploiting some paradigmatic examples discussed in the cognitive literature.

Author's Profile

Daniele Porello
Università degli Studi di Genova

Analytics

Added to PP
2022-04-03

Downloads
47 (#69,939)

6 months
26 (#43,927)

Historical graph of downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.
How can I increase my downloads?