The paper critiques the Semantic Web’s failure to deliver machine‑interpretable knowledge, arguing that its standards omitted key elements—conditions for claims, operational grounding, and coverage scope—making truth, applicability, and boundary recognition impossible. It proposes a new framework, Semantic Knowledge Technologies, with a seven‑layer architecture and five measurable tests of understanding (check, connect, derive, act, delimit). The authors introduce concepts such as Large Knowledge Models, SLKMs, and a falsifiable definition of Semantic Artificial General Intelligence, presenting a research agenda to address these gaps.
By Achille Zappa
arXiv:2608.23370v1 Announce Type: new
Abstract: Large Language Models (LLMs) recognise patterns but do not natively track the path of exclusions that a coherent discourse demands. When an input rests...
By Aldo Gangemi, Emanuele Bottazzi
arXiv:2606. 28639v1 Announce Type: cross Abstract: This article establishes the foundational mathematical limits of Artificial General Intelligence (AGI) safety, proving that the core barrier is not the impossibility of an aligned state, but its structural unverifiability.
By Jose Pascual Gumbau Mezquita
The paper argues that while machine-readable models like SysML v2 enable AI participation in systems engineering, the data architecture surrounding these models must also be robust. It introduces the concept of epistemic adequacy, split into read‑side adequacy (ensuring derivations, status, and provenance are answerable) and write‑side admissibility (filtering AI contributions before they enter the record). The authors illustrate their ideas using the public Apollo 11 SysML v2 reconstruction and propose a Governed‑Query Architecture Framework to enforce these principles.
By Jason Gower, Michael J. de C. Henshaw, Siyuan Ji
arXiv:2606. 28639v2 Announce Type: replace-cross Abstract: We establish the mathematical limits of AGI safety in two forms: verifying a fixed system, and verifying that a certified safety property persists once the system self-modifies.
By Jose Pascual Gumbau Mezquita
arXiv:2607. 12650v1 Announce Type: cross Abstract: Tool access alone does not make LLM empirical reasoning governable: accepted outputs need not descend from attested evidence, and accepted deductions need not hold up under formal scrutiny.
By Junyu Ren
arXiv:2606. 18557v1 Announce Type: new Abstract: A rule-based logic solver resolves every instance in our benchmark in under 50 microseconds with 100% accuracy; the best frontier language model reaches 65% at best and drops to 23.
By Patrick Cooper, Alvaro Velasquez
arXiv:2303. 04203v4 Announce Type: replace Abstract: The theory of computation was built to answer Turing's question: what is effectively calculable by an unbounded, immortal, disembodied agent following rules?
By Xin Li
The paper introduces a hierarchy of four increasingly strict faithfulness criteria—discrimination, logical admissibility, monotonic logical faithfulness, and probabilistic logical faithfulness—for evaluating knowledge base completion models, particularly when the target is a description logic knowledge base. It demonstrates that ranking accuracy alone does not guarantee logical faithfulness and shows that current embedding models fail to satisfy any of the criteria across the hierarchy. The authors provide a formal grounding for the strongest criterion using relative model counts and evaluate several models on εL ontologies, revealing gaps between performance metrics and logical correctness.
By Olga Mashkova, Robert Hoehndorf
arXiv:2607. 15629v1 Announce Type: cross Abstract: Topos causal models recast causal inference inside a topos: a causal world is a presheaf, an intervention is a characteristic map into the subobject classifier, and reasoning is carried out in the intuitionistic internal language.
By Karen Sargsyan
arXiv:2607. 23386v1 Announce Type: new Abstract: We document a failure class in frontier large language models -- exception chain collapse -- observed in eligibility evaluation under nested conditional rules of the form "A is required UNLESS B applies, UNLESS C overrides B".
By Paul Simpson, John Kozak, Lisa Doake
arXiv:2608.28997v1 Announce Type: new
Abstract: In May 2026 an OpenAI model produced a counterexample to the Erd\H{o}s unit distance conjecture. Five mathematicians published a human-verified version...
By Maher Kallel, Mohamed El Louadi