In this article, the contextual discounting of a belief function, a classical discounting generalization, is extended and its particular link with the canonical disjunctive decomposition is highlighted. A general family of correction mechanisms allowing one to weaken the information provided by a source is then introduced, as well as the dual of this family allowing one to strengthen a belief f...

Let m(n, k) be the maximum number of prime implicants that any k-CNF on n variables can have. We show that 3 n 3 ≤ m(n, 2) ≤ (1 + o(1))3n3 .

The incremental algorithm introduced in (Dale and Reiter, 1995) for producing distinguishing descriptions does not always generate a minimal description. In this paper, I show that when generalised to sets of individuals and disjunctive properties, this approach might generate unnecessarily long and ambiguous and/or epistemically redundant descriptions. I then present an alternative, constraint...

By a probabilistic construction, we find a bipartite graph having average degree d which can be expressed as a conjunctive normal form using C log d clauses. This contradicts research problem 1.33 of Jukna.

There have been several proposals for expressing planning problems with different forms of uncertainty, including nondeterminism and partial observability. In this paper we investigate two questions. First, the restriction to certain normal forms of operators, for example, restricting to operators in which nondeterministic choice must be outside conditional effects, or vice versa. We show that ...

This note discusses the properties of the asymmetric part of an outranking relation a la ELECTRE. Such relations have been used in the pseudodisjunctive version of ELECTRE TRI-B. We show that they have properties that are somewhat di erent from the ones of outranking relations. Indeed, contrary to outranking relations, they allow to have at the same time veto and bonus e ects. We suggest that t...