English
Related papers

Related papers: A Study of Associative Evidential Reasoning

200 papers

Explanation constitutes an archetypal feature of human rationality, underpinning learning and generalisation, and representing one of the media supporting scientific discovery and communication. Due to the importance of explanations in…

Computation and Language · Computer Science 2024-10-08 Marco Valentino , André Freitas

We study the problem of combining the outcomes of several different classifiers in a way that provides a coherent inference that satisfies some constraints. In particular, we develop two general approaches for an important…

Machine Learning · Computer Science 2007-05-23 Vasin Punyakanok , Dan Roth

Selecting the right reference class and the right interval when faced with conflicting candidates and no possibility of establishing subset style dominance has been a problem for Kyburg's Evidential Probability system. Various methods have…

Artificial Intelligence · Computer Science 2013-03-26 Bülent Murtezaoğlu , Henry E. Kyburg

The purpose of this paper is to introduce basic concepts that are fundamental in the examination of composite moduli, while avoiding the notoriously difficult problem of prime-factorization. We introduce a new class of numbers, called…

Rings and Algebras · Mathematics 2016-10-31 József Vass

Explanations shed light on a machine learning model's rationales and can aid in identifying deficiencies in its reasoning process. Explanation generation models are typically trained in a supervised way given human explanations. When such…

Machine Learning · Computer Science 2021-09-09 Pepa Atanasova , Jakob Grue Simonsen , Christina Lioma , Isabelle Augenstein

While proof is a central component of postsecondary mathematical study, proof construction has historically posed significant difficulties for students who intend to earn mathematics degrees at the undergraduate level. This work is…

History and Overview · Mathematics 2023-03-01 Bolanle Salaam

Automated theorem provers and formal proof assistants are general reasoning systems that are in theory capable of proving arbitrarily hard theorems, thus solving arbitrary problems reducible to mathematics and logical reasoning. In…

Artificial Intelligence · Computer Science 2025-06-23 Lasse Blaauwbroek , David Cerna , Thibault Gauthier , Jan Jakubův , Cezary Kaliszyk , Martin Suda , Josef Urban

The concept of movable evidence masses that flow from supersets to subsets as specified by experts represents a suitable framework for reasoning under uncertainty. The mass flow is controlled by specialization matrices. New evidence is…

Artificial Intelligence · Computer Science 2013-03-26 Rudolf Kruse , Detlef Nauck , Frank Klawonn

In an earlier paper, a new theory of measurefree "conditional" objects was presented. In this paper, emphasis is placed upon the motivation of the theory. The central part of this motivation is established through an example involving a…

Artificial Intelligence · Computer Science 2013-04-11 I. R. Goodman

Formal deductive systems are very common in computer science. They are used to represent logics, programming languages, and security systems. Moreover, writing programs that manipulate them and that reason about them is important and…

Programming Languages · Computer Science 2018-05-21 Francisco Ferreira Ruiz

In this paper we study the logical foundations of automated inductive theorem proving. To that aim we first develop a theoretical model that is centered around the difficulty of finding induction axioms which are sufficient for proving a…

Logic in Computer Science · Computer Science 2023-06-22 Stefan Hetzl , Tin Lok Wong

To adequately model mathematical arguments the analyst must be able to represent the mathematical objects under discussion and the relationships between them, as well as inferences drawn about these objects and relationships as the…

Computation and Language · Computer Science 2018-07-17 Joseph Corneli , Ursula Martin , Dave Murray-Rust , Gabriela Rino Nesin , Alison Pease

To develop an approach to utilizing continuous statistical information within the Dempster- Shafer framework, we combine methods proposed by Strat and by Shafero We first derive continuous possibility and mass functions from…

Artificial Intelligence · Computer Science 2013-04-12 Pascal Fua

In the present paper, the existence and multiplicity problems of extensions are addressed. The focus is on extension of the stable type. The main result of the paper is an elegant characterization of the existence and multiplicity of…

Artificial Intelligence · Computer Science 2007-05-23 Bart Verheij

Machine Learning explainability techniques have been proposed as a means of `explaining' or interrogating a model in order to understand why a particular decision or prediction has been made. Such an ability is especially important at a…

Machine Learning · Statistics 2022-02-28 Matthew J. Vowels

We define the notion of compiling a Bayesian network with evidence and provide a specific approach for evidence-based compilation, which makes use of logical processing. The approach is practical and advantageous in a number of application…

Artificial Intelligence · Computer Science 2012-07-09 Mark Chavira , David Allen , Adnan Darwiche

Understanding the behavior of learned classifiers is an important task, and various black-box explanations, logical reasoning approaches, and model-specific methods have been proposed. In this paper, we introduce probabilistic sufficient…

Machine Learning · Computer Science 2021-05-24 Eric Wang , Pasha Khosravi , Guy Van den Broeck

Norms are essential to extend inference: inferences based on norms are far richer than those based on logical implications. In the recent decades, much effort has been devoted to reason on a domain, once its norms are represented. How to…

Artificial Intelligence · Computer Science 2007-05-23 Daniel Kayser , Farid Nouioua

An increasing number of scientific experiments support the view of perception as Bayesian inference, which is rooted in Helmholtz's view of perception as unconscious inference. Recent study of logic presents a view of logical reasoning as…

Artificial Intelligence · Computer Science 2026-02-24 Hiroyuki Kido

We generalize the notion of proof term to the realm of transfinite reduction. Proof terms represent reductions in the first-order term format, thereby facilitating their formal analysis. We show that any transfinite reduction can be…

Logic in Computer Science · Computer Science 2014-02-13 Carlos Lombardi , Alejandro Ríos , Roel de Vrijer