中文
相关论文

相关论文: Defeasible Reasoning in OSCAR

200 篇论文

Explainability of recommender systems has become essential to ensure users' trust and satisfaction. Various types of explainable recommender systems have been proposed including explainable graph-based recommender systems. This review paper…

信息检索 · 计算机科学 2025-10-22 Thanet Markchom , Huizhi Liang , James Ferryman

Deontic logic is shown to be applicable for modelling human reasoning. For this the Wason selection task and the suppression task are discussed in detail. Different versions of modelling norms with deontic logic are introduced and in the…

人工智能 · 计算机科学 2014-09-19 Ulrich Furbach , Claudia Schon

We show that a system of unstable higher Toda brackets can be defined inductively.

代数拓扑 · 数学 2021-07-23 Hideaki Ooshima , Katsumi Ooshima

We find that second order quantification is problematic when a quantified concept variable is supposed to function predicatively. This issue is analyzed and it is shown that a constructive interpretation of the falling under relation…

逻辑 · 数学 2013-12-13 Nik Weaver

In this preliminary note, we will illustrate our ideas on automated mechanisms for termination and non-termination reasoning.

编程语言 · 计算机科学 2013-09-13 Ton Chanh Le

Justification theory is a general framework for the definition of semantics of rule-based languages that has a high explanatory potential. Nested justification systems, first introduced by Denecker et al. (2015), allow for the composition…

人工智能 · 计算机科学 2022-05-11 Simon Marynissen , Jesse Heyninck , Bart Bogaerts , Marc Denecker

Neural rationale models are popular for interpretable predictions of NLP tasks. In these, a selector extracts segments of the input text, called rationales, and passes these segments to a classifier for prediction. Since the rationale is…

计算与语言 · 计算机科学 2022-07-26 Yiming Zheng , Serena Booth , Julie Shah , Yilun Zhou

Explainability and comprehensibility of AI are important requirements for intelligent systems deployed in real-world domains. Users want and frequently need to understand how decisions impacting them are made. Similarly it is important to…

计算机与社会 · 计算机科学 2019-07-10 Roman V. Yampolskiy

Linear Logic and Defeasible Logic have been adopted to formalise different features of knowledge representation: consumption of resources, and non monotonic reasoning in particular to represent exceptions. Recently, a framework to combine…

人工智能 · 计算机科学 2019-08-19 Francesco Olivieri , Guido Governatori , Claudio Tomazzoli , Matteo Cristani

Different types of reasoning impose different structural demands on representational systems, yet no systematic account of these demands exists across psychology, AI, and philosophy of mind. I propose a framework identifying four structural…

人工智能 · 计算机科学 2026-04-03 Yiling Wu

In two recent papers, I have proposed a description of decision analysis that differs from the Bayesian picture painted by Savage, Jeffrey and other classic authors. Response to this view has been either overly enthusiastic or unduly…

人工智能 · 计算机科学 2013-04-08 Ronald P. Loui

Explainable recommendation has shown its great advantages for improving recommendation persuasiveness, user satisfaction, system transparency, among others. A fundamental problem of explainable recommendation is how to evaluate the…

信息检索 · 计算机科学 2022-02-15 Xu Chen , Yongfeng Zhang , Ji-Rong Wen

We use the theory of defaults and their meaning of [GS16] to develop (the outline of a) new theory of argumentation.

逻辑 · 数学 2016-12-20 Karl Schlechta

The KLM approach to defeasible reasoning introduces a weakened form of implication into classical logic. This allows one to incorporate exceptions to general rules into a logical system, and for old conclusions to be withdrawn upon learning…

人工智能 · 计算机科学 2024-10-08 Nicholas Leisegang , Thomas Meyer , Sebastian Rudolph

This paper introduces the notion of objection-based causal networks which resemble probabilistic causal networks except that they are quantified using objections. An objection is a logical sentence and denotes a condition under which a,…

人工智能 · 计算机科学 2013-03-25 Adnan Darwiche

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…

人工智能 · 计算机科学 2007-05-23 Bart Verheij

Moral or ethical judgments rely heavily on the specific contexts in which they occur. Understanding varying shades of defeasible contextualizations (i.e., additional information that strengthens or attenuates the moral acceptability of an…

计算与语言 · 计算机科学 2024-05-24 Kavel Rao , Liwei Jiang , Valentina Pyatkin , Yuling Gu , Niket Tandon , Nouha Dziri , Faeze Brahman , Yejin Choi

Using a novel rewriting problem, we show that several natural decision problems about finite automata are undecidable (i.e., recursively unsolvable). In contrast, we also prove three related problems are decidable. We apply one result to…

形式语言与自动机理论 · 计算机科学 2017-03-01 Jörg Endrullis , Jeffrey Shallit , Tim Smith

We introduce and investigate here a formalisation for conditionals that allows the definition of a broad class of reasoning systems. This framework covers the most popular kinds of conditional reasoning in logic-based KR: the semantics we…

人工智能 · 计算机科学 2022-02-16 Giovanni Casini , Umberto Straccia

The remarkable success of Artificial Intelligence in advancing automated decision-making is evident both in academia and industry. Within the plethora of applications, ranking systems hold significant importance in various domains. This…

信息检索 · 计算机科学 2023-12-19 Alessandro Castelnovo , Riccardo Crupi , Nicolò Mombelli , Gabriele Nanino , Daniele Regoli