Provenance for the Description Logic ELHr

• URL: http://arxiv.org/abs/2001.07541v3
• Date: Tue, 24 Oct 2023 15:27:24 GMT
• Title: Provenance for the Description Logic ELHr
• Authors: Camille Bourgaux, Ana Ozaki, Rafael Pe\~naloza and Livia Predoiu
• Abstract summary: We consider a setting recently introduced for data access based on provenance and extending classical data provenance. We show that the presence of axioms poses various difficulties for handling provenance, some of which are mitigated by assuming multiplicative idempotency of the semiring.
• Score: 9.35688592148841
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We address the problem of handling provenance information in ELHr ontologies. We consider a setting recently introduced for ontology-based data access, based on semirings and extending classical data provenance, in which ontology axioms are annotated with provenance tokens. A consequence inherits the provenance of the axioms involved in deriving it, yielding a provenance polynomial as an annotation. We analyse the semantics for the ELHr case and show that the presence of conjunctions poses various difficulties for handling provenance, some of which are mitigated by assuming multiplicative idempotency of the semiring. Under this assumption, we study three problems: ontology completion with provenance, computing the set of relevant axioms for a consequence, and query answering.

Related papers

• CLATTER: Comprehensive Entailment Reasoning for Hallucination Detection [60.98964268961243]
  We propose that guiding models to perform a systematic and comprehensive reasoning process allows models to execute much finer-grained and accurate entailment decisions.<n>We define a 3-step reasoning process, consisting of (i) claim decomposition, (ii) sub-claim attribution and entailment classification, and (iii) aggregated classification, showing that such guided reasoning indeed yields improved hallucination detection.
  arXiv  Detail & Related papers  (2025-06-05T17:02:52Z)
• ACCESS : A Benchmark for Abstract Causal Event Discovery and Reasoning [47.540945048737434]
  We introduce textttACCESS, a benchmark designed for discovery and reasoning over abstract causal events.<n>We propose a pipeline for identifying abstractions for event generalizations from a large-scale dataset of implicit commonsense causal knowledge.
  arXiv  Detail & Related papers  (2025-02-12T06:19:02Z)
• H-STAR: LLM-driven Hybrid SQL-Text Adaptive Reasoning on Tables [56.73919743039263]
  This paper introduces a novel algorithm that integrates both symbolic and semantic (textual) approaches in a two-stage process to address limitations. Our experiments demonstrate that H-STAR significantly outperforms state-of-the-art methods across three question-answering (QA) and fact-verification datasets.
  arXiv  Detail & Related papers  (2024-06-29T21:24:19Z)
• 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)
• Algorithmic syntactic causal identification [0.8901073744693314]
  Causal identification in causal Bayes nets (CBNs) is an important tool in causal inference. Most existing formulations of causal identification using techniques such as d-separation and do-calculus are expressed within the mathematical language of classical probability theory. We show that this restriction can be lifted by replacing the use of classical probability theory with the alternative axiomatic foundation of symmetric monoidal categories.
  arXiv  Detail & Related papers  (2024-03-14T17:14:53Z)
• Inferentialist Resource Semantics [48.65926948745294]
  This paper shows how inferentialism enables a versatile and expressive framework for resource semantics. How inferentialism seamlessly incorporates the assertion-based approach of the logic of Bunched Implications. This integration enables reasoning about shared and separated resources in intuitive and familiar ways.
  arXiv  Detail & Related papers  (2024-02-14T14:54:36Z)
• Exploring the Jungle of Bias: Political Bias Attribution in Language Models via Dependency Analysis [86.49858739347412]
  Large Language Models (LLMs) have sparked intense debate regarding the prevalence of bias in these models and its mitigation. We propose a prompt-based method for the extraction of confounding and mediating attributes which contribute to the decision process. We find that the observed disparate treatment can at least in part be attributed to confounding and mitigating attributes and model misalignment.
  arXiv  Detail & Related papers  (2023-11-15T00:02:25Z)
• Semiring Provenance for Lightweight Description Logics [9.894661582401447]
  We investigate provenance semiring--a successful framework originally defined in the database setting--for description logics. We show that under some restrictions on the semiring, the semantics satisfies desirable properties. We study the complexity of problems related to the provenance of an axiom or a conjunctive query answer.
  arXiv  Detail & Related papers  (2023-10-25T08:53:49Z)
• Dual Box Embeddings for the Description Logic EL++ [16.70961576041243]
  Similar to Knowledge Graphs (KGs), Knowledge Graphs are often incomplete, and maintaining and constructing them has proved challenging. Similar to KGs, a promising approach is to learn embeddings in a latent vector space, while additionally ensuring they adhere to the semantics of the underlying DL. We propose a novel ontology embedding method named Box$2$EL for the DL EL++, which represents both concepts and roles as boxes.
  arXiv  Detail & Related papers  (2023-01-26T14:13:37Z)
• Answering Fuzzy Queries over Fuzzy DL-Lite Ontologies [0.2741266294612776]
  We study the problem of answering conjunctive queries and threshold queries in fuzzy DL-Lite. For the idemdent G"odel t-norm, we provide an effective method based on a reduction to the classical case.
  arXiv  Detail & Related papers  (2021-11-23T10:45:54Z)
• Discrete Reasoning Templates for Natural Language Understanding [79.07883990966077]
  We present an approach that reasons about complex questions by decomposing them to simpler subquestions. We derive the final answer according to instructions in a predefined reasoning template. We show that our approach is competitive with the state-of-the-art while being interpretable and requires little supervision.
  arXiv  Detail & Related papers  (2021-04-05T18:56:56Z)
• Leveraging Unlabeled Data for Entity-Relation Extraction through Probabilistic Constraint Satisfaction [54.06292969184476]
  We study the problem of entity-relation extraction in the presence of symbolic domain knowledge. Our approach employs semantic loss which captures the precise meaning of a logical sentence. With a focus on low-data regimes, we show that semantic loss outperforms the baselines by a wide margin.
  arXiv  Detail & Related papers  (2021-03-20T00:16:29Z)
• Plausible Reasoning about EL-Ontologies using Concept Interpolation [27.314325986689752]
  We propose an inductive mechanism which is based on a clear model-theoretic semantics, and can thus be tightly integrated with standard deductive reasoning. We focus on inference, a powerful commonsense reasoning mechanism which is closely related to cognitive models of category-based induction.
  arXiv  Detail & Related papers  (2020-06-25T14:19:41Z)

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.