aiqbench analysis
This research extends Hybrid MKNF knowledge bases by formally integrating classical negation into rule components via well-founded semantics, directly addressing gaps in representing explicit negative information for safety-critical AI systems. By bridging Description Logics with Logic Programming to handle the absence of evidence as distinct from evidence of absence, this work advances foundational logic frameworks essential for robust symbolic reasoning and verification tasks.
Hybrid MKNF with Classical Negation in the Rule Component
arXiv:2607.21202v1 Announce Type: cross Abstract: Hybrid MKNF knowledge bases under the well-founded semantics integrate Description Logics with Logic Programming. However, they do not support classical negation in the rule component, limiting their ability to represent explicit negative knowledge. This limitation is particularly significant in safety-critical applications, where reasoning often requires explicit negative information rather than interpreting the absence of information as evidence of absence. To address this issue, we introduce an extension of Hybrid MKNF that supports classical negation in the rule component. We formally define the syntax and semantics of the extended language and present a general procedure for computing its well-founded model.
Abstract:Hybrid MKNF knowledge bases under the well-founded semantics integrate Description Logics with Logic Programming. However, they do not support classical negation in the rule component, limiting their ability to represent explicit negative knowledge. This limitation is particularly significant in safety-critical applications, where reasoning often requires explicit negative information rather than interpreting the absence of information as evidence of absence. To address this issue, we introduce an extension of Hybrid MKNF that supports classical negation in the rule component. We formally define the syntax and semantics of the extended language and present a general procedure for computing its well-founded model.
In Proceedings ICLP 2026, arXiv:2607.17707
Logic in Computer Science (cs.LO); Artificial Intelligence (cs.AI); Symbolic Computation (cs.SC)
arXiv:2607.21202 [cs.LO]
(or arXiv:2607.21202v1 [cs.LO] for this version)
https://doi.org/10.48550/arXiv.2607.21202 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
EPTCS 450, 2026, pp. 374-402
https://doi.org/10.4204/EPTCS.450.28 Focus to learn more DOI(s) linking to related resources
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 221 words
Related coverage

The Entangled Dimensions of Decision Theory
LessWrong · Jul 30, 2026

Quantum Machine-Learning Design Targets Training And Scaling Barriers
The Quantum Insider · Jul 28, 2026

Oxford Team Confirms Quantum Theory’s Universal Nature
Quantum Zeitgeist · Aug 22, 2026

Lattice-Based Cryptography Explained
Quantum Zeitgeist · Aug 15, 2026