Bibliographic record
Abstract
Abstract. A fragment of type theory with OWL class constructions for types and binary properties is used to formalize SysML Structural Block Diagram models. A structural SysML block diagram model is a model that does not have behavior in the sense that values of properties do not change. A structural model may include properties, variables and operations. Individuals are a special case of operators with no arguments. Type theory is chosen as the target semantic formalism as SysML constructions correspond closely to type theory term constructions. The type theoretic semantics defined in terms of introduction and elimination fits well with the informal SysML semantics. An abstract version of a structural model, called an Abstract Block Diagram (ABD), is introduced. An ABD is a theory closed under specific type, property, and operator constructions with additional axioms. The ABD corresponding to the SysML model contains axioms in the form of equations for types, and properties, and operators. This formalism captures the syntactic constructons of the SysML models and the type theoretic semantics appears to be in accord with the informal semantics, as documented in the OMG specification. ABD theory gives an explicit mechanism for introducing instances for types defined by property restrictions. This construction is useful for parts decompositions. ABD theory constructions have a limited kind of property union used to construct parts decompositions. An ABD determines a Description Logic (DL) closed under union, intersection, and existential type constructions and property constructions restricted by typing relations. The ABD constructions are useful in identifying potential extensions for SysML and may be useful, as well, for adding operator terms to Description Logic.
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.002 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.002 |
| Bibliometrics | 0.002 | 0.003 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.005 | 0.007 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.001 | 0.003 |
| Insufficient payload (model declined to judge) | 0.014 | 0.004 |
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".