1997
DOI: 10.1007/bfb0035621
|View full text |Cite
|
Sign up to set email alerts
|

Assumption-based modeling using ABEL

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
5
0

Year Published

1999
1999
2012
2012

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 13 publications
(5 citation statements)
references
References 10 publications
0
5
0
Order By: Relevance
“…It has been shown that Ψ becomes an idempotent, commutative semigroup under the operation ⊕ as defined by the right-hand side of (3.10) (see [17]). 2 Furthermore, we define the label of an allocation of support qs from a Lindenbaum algebra…”
Section: Algebraic Structure Of Assumption-based Reasoningmentioning
confidence: 99%
See 1 more Smart Citation
“…It has been shown that Ψ becomes an idempotent, commutative semigroup under the operation ⊕ as defined by the right-hand side of (3.10) (see [17]). 2 Furthermore, we define the label of an allocation of support qs from a Lindenbaum algebra…”
Section: Algebraic Structure Of Assumption-based Reasoningmentioning
confidence: 99%
“…The techniques presented in this paper have been successfully implemented in ABEL 1 , a logic-based language for assumption-based reasoning under uncertainty [2,3]. The inference mechanism of ABEL is based on a combination of classical deduction techniques such as resolution and the ideas of decomposition and local propagation.…”
Section: Introductionmentioning
confidence: 99%
“…One can attribute the reasons for this surge to (1) the ease with which belief functions map uncertainties present in the real world, (2) the theoretical developments in local computations for propagating belief functions in a network (see. e.g., Shafer 1986, 1990), and (3) availability of friendly software incorporating the local computations such as 'Auditor's Assistant' by Shafer et al (1988), 'Pulcinella' by Saffiotti and Umkehrer (1991), and "ABEL' by Anrig et al (1997).…”
Section: Introductionmentioning
confidence: 99%
“…Consider an OS populated by software agents, whose behaviour is regulated by norms in which some temporal logic is employed. For the sake of simplicity and without loss of generality, in this chapter, we need not relate the discussion that ensues to a specific temporal language, since any temporal logic may be used 11 . We can take an abstract view of the norms and regard them as sentences of sequent calculus [132], i.e.…”
Section: The Reasoning Problemmentioning
confidence: 99%
“…Later, in [210] and [62] respectively, Reiter and de Kleer proposed some extensions and generalizations of the ATMS that are concerned mainly with the way the system is able to manipulate clauses more general than Horn clauses. Based on the above ideas of TMS and ATMS, Kohals et al in [144,11] proposed an extension of the propositional assumption-based model with probabilities, the so called Assumption-based Evidential Language (ABEL). Consequently, hypotheses were, also, enhanced with notions such as support, quasi-support, plausibility and doubt.…”
Section: Static Assumption-based Reasoningmentioning
confidence: 99%