Bibliographic record
Abstract
The ability to change one's beliefs consistently is essential for sound reasoning in a world where the new information one acquires may invalidate or augment one's current beliefs.Belief revision is the process wherein an agent modifies its beliefs to incorporate the new information received, and knowledge base merging the process wherein the agent is given two or more knowledge bases to merge.We present a binary decision diagram (BDD)based implementation of Delgrande and Schaub's consistency-based belief change framework.Our system focuses on knowledge base merging with the possible incorporation of integrity constraints, using a BDD solver for consistency checking.We show that the result of merging finite knowledge bases can be represented as a finite formula, and that merging can be streamlined algorithmically by restricting attention to a subset of the vocabulary of the propositional formulas involved.Experimental results and comparisons with related systems are also given.
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.007 | 0.027 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.002 |
| Bibliometrics | 0.003 | 0.003 |
| Science and technology studies | 0.003 | 0.002 |
| Scholarly communication | 0.005 | 0.007 |
| Open science | 0.004 | 0.006 |
| Research integrity | 0.002 | 0.002 |
| Insufficient payload (model declined to judge) | 0.007 | 0.003 |
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".