# Sources and interpretation

This register records the selected versions underlying the curated model. Publication years are not claims of first invention. Most edges map conceptual relationships; only edges explicitly typed `documented` claim a cited reference or framework use. The public citations below remain curator records; research verification was not repeated for this derivative.

## 1. On the Mathematical Foundations of Theoretical Statistics (1922)

R. A. Fisher

Cited for statistical sufficiency; this date is not a claim that all forms of minimum sufficiency originated here.

Primary source: https://doi.org/10.1098/rsta.1922.0009

Stable ID: `fisher1922`

## 2. The Information Bottleneck Method (2000)

Naftali Tishby, Fernando C. Pereira, William Bialek

Allerton 1999; arXiv version submitted in 2000. The map uses the dated arXiv record.

Primary source: https://arxiv.org/abs/physics/0004057

Stable ID: `ib2000`

## 3. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints (1977)

Patrick Cousot, Radhia Cousot

Author-maintained overview and bibliography, including the 1977 POPL paper.

Primary source: https://www.di.ens.fr/~cousot/AI/

Stable ID: `ai1977`

## 4. Program Slicing (1981)

Mark Weiser

ICSE 1981 version; related work includes the 1979 dissertation and 1984 journal article.

Primary source: https://dl.acm.org/doi/10.5555/800078.802557

Stable ID: `slice1981`

## 5. Counterexample-Guided Abstraction Refinement (2000)

Edmund Clarke, Orna Grumberg, Somesh Jha, Yuan Lu, Helmut Veith

CAV 2000; refine abstractions after spurious counterexamples.

Primary source: https://doi.org/10.1007/10722167_15

Stable ID: `cegar2000`

## 6. Task-Driven Model Abstraction (1990)

Daniel S. Weld, Sanjaya Addanki

Dated February 21, 1990; source text and first page inspected.

Scope: Abstract; downward-solution and downward-failure properties

Primary source: https://www.qrg.northwestern.edu/papers/Files/qr-workshops/QP90/Weld_1990_Task-Driven_Model_Abstraction.pdf

Stable ID: `weld1990`

## 7. Composition Modeling of Physical Systems (1991)

Brian Falkenhainer, Ken Forbus

1991 technical report SSL-91-95. Related journal work: Compositional modeling: Finding the right model for the job (1991). Do not confuse the two titles.

Scope: §§1.3–1.4; modeling assumptions and query analysis

Primary source: https://www.qrg.northwestern.edu/papers/Files/QRG_Dist_Files/QRG_1991/1_38_Falkenhainer_1991_Composition_Modeling_Physical_Systems.pdf

Stable ID: `falk1991`

## 8. Automated Model Selection for Simulation (1993)

Yumi Iwasaki, Alon Y. Levy

QR93 workshop version; later publication versions exist. The stated adequacy and simplicity results have explicit framework assumptions.

Scope: Abstract; §4, properties of the algorithm

Primary source: https://www.qrg.northwestern.edu/papers/Files/qr-workshops/QR93/Iwasaki_1993_Automated_Model_Selection_Simulation.pdf

Stable ID: `iwasaki1993`

## 9. Query Inseparability for ALC Ontologies (2019)

Elena Botoeva, Carsten Lutz, Vladislav Ryzhikov, Frank Wolter, Michael Zakharyaschev

Indistinguishability under specified query languages; different fragments have different decidability/complexity results.

Primary source: https://arxiv.org/abs/1902.00014

Stable ID: `query2019`

## 10. Causal Consistency of Structural Equation Models (2017)

Paul K. Rubenstein, Sebastian Weichwald, Stephan Bongers, Joris M. Mooij, Dominik Janzing, Moritz Grosse-Wentrup, Bernhard Schölkopf

Exact transformations between structural equation models; agreement on specified interventions.

Primary source: https://arxiv.org/abs/1707.00819

Stable ID: `causal2017`

## 11. A Truth Maintenance System (1979)

Jon Doyle

Artificial Intelligence 12, 231–272. Tracks reasons for beliefs and revises dependent beliefs.

Primary source: https://doi.org/10.1016/0004-3702(79)90008-0

Stable ID: `doyle1979`

## 12. Problem Solving with the ATMS (1986)

Johan de Kleer

Assumption-based truth maintenance supports reasoning under alternative assumption environments.

Primary source: https://dekleer.org/Publications/Problem%20Solving%20with%20the%20ATMS.pdf

Stable ID: `atms1986`

## 13. Provenance Semirings (2007)

Todd J. Green, Grigoris Karvounarakis, Val Tannen

Algebraic provenance for annotated relations and positive query operations; not a universal measure of truth.

Primary source: https://doi.org/10.1145/1265530.1265535

Stable ID: `prov2007`

## 14. DBToaster: Higher-order Delta Processing for Dynamic, Frequently Fresh Views (2012)

Yanif Ahmad, Oliver Kennedy, Christoph Koch, Milos Nikolic

Incremental maintenance and optimizing compilation for changing database views; SQL/data semantics, not arbitrary epistemic validity.

Primary source: https://arxiv.org/abs/1207.0137

Stable ID: `ivm2012`

## 15. Formal Verification of a Realistic Compiler (2009)

Xavier Leroy

A semantic-preservation proof for the described CompCert compiler and formal source/target languages.

Primary source: https://xavierleroy.org/publi/compcert-CACM.pdf

Stable ID: `compcert2009`

## 16. A Declarative System for Optimizing AI Workloads (2024)

Chunwei Liu, Matthew Russo, Michael Cafarella, Lei Cao, Peter Baille Chen, Zui Chen, Michael Franklin, Tim Kraska, Samuel Madden, Gerardo Vitagliano

Palimpzest: declarative AI data processing with cost, time, and quality optimization; not a proof of arbitrary semantic faithfulness.

Primary source: https://arxiv.org/abs/2405.14696

Stable ID: `pal2024`
