中文
相关论文

相关论文: Axiomatic Aspects of Default Inference

200 篇论文

In the present paper, we investigate consequence relations that are both paraconsistent and plausible (but still monotonic). More precisely, we put the focus on pivotal consequence relations, i.e. those relations that can be defined by a…

计算机科学中的逻辑 · 计算机科学 2007-05-23 Jonathan Ben-Naim

Recent success of Bayesian methods in neuroscience and artificial intelligence gives rise to the hypothesis that the brain is a Bayesian machine. Since logic, as the laws of thought, is a product and practice of the human brain, it leads to…

人工智能 · 计算机科学 2021-01-28 Hiroyuki Kido

We extend description logics (DLs) with non-monotonic reasoning features. We start by investigating a notion of defeasible subsumption in the spirit of defeasible conditionals as studied by Kraus, Lehmann and Magidor in the propositional…

人工智能 · 计算机科学 2019-04-17 Katarina Britz , Giovanni Casini , Thomas Meyer , Kody Moodley , Uli Sattler , Ivan Varzinczak

We study probabilistically informative (weak) versions of transitivity, by using suitable definitions of defaults and negated defaults, in the setting of coherence and imprecise probabilities. We represent p-consistent sequences of defaults…

概率论 · 数学 2015-03-16 Angelo Gilio , Niki Pfeifer , Giuseppe Sanfilippo

In response to a concern raised by Horty, this paper develops a two-tiered, preference-based semantic framework for modeling defeasible conditional obligations. The paper extends a Hansson-Lewis style preference semantics for dyadic deontic…

计算机科学中的逻辑 · 计算机科学 2026-05-01 Xavier Parent

We propose and investigate a simple ranking-measure-based extension semantics for abstract argumentation frameworks based on their generic instantiation by default knowledge bases and the ranking construction semantics for default…

人工智能 · 计算机科学 2014-07-17 Emil Weydert

We give a proof-theoretic as well as a semantic characterization of a logic in the signature with conjunction, disjunction, negation, and the universal and existential quantifiers that we suggest has a certain fundamental status. We present…

逻辑 · 数学 2023-04-06 Wesley H. Holliday

This paper first shows that the popular axiomatic systems proposed by Nute for Lewis' conditional logics are not equivalent to Lewis' original systems. In particular, the axiom CA which is derivable in Lewis' systems is not derivable in…

计算机科学中的逻辑 · 计算机科学 2019-10-15 Xuefeng Wen

Non-deductive reasoning systems are often {\em representation dependent}: representing the same situation in two different ways may cause such a system to return two different answers. Some have viewed this as a significant problem. For…

人工智能 · 计算机科学 2007-05-23 Joseph Y. Halpern , Daphne Koller

We introduce proper display calculi for basic monotonic modal logic, the conditional logic CK and a number of their axiomatic extensions. These calculi are sound, complete, conservative and enjoy cut elimination and subformula property. Our…

We introduce proper display calculi for basic monotonic modal logic,the conditional logic CK and a number of their axiomatic extensions. These calculi are sound, complete, conservative and enjoy cut elimination and subformula property. Our…

We generalize the notion of consequence relation standard in abstract treatments of logic to accommodate intuitions of relevance. The guiding idea follows the \emph{use criterion}, according to which in order for some premises to have some…

逻辑 · 数学 2024-11-20 Guillermo Badia , Petr Cintula , Libor Behounek , Andrew Tedder

The purpose of this paper is to outline a simple set of axioms for basic set theory from which most fundamental facts can be derived. The key to the whole project is a new axiom of set theory which I dubbed "The Law of Extremes". It allows…

逻辑 · 数学 2013-05-16 Jerzy Dydak

There is much interest in providing probabilistic semantics for defaults but most approaches seem to suffer from one of two problems: either they require numbers, a problem defaults were intended to avoid, or they generate peculiar side…

人工智能 · 计算机科学 2013-04-10 Eric Neufeld , David L Poole

Existential rules have been proposed for representing ontological knowledge, specifically in the context of Ontology- Based Data Access. Entailment with existential rules is undecidable. We focus in this paper on conditions that ensure the…

人工智能 · 计算机科学 2014-07-28 Jean-François Baget , Fabien Garreau , Marie-Laure Mugnier , Swan Rocher

Referring is one of the most basic and prevalent uses of language. How do speakers choose from the wealth of referring expressions at their disposal? Rational theories of language use have come under attack for decades for not being able to…

计算与语言 · 计算机科学 2019-12-11 Judith Degen , Robert D. Hawkins , Caroline Graf , Elisa Kreiss , Noah D. Goodman

Recent work on the logical structure of non-locality has constructed scenarios where observations of multi-partite systems cannot be adequately described by compositions of non-signaling subsystems. In this paper we apply these frameworks…

计算机科学与博弈论 · 计算机科学 2015-12-10 William Zeng , Philipp Zahn

In this work we generalize standard Decision Theory by assuming that two outcomes can also be incomparable. Two motivating scenarios show how incomparability may be helpful to represent those situations where, due to lack of information,…

计算机科学与博弈论 · 计算机科学 2014-04-04 Piero A. Bonatti , Marco Faella , Luigi Sauro

We consider the question of extending propositional logic to a logic of plausible reasoning, and posit four requirements that any such extension should satisfy. Each is a requirement that some property of classical propositional logic be…

人工智能 · 计算机科学 2017-07-07 Kevin S. Van Horn

The use of meta-rules in logic, i.e., rules whose content includes other rules, has recently gained attention in the setting of non-monotonic reasoning: a first logical formalisation and efficient algorithms to compute the (meta)-extensions…

人工智能 · 计算机科学 2022-09-27 Francesco Olivieri , Guido Governatori , Matteo Cristani , Antonino Rotolo , Abdul Sattar