Results 1  10
of
312
Probabilistic Horn abduction and Bayesian networks
 Artificial Intelligence
, 1993
"... This paper presents a simple framework for Hornclause abduction, with probabilities associated with hypotheses. The framework incorporates assumptions about the rule base and independence assumptions amongst hypotheses. It is shown how any probabilistic knowledge representable in a discrete Bayesia ..."
Abstract

Cited by 328 (38 self)
 Add to MetaCart
This paper presents a simple framework for Hornclause abduction, with probabilities associated with hypotheses. The framework incorporates assumptions about the rule base and independence assumptions amongst hypotheses. It is shown how any probabilistic knowledge representable in a discrete
An assumptionbased truthmaintenance system
 Artificial Intelligence
, 1986
"... In this paper we (1) define the concept of a Clause Managetnent System (CMS) — a generaizatiou of de Kleer’s ATMS, (2) motivate such systems in terms of efficiency of search and abductive reasoning, and (3) characterize the computation affected by a CMS in terms of the concept of prime implicants. ..."
Abstract

Cited by 334 (11 self)
 Add to MetaCart
In this paper we (1) define the concept of a Clause Managetnent System (CMS) — a generaizatiou of de Kleer’s ATMS, (2) motivate such systems in terms of efficiency of search and abductive reasoning, and (3) characterize the computation affected by a CMS in terms of the concept of prime implicants
Abduction And The Limits Of Formalization
"... Paul Bourgine's text "Models of Abduction " is undoubtfully ingenious, bringing forth a theory of abduction whose purpose is to check its adequacy for the whole field of cognitive science. I will not face Bourgine's text directly and I have sincerely to confess that such an enter ..."
Abstract
 Add to MetaCart
Paul Bourgine's text "Models of Abduction " is undoubtfully ingenious, bringing forth a theory of abduction whose purpose is to check its adequacy for the whole field of cognitive science. I will not face Bourgine's text directly and I have sincerely to confess
Approaches to Abductive Reasoning  An Overview
 ARTIFICIAL INTELLIGENCE REVIEW
, 1993
"... Abduction is a form of nonmonotonic reasoning that has gained increasing interest in the last few years. The key idea behind it can be represented by the following inference rule
$$O = \mathop C\limits_  N = \mathop P\limits_^  O  \mathop C\limits_^  .$$
i.e., from an occurrence of ohgr an ..."
Abstract

Cited by 44 (1 self)
 Add to MetaCart
Abduction is a form of nonmonotonic reasoning that has gained increasing interest in the last few years. The key idea behind it can be represented by the following inference rule
$$O = \mathop C\limits_  N = \mathop P\limits_^  O  \mathop C\limits_^  .$$
i.e., from an occurrence of ohgr
Logic Programming, Abduction and Probability
 New Generation Computing
, 1992
"... Probabilistic Horn abduction is a simple framework to combine probabilistic and logical reasoning into a coherent practical framework. The numbers can be consistently interpreted probabilistically, and all of the rules can be interpreted logically. The relationship between probabilistic Horn abducti ..."
Abstract

Cited by 30 (3 self)
 Add to MetaCart
abduction and logic programming is at two levels. At the first level probabilistic Horn abduction is an extension of pure Prolog, that is useful for diagnosis and other evidential reasoning tasks. At another level, current logic programming implementation techniques can be used to efficiently implement
On the Practicality of Abductive Validation
 In ECAI '96
, 1995
"... . An abductive framework is described for validating theories using a library of known or desired behaviour. Abduction is known to be NPhard which suggests that this framework is impractical for anything other than small theories. The computational limits of the framework is therefore explored. We ..."
Abstract

Cited by 32 (28 self)
 Add to MetaCart
. An abductive framework is described for validating theories using a library of known or desired behaviour. Abduction is known to be NPhard which suggests that this framework is impractical for anything other than small theories. The computational limits of the framework is therefore explored. We
Evaluation of evidential combination operators
 In Proceedings of ISIPTA ’13
, 2013
"... Abstract We present an experiment for evaluating precise and imprecise evidential combination operators. The experiment design is based on the assumption that only limited statistical information is available in the form of multinomial observations. We evaluate three different evidential combinatio ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract We present an experiment for evaluating precise and imprecise evidential combination operators. The experiment design is based on the assumption that only limited statistical information is available in the form of multinomial observations. We evaluate three different evidential
Continuous belief functions for evidential reasoning
 In National Conference on Artificial Intelligence (AAAI84
, 1984
"... Some recently developed expert systems have used the ShaferDempster theory for reasoning from multiple bodies of evidence. Many expertsystem applications require belief to be specified over arbitrary ranges of scalar variables, such as time, distance or sensor measurements. The utility of the exis ..."
Abstract

Cited by 23 (0 self)
 Add to MetaCart
of the existing ShaferDempster theory is limited by the lack of an effective approach for dealing with beliefs about continuous variables. This paper introduces a uew representation of belief for continuous variables that provides both a conceptual framework and a computationally tractable implementation within
Logical argumentation, abduction and Bayesian decision theory: a Bayesian approach to logical arguments and its application to legal evidential reasoning
 Cardozo Law Review
"... There are good normative arguments for using Bayesian decision theory for deciding what to do. However, there are also good arguments for using logic, where we want have a formal semantics for a language and use the structure of logical argumentation with logical variables to represent multiple indi ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
individuals (things). This paper shows how decision theory and logical argumentation can be combined into a coherent framework. The Independent Choice Logic can be viewed as firstorder representation of belief networks with conditional probability tables represented as firstorder rules, or as a abductive
Generating Tests using Abduction
 In Proc. of KR 94
, 1994
"... Suppose we are given a theory of system behavior and a set of candidate hypotheses. Our concern is with generating tests which will discriminate these hypotheses in some fashion. We logically characterize test generation as abductive reasoning. Aside from defining the theoretical principles un ..."
Abstract

Cited by 16 (3 self)
 Add to MetaCart
with complexity results on the generation of abductive explanations. By syntactically restricting the description of our theory of system behavior or by limiting the completeness of our abductive reasoning, we are able to gain insight into tractable test generation problems. 1 INTRODUCTION Diagnostic
Results 1  10
of
312