A Fixpoint Characterization of Three-Valued Disjunctive Hybrid MKNF Knowledge Bases

• URL: http://arxiv.org/abs/2208.03087v1
• Date: Fri, 5 Aug 2022 10:47:07 GMT
• Title: A Fixpoint Characterization of Three-Valued Disjunctive Hybrid MKNF Knowledge Bases
• Authors: Spencer Killen (University of Alberta), Jia-Huai You (University of Alberta)
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The logic of hybrid MKNF (minimal knowledge and negation as failure) is a powerful knowledge representation language that elegantly pairs ASP (answer set programming) with ontologies. Disjunctive rules are a desirable extension to normal rule-based reasoning and typically semantic frameworks designed for normal knowledge bases need substantial restructuring to support disjunctive rules. Alternatively, one may lift characterizations of normal rules to support disjunctive rules by inducing a collection of normal knowledge bases, each with the same body and a single atom in its head. In this work, we refer to a set of such normal knowledge bases as a head-cut of a disjunctive knowledge base. The question arises as to whether the semantics of disjunctive hybrid MKNF knowledge bases can be characterized using fixpoint constructions with head-cuts. Earlier, we have shown that head-cuts can be paired with fixpoint operators to capture the two-valued MKNF models of disjunctive hybrid MKNF knowledge bases. Three-valued semantics extends two-valued semantics with the ability to express partial information. In this work, we present a fixpoint construction that leverages head-cuts using an operator that iteratively captures three-valued models of hybrid MKNF knowledge bases with disjunctive rules. This characterization 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 ontology. We elaborate on a relationship between this characterization and approximators in AFT (approximation fixpoint theory) for normal hybrid MKNF knowledge bases.

Related papers

• On the Foundations of Conflict-Driven Solving for Hybrid MKNF Knowledge Bases [1.6424391774944478]
  This paper investigates the theoretical underpinnings required for a conflict-driven solver of HMKNF-KBs. It defines a set of completion and loop formulas, whose satisfaction characterizes MKNF models. This forms the basis for a set of nogoods, which in turn can be used as the backbone for a conflict-driven solver.
  arXiv  Detail & Related papers  (2024-08-19T01:13:02Z)
• A Knowledge-Injected Curriculum Pretraining Framework for Question Answering [70.13026036388794]
  We propose a general Knowledge-Injected Curriculum Pretraining framework (KICP) to achieve comprehensive KG learning and exploitation for Knowledge-based question answering tasks. The KI module first injects knowledge into the LM by generating KG-centered pretraining corpus, and generalizes the process into three key steps. The KA module learns knowledge from the generated corpus with LM equipped with an adapter as well as keeps its original natural language understanding ability. The CR module follows human reasoning patterns to construct three corpora with increasing difficulties of reasoning, and further trains the LM from easy to hard in a curriculum manner.
  arXiv  Detail & Related papers  (2024-03-11T03:42:03Z)
• 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)
• Learning Symbolic Rules for Reasoning in Quasi-Natural Language [74.96601852906328]
  We build a rule-based system that can reason with natural language input but without the manual construction of rules. We propose MetaQNL, a "Quasi-Natural" language that can express both formal logic and natural language sentences. Our approach achieves state-of-the-art accuracy on multiple reasoning benchmarks.
  arXiv  Detail & Related papers  (2021-11-23T17:49:00Z)
• 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)
• Alternating Fixpoint Operator for Hybrid MKNF Knowledge Bases as an Approximator of AFT [10.843231120912757]
  We show that Knorr et al.'s study of the well-founded semantics for hybrid MKNF knowledge bases is in fact an approximator of AFT in disguise. We show an improved approximator for these knowledge bases, of which the least stable fixpoint is information richer than the one formulated from Knorr et al.'s construction. This work is built on an extension of AFT that supports consistent as well as inconsistent pairs in the induced product bilattice.
  arXiv  Detail & Related papers  (2021-05-24T02:32:51Z)
• 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)
• Knowledge-enriched, Type-constrained and Grammar-guided Question Generation over Knowledge Bases [20.412744079015475]
  Question generation over knowledge bases (KBQG) aims at generating natural-language questions about a subgraph, i.e. a set of (connected) triples. Two main challenges still face the current crop of encoder-decoder-based methods, especially on small subgraphs. We propose an innovative knowledge-enriched, type-constrained and grammar-guided KBQG model, named KTG.
  arXiv  Detail & Related papers  (2020-10-07T04:49:48Z)
• BoxE: A Box Embedding Model for Knowledge Base Completion [53.57588201197374]
  Knowledge base completion (KBC) aims to automatically infer missing facts by exploiting information already present in a knowledge base (KB) Existing embedding models are subject to at least one of the following limitations. BoxE embeds entities as points, and relations as a set of hyper-rectangles (or boxes)
  arXiv  Detail & Related papers  (2020-07-13T09:40:49Z)
• On the Role of Conceptualization in Commonsense Knowledge Graph Construction [59.39512925793171]
  Commonsense knowledge graphs (CKGs) like Atomic and ASER are substantially different from conventional KGs. We introduce to CKG construction methods conceptualization to view entities mentioned in text as instances of specific concepts or vice versa. Our methods can effectively identify plausible triples and expand the KG by triples of both new nodes and edges of high diversity and novelty.
  arXiv  Detail & Related papers  (2020-03-06T14:35:20Z)

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.