Hybrid MKNF with Classical Negation in the Rule Component

• URL: http://arxiv.org/abs/2607.21202v1
• Date: Thu, 23 Jul 2026 11:20:15 GMT
• Title: Hybrid MKNF with Classical Negation in the Rule Component
• Abstract summary: Hybrid MKNF knowledge bases do not support classical negation in the rule component.<n>This limitation is particularly significant in safety-critical applications.<n>We introduce an extension of Hybrid MKNF that supports classical negation in the rule component.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• 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.

Related papers

• Are Language Models Efficient Reasoners? A Perspective from Logic Programming [109.47572890883248]
  Modern language models (LMs) exhibit strong deductive reasoning capabilities, yet standard evaluations emphasize correctness while overlooking a key aspect of human-like reasoning: efficiency.<n>We propose a framework for assessing LM reasoning efficiency through the lens of logic programming.
  arXiv  Detail & Related papers  (2025-10-29T15:30:31Z)
• A Reduction of Input/Output Logics to SAT [51.82266520875928]
  Deontic logics are formalisms for reasoning over norms, obligations, permissions and prohibitions.<n>In this paper, an automation approach for I/O logics is presented that makes use of suitable reductions to propositional satisfiability problems.
  arXiv  Detail & Related papers  (2025-08-22T09:22:26Z)
• On the Logical Content of Logic Programs [0.0]
  This paper introduces a novel perspective on Logic programming (LP) by defining a support'' relation that explicates what a program knows''<n>Results are formalized using the idea of base-extension semantics within proof-theoretic semantics.<n>Our approach offers new insights into the logical foundations of LP and has potential applications in knowledge representation, automated reasoning, and formal verification.
  arXiv  Detail & Related papers  (2025-03-07T11:58:08Z)
• A Note on an Inferentialist Approach to Resource Semantics [48.65926948745294]
  'Inferentialism' is the view that meaning is given in terms of inferential behaviour. This paper shows how 'inferentialism' enables a versatile and expressive framework for resource semantics.
  arXiv  Detail & Related papers  (2024-05-10T14:13:21Z)
• ChatRule: Mining Logical Rules with Large Language Models for Knowledge Graph Reasoning [107.61997887260056]
  We propose a novel framework, ChatRule, unleashing the power of large language models for mining logical rules over knowledge graphs. Specifically, the framework is initiated with an LLM-based rule generator, leveraging both the semantic and structural information of KGs. To refine the generated rules, a rule ranking module estimates the rule quality by incorporating facts from existing KGs.
  arXiv  Detail & Related papers  (2023-09-04T11:38:02Z)
• Eliminating Unintended Stable Fixpoints for Hybrid Reasoning Systems [5.208405959764274]
  We introduce a methodology resembling AFT that can utilize priorly computed upper bounds to more precisely capture semantics. We demonstrate our framework's applicability to hybrid MKNF (minimal knowledge and negation as failure) knowledge bases by extending the state-of-the-art approximator.
  arXiv  Detail & Related papers  (2023-07-21T01:08:15Z)
• Non-Deterministic Approximation Fixpoint Theory and Its Application in Disjunctive Logic Programming [11.215352918313577]
  Approximation fixpoint theory is a framework for studying the semantics of nonmonotonic logics. We extend AFT to dealing with non-deterministic constructs that allow to handle indefinite information. The applicability and usefulness of this generalization is illustrated in the context of disjunctive logic programming.
  arXiv  Detail & Related papers  (2022-11-30T18:58:32Z)
• Not another Negation Benchmark: The NaN-NLI Test Suite for Sub-clausal Negation [59.307534363825816]
  Negation is poorly captured by current language models, although the extent of this problem is not widely understood. We introduce a natural language inference (NLI) test suite to enable probing the capabilities of NLP methods.
  arXiv  Detail & Related papers  (2022-10-06T23:39:01Z)
• A Fixpoint Characterization of Three-Valued Disjunctive Hybrid MKNF Knowledge Bases [0.0]
  We present a fixpoint construction that leverages head-cuts using an operator that iteratively captures three-valued models of disjunctive hybrid MKNF knowledge bases with disjunctive rules. This work also captures partial stable models of disjunctive logic programs since a program can be expressed as a disjunctive hybrid MKNF knowledge base with an empty answer.
  arXiv  Detail & Related papers  (2022-08-05T10:47:07Z)
• LNN-EL: A Neuro-Symbolic Approach to Short-text Entity Linking [62.634516517844496]
  We propose LNN-EL, a neuro-symbolic approach that combines the advantages of using interpretable rules with the performance of neural learning. Even though constrained to using rules, LNN-EL performs competitively against SotA black-box neural approaches.
  arXiv  Detail & Related papers  (2021-06-17T20:22:45Z)
• Unfounded Sets for Disjunctive Hybrid MKNF Knowledge Bases [0.0]
  Disjunctive hybrid MKNF knowledge bases and ASP extend in some cases without increasing the complexity of reasoning tasks. The only known method of solving disjunctive hybrid MKNF knowledge bases is based on guess-and-verify. We formalize a notion of unfounded sets for these knowledge bases, identify lower bounds, and demonstrate how we might integrate these into a solver.
  arXiv  Detail & Related papers  (2021-02-25T20:44:42Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.