Computational Logic for Biomedicine and Neurosciences
Bibliographic record
Abstract
A computational logic is a logic that enables proofs on the computer, that is, mechanized reasoning: one of the foundations of artificial intelligence. This chapter advocates the use of computational logic as a unified and safe approach to both specifying and analyzing biological systems. It presents two applications areas of the approach: biomedicine and neuroscience. The chapter presents the use of logical frameworks, and more precisely linear logic, to model and analyzes biological systems in the biomedicine area. It then focuses on metastatic breast cancer, which is representative of the approach. The chapter also uses Coq to prove four important properties of neurons and archetypes. It provides a discrete version of the leaky integrate and fire model. The chapter presents the Coq model for neural networks, which includes definitions of neurons, operations on them and the combination of neurons into archetypes.
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.003 | 0.005 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.003 | 0.003 |
| Science and technology studies | 0.002 | 0.009 |
| Scholarly communication | 0.007 | 0.010 |
| Open science | 0.001 | 0.003 |
| Research integrity | 0.002 | 0.007 |
| Insufficient payload (model declined to judge) | 0.017 | 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".