Midwinters, end games, and body parts: a classification of part-whole relations
International Journal of Human-Computer Studies - Special issue: the role of formal ontology in the information technology
Part-whole relations in object-centered systems: an overview
Data & Knowledge Engineering - Special issue on modeling parts and wholes
Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The Description Logic Handbook
The Description Logic Handbook
Representing and reasoning over a taxonomy of part-whole relations
Applied Ontology - Ontological Foundations of Conceptual Modelling
A Theorem Prover with Dependent Types for Reasoning about Actions
Proceedings of the 2008 conference on STAIRS 2008: Proceedings of the Fourth Starting AI Researchers' Symposium
Computational ontologies of parthood, componenthood, and containment
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Using a dependently-typed language for expressing ontologies
KSEM'11 Proceedings of the 5th international conference on Knowledge Science, Engineering and Management
Formal foundations for situation awareness based on dependent type theory
Information Fusion
A type-theoretical approach for ontologies: The case of roles
Applied Ontology
| Hi-index | 0.00 |
Generally, part-whole relations are modeled using fragments of first-order logic(FOL) and difficulties arise when meta-reasoning is done over their properties, leading to reason outside the logic. Alternatively, classical languages for ontological reasoning such as Description Logics + Logic Programming lack of expressive formal foundations resulting in ambiguous interpretations of relations. Moreover, they show some difficulties to prove that a given meta property is logically correct. In order to address these problems, we suggest a formal framework using a dependent (higher-order) type theory such as those used in program checking and theorem provers (e.g., Coq). All properties of part-whole relations are formalized through abstract constructs called parameterized specifications (p-specifications). We detail their content and explain how they are suitable to build an ontology of formal properties that can be further used for reasoning about higher-order properties.