An independent broadcast on a connected graph $G$is a function $f:V(G)to mathbb{N}_0$such that, for every vertex $x$ of $G$, the value $f(x)$ is at most the eccentricity of $x$ in $G$,and $f(x)>0$ implies that $f(y)=0$ for every vertex $y$ of $G$ within distance at most $f(x)$ from $x$.The broadcast independence number $alpha_b(G)$ of $G$is the largest weight $sumlimits_{xin V(G)}f(x)$of an ind...

Independence – the study of what is relevant to a given problem of reasoning – is an important AI topic. In this paper, we investigate several notions of conditional independence in propositional logic: Darwiche and Pearl’s conditional independence, and two more restricted forms of it, called strong conditional independence and perfect conditional independence. Many characterizations and proper...

adjudication independence can be studied in two areas namely independency of judicial power and independency of judge. the first one is based on the separation of powers theory but judge independence means its freedom from parties and their attorneys and its independence in intern of judiciary power. this sense of independence has two objectives: 1) judge's freedom in applying the law to f...

A non-empty set X of a carrier A of an algebra A is called Q-independent if the equality of two term functions f and g of the algebra A on any finite system of elements a1, a2, . . . , an of X implies f(p(a1), p(a2), . . . , p(an)) = g(p(a1), p(a2), . . . , p(an)) for any mapping p ∈ Q. An algebra B is a retract of A if B is the image of a retraction (i.e. of an idempotent endomorphism of B). W...