Weighted Description Logic for Classification Problems
MetadataShow full item record
We summarise the definitions and some technical aspects of a familiy of description logics that introduce concept constructors (so-called tooth-operators) which, under various constraints, accumulate weights of concepts. We demonstrate how these operators can be fruitfully and elegantly applied to a number of cognitively motivated classification problems which are difficult to handle with the standard expressive means of description logics.
Showing items related by title, author, creator and subject.
Galliani P; Kutz O; Porello D; Righetti G; Troquard N (Easychair, 2019)We study a family of operators (called ‘Tooth’ operators) that combine Description Logic concepts via weighted sums. These operators are intended to capture the notion of instances satisfying “enough” of the concept ...
Borgwardt, S; Penaloza, R (Institute of Mathematics and Computer Science of Nyíregyháza College, 2011)Weighted automata can be seen as a natural generalization of finite state automata to more complex algebraic structures. The standard reasoning tasks for unweighted automata can also be generalized to the weighted setting. ...
Righetti G; Porello D; Kutz O; Troquard N; Masolo C (CEUR-WS, 2019)Many aspects of how humans form and combine concepts are notoriously difficult to capture formally. In this paper, we focus on the representation of three particular such aspects, namely overextension, underextension, and ...