Ontology Based Data Access with Referring Expressions for Logics with the Tree Model Property
Bibliographic record
Abstract
Certain answer computation for a query has usually entailed the search for constants as substitutions for the query variables that make the query logically entailed by a knowledge base. Such constants are simple examples of referring expressions , that is, syntactic artifacts that identity objects in an underlying domain. In earlier work, we have begun to explore how more general referring expressions can be used to allow more descriptive and useful object identification. In this paper, we present a novel approach to ontology based data access in this more general setting for logics with the so-called tree model property. The proposed solution remedies a problem with our earlier work in certain answer computation with referring expressions in which a process of extending the knowledge base with new constants and assertions that depended on a particular query is required. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.004 | 0.012 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.003 |
| Bibliometrics | 0.002 | 0.004 |
| Science and technology studies | 0.002 | 0.004 |
| Scholarly communication | 0.006 | 0.017 |
| Open science | 0.002 | 0.006 |
| Research integrity | 0.002 | 0.004 |
| Insufficient payload (model declined to judge) | 0.007 | 0.002 |
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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".