eSPARQL: Representing and Reconciling Agnostic and Atheistic Beliefs in RDF-star Knowledge Graphs

• URL: http://arxiv.org/abs/2407.21483v3
• Date: Tue, 6 Aug 2024 12:34:16 GMT
• Title: eSPARQL: Representing and Reconciling Agnostic and Atheistic Beliefs in RDF-star Knowledge Graphs
• Abstract summary: A recent extension to RDF which admits statements over statements, called RDF-star, is in revision to become a W3C standard. There is no proposal for a semantics of these RDF-star statements nor a built-in facility to operate over them. We propose a query language for RDF-star metadata based on a four-valued logic, called eSPARQL.
• Score: 10.001148724656723
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Over the past few years, we have seen the emergence of large knowledge graphs combining information from multiple sources. Sometimes, this information is provided in the form of assertions about other assertions, defining contexts where assertions are valid. A recent extension to RDF which admits statements over statements, called RDF-star, is in revision to become a W3C standard. However, there is no proposal for a semantics of these RDF-star statements nor a built-in facility to operate over them. In this paper, we propose a query language for epistemic RDF-star metadata based on a four-valued logic, called eSPARQL. Our proposed query language extends SPARQL-star, the query language for RDF-star, with a new type of FROM clause to facilitate operating with multiple and sometimes conflicting beliefs. We show that the proposed query language can express four use case queries, including the following features: (i) querying the belief of an individual, (ii) the aggregating of beliefs, (iii) querying who is conflicting with somebody, and (iv) beliefs about beliefs (i.e., nesting of beliefs).

Related papers

• RENSA: Rich Environment Metadata to Navigate Shared and Distributed Endpoints for Automated Federated SPARQL Query Generation [0.0]
  RENSA is a federated SPARQL query generation framework that leverages an extension of SPARQL Builder Metadata.<n>We show that RENSA achieves source selection results comparable to state-of-the-art methods while eliminating ASK query overhead.<n>These profiles additionally offer human-readable structural insights for semi-automated query generation.
  arXiv  Detail & Related papers  (2026-08-29T00:32:13Z)
• SAGA: Schema-Aware Grounding for Agentic Text-to-SPARQL Generation [3.01421775057336]
  Complex knowledge base question answering (KBQA) is commonly approached through either information retrieval over a question-specific subgraph or semantic parsing into an executable logical form.<n>Recent large language model agents make semantic parsing interactive: they alternate between reasoning, querying the knowledge base, and extending a partial SPARQL query.<n>We propose SAGA (underlineSchema-underlineAware underlineGrounding for underlineAgentic Text-to-SPARQL Generation), a training-free framework that turns property exploration into a schema-constrained grounding
  arXiv  Detail & Related papers  (2026-07-16T02:17:21Z)
• SPARQL-LLM: Real-Time SPARQL Query Generation from Natural Language Questions [1.3856736555085554]
  SPARQL-LLM is an open-source and triplestore-agnostic approach, powered by lightweight metadata, that generates SPARQL queries from natural language text.<n>We show that SPARQL-LLM is up to 36x faster than other systems participating in the challenge, while costing a maximum of $0.01 per question.
  arXiv  Detail & Related papers  (2025-12-16T10:39:46Z)
• Reasoning-enhanced Query Understanding through Decomposition and Interpretation [87.56450566014625]
  ReDI is a Reasoning-enhanced approach for query understanding through Decomposition and Interpretation.<n>We compiled a large-scale dataset of real-world complex queries from a major search engine.<n> Experiments on BRIGHT and BEIR demonstrate that ReDI consistently surpasses strong baselines in both sparse and dense retrieval paradigms.
  arXiv  Detail & Related papers  (2025-09-08T10:58:42Z)
• Q${}^2$Forge: Minting Competency Questions and SPARQL Queries for Question-Answering Over Knowledge Graphs [6.6757601046766135]
  The SPARQL query language is the standard method to access knowledge graphs (KGs)<n>Best practices recommend to document KGs with competency questions and example queries.<n>Q$2$Forge addresses the challenge of generating new competency questions for a KG and corresponding SPARQL queries.
  arXiv  Detail & Related papers  (2025-05-19T13:26:51Z)
• RAGONITE: Iterative Retrieval on Induced Databases and Verbalized RDF for Conversational QA over KGs with RAG [6.4032082023113475]
  SPARQL is brittle for complex intents and conversational questions. We propose a novel two-pronged system where we fuse: (i) SPARQL results over a database automatically derived from the knowledge graph, and (ii) text-search results over verbalizations of KG facts. Our pipeline supports iterative retrieval: when the results of any branch are found to be unsatisfactory, the system can automatically opt for further rounds. We demonstrate the superiority of our proposed system over several baselines on a knowledge graph of BMW automobiles.
  arXiv  Detail & Related papers  (2024-12-23T16:16:30Z)
• AMBROSIA: A Benchmark for Parsing Ambiguous Questions into Database Queries [56.82807063333088]
  We introduce a new benchmark, AMBROSIA, which we hope will inform and inspire the development of text-to-open programs. Our dataset contains questions showcasing three different types of ambiguity (scope ambiguity, attachment ambiguity, and vagueness) In each case, the ambiguity persists even when the database context is provided. This is achieved through a novel approach that involves controlled generation of databases from scratch.
  arXiv  Detail & Related papers  (2024-06-27T10:43:04Z)
• Generating Multi-Aspect Queries for Conversational Search [6.974395116689502]
  We show that the same retrieval model would perform better with more than one rewritten query by 85% in terms of nDCG@3. We propose a multi-aspect query generation and retrieval framework, called MQ4CS.
  arXiv  Detail & Related papers  (2024-03-28T10:40:22Z)
• dIR -- Discrete Information Retrieval: Conversational Search over Unstructured (and Structured) Data with Large Language Models [0.16060477887377675]
  This paper introduces dIR, Discrete Information Retrieval, providing a unified interface to query both free text and structured knowledge. We validate our approach via a proprietary question/answer data set, concluding dIR makes a whole new class of queries on free text possible.
  arXiv  Detail & Related papers  (2023-12-20T18:41:44Z)
• Decomposing Complex Queries for Tip-of-the-tongue Retrieval [72.07449449115167]
  Complex queries describe content elements (e.g., book characters or events), information beyond the document text. This retrieval setting, called tip of the tongue (TOT), is especially challenging for models reliant on lexical and semantic overlap between query and document text. We introduce a simple yet effective framework for handling such complex queries by decomposing the query into individual clues, routing those as sub-queries to specialized retrievers, and ensembling the results.
  arXiv  Detail & Related papers  (2023-05-24T11:43:40Z)
• ALIST: Associative Logic for Inference, Storage and Transfer. A Lingua Franca for Inference on the Web [0.0]
  A formalism that abstracts the representation of queries from the specific query language of a knowledge graph. A representation to dynamically curate data and functions (operations) over diverse knowledge sources. A demonstration of the expressiveness of alists to represent the diversity of representational formalisms.
  arXiv  Detail & Related papers  (2023-03-12T15:55:56Z)
• Semantic Parsing for Conversational Question Answering over Knowledge Graphs [63.939700311269156]
  We develop a dataset where user questions are annotated with Sparql parses and system answers correspond to execution results thereof. We present two different semantic parsing approaches and highlight the challenges of the task. Our dataset and models are released at https://github.com/Edinburgh/SPICE.
  arXiv  Detail & Related papers  (2023-01-28T14:45:11Z)
• Towards Complex Document Understanding By Discrete Reasoning [77.91722463958743]
  Document Visual Question Answering (VQA) aims to understand visually-rich documents to answer questions in natural language. We introduce a new Document VQA dataset, named TAT-DQA, which consists of 3,067 document pages and 16,558 question-answer pairs. We develop a novel model named MHST that takes into account the information in multi-modalities, including text, layout and visual image, to intelligently address different types of questions.
  arXiv  Detail & Related papers  (2022-07-25T01:43:19Z)
• SPARQLing Database Queries from Intermediate Question Decompositions [7.475027071883912]
  To translate natural language questions into database queries, most approaches rely on a fully annotated training set. We reduce this burden using grounded in databases intermediate question representations. Our pipeline consists of two parts: a semantic that converts natural language questions into the intermediate representations and a non-trainable transpiler to the QLSPAR query language.
  arXiv  Detail & Related papers  (2021-09-13T17:57:12Z)
• Dual Reader-Parser on Hybrid Textual and Tabular Evidence for Open Domain Question Answering [78.9863753810787]
  A large amount of world's knowledge is stored in structured databases. query languages can answer questions that require complex reasoning, as well as offering full explainability.
  arXiv  Detail & Related papers  (2021-08-05T22:04:13Z)
• Query Understanding via Intent Description Generation [75.64800976586771]
  We propose a novel Query-to-Intent-Description (Q2ID) task for query understanding. Unlike existing ranking tasks which leverage the query and its description to compute the relevance of documents, Q2ID is a reverse task which aims to generate a natural language intent description. We demonstrate the effectiveness of our model by comparing with several state-of-the-art generation models on the Q2ID task.
  arXiv  Detail & Related papers  (2020-08-25T08:56:40Z)
• A Novel Approach for Generating SPARQL Queries from RDF Graphs [0.0]
  This work is done as part of a research master's thesis project. The goal is to generate SPARQL queries based on user-supplied keywords to query RDF graphs.
  arXiv  Detail & Related papers  (2020-05-30T18:28:49Z)

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.