MétaCan
Menu
Back to cohort
Record W2551756190 · doi:10.5220/0006052100310042

Verifying and Mapping the Mereotopology of Upper-Level Ontologies

2016· article· en· W2551756190 on OpenAlexaff
Lydia Silva Muñoz, Michael Grüninger

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicSemantic Web and Ontologies
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsMereologyOntologyComputer scienceAxiomProcess ontologyDescription logicRepresentation (politics)Domain (mathematical analysis)Relation (database)Upper ontologyTheoretical computer scienceModular designOntology componentsOntology-based data integrationOntology engineeringOntology alignmentFormal ontologyInformation retrievalData miningSemantic WebMathematicsProgramming language

Abstract

fetched live from OpenAlex

Upper-level ontologies provide an account of the most basic, domain-independent, existing entities, such as time, space, objects, and processes. Ontology verification is the process by which a theory is checked to rule out unintended models, and possibly characterize missing intended ones. In this paper, we verify the core characterization of mereotopology of the Suggested Upper Merged Ontology (SUMO), and the mereology of the Descriptive Ontology for Linguistic and Cognitive Engineering (DOLCE), while relating their axiomatizations via ontology mapping. As a result, we propose the correction and addition of some axioms to the analyzed theories which eliminate unintended models and characterize missing ones. In addition, we show by formal means which is the relation existing between the axiomatization of mereology in both upper-level ontologies, and make available a modular representation in first-order logic of the SUMO characterization of mereotopology.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.006
metaresearch head score (Gemma)0.020
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.006
Threshold uncertainty score0.031

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0060.020
Meta-epidemiology (narrow)0.0000.001
Meta-epidemiology (broad)0.0010.002
Bibliometrics0.0020.001
Science and technology studies0.0020.006
Scholarly communication0.0040.008
Open science0.0020.005
Research integrity0.0010.003
Insufficient payload (model declined to judge)0.0020.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.097
GPT teacher head0.266
Teacher spread0.169 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations4
Published2016
Admission routes1
Has abstractyes

Explore more

Same topicSemantic Web and OntologiesFrench-language works237,207