中文
相关论文

相关论文: Evaluating Defaults

200 篇论文

Results about the redundancy of circumscriptive and default theories are presented. In particular, the complexity of establishing whether a given theory is redundant is establihsed.

计算机科学中的逻辑 · 计算机科学 2021-04-12 Paolo Liberatore

There is a fundamental disconnect between what is tested in a model adequacy test, and what we would like to test. The usual approach is to test the null hypothesis "Model M is the true model." However, Model M is never the true model. A…

统计方法学 · 统计学 2016-08-23 Toby Kenney , Hong Gu

This paper discusses the processes by which conversants in a dialogue can infer whether their assertions and proposals have been accepted or rejected by their conversational partners. It expands on previous work by showing that logical…

cmp-lg · 计算机科学 2008-02-03 Marilyn A. Walker

In this paper we present a transformation of finite propositional default theories into so-called propositional argumentation systems. This transformation allows to characterize all notions of Reiter's default logic in the framework of…

人工智能 · 计算机科学 2007-05-23 Dritan Berzati , Bernhard Anrig , Juerg Kohlas

The features of a logically sound approach to a theory of statistical reasoning are discussed. A particular approach that satisfies these criteria is reviewed. This is seen to involve selection of a model, model checking, elicitation of a…

统计理论 · 数学 2018-05-09 Luai Al-Labadi , Zeynep Baskurt , Michael Evans

Tarski gave a general semantics for deductive reasoning: a formula a may be deduced from a set A of formulas iff a holds in all models in which each of the elements of A holds. A more liberal semantics has been considered: a formula a may…

人工智能 · 计算机科学 2007-05-23 Daniel Lehmann

An important characteristic of many logics for Artificial Intelligence is their nonmonotonicity. This means that adding a formula to the premises can invalidate some of the consequences. There may, however, exist formulae that can always be…

人工智能 · 计算机科学 2007-05-23 J. Engelfriet

Nonmonotonic reasoning is a pattern of reasoning that allows an agent to make and retract (tentative) conclusions from inconclusive evidence. This paper gives a possible-worlds interpretation of the nonmonotonic reasoning problem based on…

人工智能 · 计算机科学 2013-04-10 Carl Kadie

Unaided human decision making appears to systematically violate consistency constraints imposed by normative theories; these biases in turn appear to justify the application of formal decision-analytic models. It is argued that both claims…

人工智能 · 计算机科学 2013-04-08 Marvin S. Cohen

Predictive models are being increasingly used to support consequential decision making at the individual level in contexts such as pretrial bail and loan approval. As a result, there is increasing social and legal pressure to provide…

机器学习 · 计算机科学 2020-03-02 Amir-Hossein Karimi , Gilles Barthe , Borja Balle , Isabel Valera

This paper shows that the problem of testing hypotheses in moment condition models without any assumptions about identification may be considered as a problem of testing with an infinite-dimensional nuisance parameter. We introduce a…

统计理论 · 数学 2014-09-24 Isaiah Andrews , Anna Mikusheva

The premises of an argument give evidence or other reasons to support a conclusion. However, the amount of support required depends on the generality of a conclusion, the nature of the individual premises, and similar. An argument whose…

计算与语言 · 计算机科学 2021-10-27 Timon Gurcke , Milad Alshomary , Henning Wachsmuth

Over the past few decades, non-monotonic reasoning has developed to be one of the most important topics in computational logic and artificial intelligence. Different ways to introduce non-monotonic aspects to classical logic have been…

计算复杂性 · 计算机科学 2010-09-13 Michael Thomas , Heribert Vollmer

Considerable attention has been given to the problem of non-monotonic reasoning in a belief function framework. Earlier work (M. Ginsberg) proposed solutions introducing meta-rules which recognized conditional independencies in a…

人工智能 · 计算机科学 2013-04-05 Mary McLeish

Possibility theory offers a framework where both Lehmann's "preferential inference" and the more productive (but less cautious) "rational closure inference" can be represented. However, there are situations where the second inference does…

人工智能 · 计算机科学 2013-02-18 Salem Benferhat , Didier Dubois , Henri Prade

Deduction is the one of the major forms of inferences and commonly used in formal logic. This kind of inference has the feature of monotonicity, which can be problematic. There are different types of inferences that are not monotonic, e.g.…

计算机科学中的逻辑 · 计算机科学 2020-07-07 Florian Richter

A classical problem of statistical inference is the valid specification of a model that can account for the statistical dependencies between observations when the true structure is dense, intractable, or unknown. To address this problem, a…

统计理论 · 数学 2023-10-19 Shane Sparkes , Lu Zhang

The large-sample properties of likelihood-based statistical inference under mixture models have received much attention from statisticians. Although the consistency of the nonparametric MLE is regarded as a standard conclusion, many…

统计理论 · 数学 2016-07-06 Jiahua Chen

A principled approach to understand network structures is to formulate generative models. Given a collection of models, however, an outstanding key task is to determine which one provides a more accurate description of the network at hand,…

机器学习 · 统计学 2018-06-29 Toni Vallès-Català , Tiago P. Peixoto , Roger Guimerà , Marta Sales-Pardo

This paper proposes new parametric model adequacy tests for possibly nonlinear and nonstationary time series models with noncontinuous data distribution, which is often the case in applied work. In particular, we consider the correct…

统计理论 · 数学 2021-08-10 Igor Kheifets , Carlos Velasco