English
Related papers

Related papers: High-Level Why-Not Explanations using Ontologies

200 papers

For many fundamental problems in computational topology, such as unknot recognition and $3$-sphere recognition, the existence of a polynomial-time solution remains unknown. A major algorithmic tool behind some of the best known algorithms…

Computational Geometry · Computer Science 2024-03-08 Benjamin A. Burton , Alexander He

The knowledge representation community has built general-purpose ontologies which contain large amounts of commonsense knowledge over relevant aspects of the world, including useful visual information, e.g.: "a ball is used by a football…

Artificial Intelligence · Computer Science 2017-05-25 Rodrigo Toro Icarte , Jorge A. Baier , Cristian Ruz , Alvaro Soto

The ability of Large Language Models (LLMs) to perform reasoning tasks such as deduction has been widely investigated in recent years. Yet, their capacity to generate proofs-faithful, human-readable explanations of why conclusions…

Artificial Intelligence · Computer Science 2026-01-21 Hui Yang , Jiaoyan Chen , Uli Sattler

The framework of consistent query answers and repairs has been introduced to alleviate the impact of inconsistent data on the answers to a query. A repair is a minimally different consistent instance and an answer is consistent if it is…

Databases · Computer Science 2009-02-19 Slawomir Staworko , Jan Chomicki

Designing a reliable natural language (NL) interface for querying tables has been a longtime goal of researchers in both the data management and natural language processing (NLP) communities. Such an interface receives as input an NL…

Computation and Language · Computer Science 2018-08-15 Jonathan Berant , Daniel Deutch , Amir Globerson , Tova Milo , Tomer Wolfson

A growing effort in NLP aims to build datasets of human explanations. However, the term explanation encompasses a broad range of notions, each with different properties and ramifications. Our goal is to provide an overview of diverse types…

Computation and Language · Computer Science 2022-05-17 Chenhao Tan

Conjunctive query (CQ) evaluation is NP-complete, but becomes tractable for fragments of bounded hypertreewidth. Approximating a hard CQ by a query from such a fragment can thus allow for an efficient approximate evaluation. While…

Databases · Computer Science 2019-04-02 Pablo Barceló , Miguel Romero , Thomas Zeume

As todays world grows with the technology on the other hand it seems to be small with the World Wide Web. With the use of Internet more and more information can be search from the web. When Users fires a query they want relevancy in…

Information Retrieval · Computer Science 2013-11-26 Debajyoti Mukhopadhyay , Sajeeda Shikalgar

Building explainable systems is a critical problem in the field of Natural Language Processing (NLP), since most machine learning models provide no explanations for the predictions. Existing approaches for explainable machine learning…

Computation and Language · Computer Science 2019-06-12 Hui Liu , Qingyu Yin , William Yang Wang

We build on abduction-based explanations for ma-chine learning and develop a method for computing local explanations for neural network models in natural language processing (NLP). Our explanations comprise a subset of the words of the…

Artificial Intelligence · Computer Science 2021-10-19 Emanuele La Malfa , Agnieszka Zbrzezny , Rhiannon Michelmore , Nicola Paoletti , Marta Kwiatkowska

Ontologies form the basic interest in various computer science disciplines such as semantic web, information retrieval, database design, etc. They aim at providing a formal, explicit and shared conceptualization and understanding of common…

Information Retrieval · Computer Science 2020-05-04 M. Maree , M. Belkhatir

It is useful to have a criterion for when the predictions of an operational theory should be considered classically explainable. Here we take the criterion to be that the theory admits of a generalized-noncontextual ontological model.…

Quantum Physics · Physics 2024-03-14 David Schmid , John H. Selby , Matthew F. Pusey , Robert W. Spekkens

In this paper, we study consistent query answering in tables with nulls and functional dependencies. Given such a table T, we consider the set Tuples of all tuples that can be built up from constants appearing in T, and we use set theoretic…

Databases · Computer Science 2023-02-16 Dominique Laurent , Nicolas Spyratos

Recent availability of Large Language Models (LLMs) has led to the development of numerous LLM-based approaches aimed at providing natural language interfaces for various end-user tasks. These end-user tasks in turn can typically be…

Artificial Intelligence · Computer Science 2025-02-14 Sudhir Agarwal , Anu Sreepathy , David H. Alonso , Prarit Lamba

In our work, we systematize and analyze implicit ontological commitments in the responses generated by large language models (LLMs), focusing on ChatGPT 3.5 as a case study. We investigate how LLMs, despite having no explicit ontology,…

Computation and Language · Computer Science 2024-05-06 Nele Köhler , Fabian Neuhaus

In this paper, we propose causality as a unified framework to explain query answers and non-answers, thus generalizing and extending several previously proposed approaches of provenance and missing query result explanations. We develop our…

Databases · Computer Science 2009-12-31 Alexandra Meliou , Wolfgang Gatterbauer , Katherine F. Moore , Dan Suciu

The terms 'semantics' and 'ontology' are increasingly appearing together with 'explanation', not only in the scientific literature, but also in organizational communication. However, all of these terms are also being significantly…

Artificial Intelligence · Computer Science 2023-04-24 Giancarlo Guizzardi , Nicola Guarino

We introduce ontology-mediated planning, in which planning problems are combined with an ontology. Our formalism differs from existing ones in that we focus on a strong separation of the formalisms for describing planning problems and…

Artificial Intelligence · Computer Science 2024-08-15 Tobias John , Patrick Koopmann

Queries with aggregation and arithmetic operations, as well as incomplete data, are common in real-world database, but we lack a good understanding of how they should interact. On the one hand, systems based on SQL provide ad-hoc rules for…

Databases · Computer Science 2022-11-02 Marco Console , Leonid Libkin , Liat Peterfreund

Large language model (LLM)-based debugging systems can generate failure explanations, but these explanations may be incomplete or incorrect. Misleading explanations are harmful for downstream tasks (e.g., bug triage, bug fixing). We…

Software Engineering · Computer Science 2026-05-21 Julius Porbeck , Christian Medeiros Adriano , Holger Giese