• Aucun résultat trouvé

Clones of pivotally decomposable operations

N/A
N/A
Protected

Academic year: 2021

Partager "Clones of pivotally decomposable operations"

Copied!
20
0
0

Texte intégral

(1)

Clones of pivotally decomposable operations

Bruno Teheux

joint work with Miguel Couceiro

(2)

Motivation

Shannon decomposition of operations f : {0, 1}n→ {0, 1}: f (x) = xkf (x1k) + (1 − xk)f (x0k),

Median decomposition of polynomial operations over bounded DL: f (x) = med(xk, f (x1k), f (x0k)),

where

· xak is obtained from x by replacing its kth component by a.

· med(x , y , z) = (x ∧ y ) ∨ (x ∧ z) ∨ (y ∧ z)

(3)

Motivation

Shannon decomposition of operations f : {0, 1}n→ {0, 1}: f (x) = xkf (x1k) + (1 − xk)f (x0k),

Median decomposition of polynomial operations over bounded DL: f (x) = med(xk, f (x1k), f (x0k)),

where

· xak is obtained from x by replacing its kth component by a.

· med(x , y , z) = (x ∧ y ) ∨ (x ∧ z) ∨ (y ∧ z)

(4)

Motivation

Shannon decomposition of operations f : {0, 1}n→ {0, 1}: f (x) = xkf (x1k) + (1 − xk)f (x0k),

Median decomposition of polynomial operations over bounded DL: f (x) = med(xk, f (x1k), f (x0k)),

where

· xak is obtained from x by replacing its kth component by a.

· med(x , y , z) = (x ∧ y ) ∨ (x ∧ z) ∨ (y ∧ z)

(5)

Pivotal decomposition

A set and 0, 1 ∈ A

Let Π : A3 → A an operation

that satisfies the equation Π(x , y , y ) = y .

Such a Π is called apivotal operation. In this talk, all Π are pivotal.

Definition. An operation f : An→ A is Π-decomposableif f (x) = Π(xk, f (x1k), f (x0k))

(6)

Pivotal decomposition

A set and 0, 1 ∈ A

Let Π : A3 → A an operation that satisfies the equation Π(x , y , y ) = y .

Such a Π is called apivotal operation. In this talk, all Π are pivotal.

Definition. An operation f : An→ A is Π-decomposableif f (x) = Π(xk, f (x1k), f (x0k))

(7)

Examples

f (x) = Π(xk, f (x1k), f (x0k))

Shannon decomposition: Π(x , y , z) = xy + (1 − x )z Median decomposition: Π(x , y , z) = med(x , y , z) Benefits:

· uniformly isolate the marginal contribution of a factor

· repeated applications lead to normal form representations

(8)

ΛΠ= {f | f is Π-decomposable}

Problem.

Characterize those ΛΠ which are clones.

Π(x , 1, 0) = x (P) Π(Π(x , y , z), u, v ) = Π(x , Π(y , u, v ), Π(z, u, v )) (AD)

Proposition. If Π |= (AD), the following are equivalent

(i) ΛΠ is a clone

(9)

ΛΠ= {f | f is Π-decomposable}

Problem.

Characterize those ΛΠ which are clones.

Π(x , 1, 0) = x (P) Π(Π(x , y , z), u, v ) = Π(x , Π(y , u, v ), Π(z, u, v )) (AD)

Proposition. If Π |= (AD), the following are equivalent

(i) ΛΠ is a clone

(10)

ΛΠ= {f | f is Π-decomposable}

Problem.

Characterize those ΛΠ which are clones.

Π(x , 1, 0) = x (P) Π(Π(x , y , z), u, v ) = Π(x , Π(y , u, v ), Π(z, u, v )) (AD)

Proposition. If Π |= (AD), the following are equivalent

(i) ΛΠ is a clone

(11)

Clones of pivotally decomposable Boolean operations

(P) + (AD) =⇒ ΛΠ is a clone (?)

Example. For a Boolean clone C , the following are equivalent

(i) There is Π such that C = ΛΠ

(ii) C is the clone of (monotone) Boolean functions

(12)

Clones of pivotally decomposable Boolean operations

(P) + (AD) =⇒ ΛΠ is a clone (?)

Example. For a Boolean clone C , the following are equivalent

(i) There is Π such that C = ΛΠ

(ii) C is the clone of (monotone) Boolean functions

(13)

The case of Π-decomposable Π

Π(Π(1, 0, 1), 0, 1) = Π(1, Π(0, 0, 1), Π(1, 0, 1)) Π(Π(0, 0, 1), 0, 1) = Π(0, Π(0, 0, 1), Π(1, 0, 1))



(WAD)

Theorem. If Π ∈ ΛΠ and Π |= (WAD), then

(P) + (AD) ⇐⇒ ΛΠ is a clone,

(14)

The case of Π-decomposable Π

Π(Π(1, 0, 1), 0, 1) = Π(1, Π(0, 0, 1), Π(1, 0, 1)) Π(Π(0, 0, 1), 0, 1) = Π(0, Π(0, 0, 1), Π(1, 0, 1))



(WAD)

Theorem. If Π ∈ ΛΠ and Π |= (WAD), then

(P) + (AD) ⇐⇒ ΛΠ is a clone,

(15)

What happens if Π is not Π-decomposable?

We have seen that if ΛΠ is a Boolean clone then Π ∈ ΛΠ.

There are some Π such that ΛΠ is a clone but Π 6∈ ΛΠ.

(16)

What happens if Π is not Π-decomposable?

We have seen that if ΛΠ is a Boolean clone then Π ∈ ΛΠ.

There are some Π such that ΛΠ is a clone but Π 6∈ ΛΠ.

(17)

What happens if Π is not Π-decomposable?

We have seen that if ΛΠ is a Boolean clone then Π ∈ ΛΠ.

There are some Π such that ΛΠ is a clone but Π 6∈ ΛΠ.

(18)

Symmetry

Theorem. If Π ∈ ΛΠ and Π |= (P), then the following are

equivalent

(i) Π is symmetric

(19)

Summary

· If Π ∈ ΛΠ and Π |= (WAD), then

(P) + (AD) ⇐⇒ ΛΠ is a clone

· There is a clone ΛΠ such that Π 6∈ ΛΠ

Problems.

Find a characterization of those ΛΠ which are clones when Π 6∈ ΛΠ.

Structure of the family of decomposable classes of operations?

(20)

Summary

· If Π ∈ ΛΠ and Π |= (WAD), then

(P) + (AD) ⇐⇒ ΛΠ is a clone

· There is a clone ΛΠ such that Π 6∈ ΛΠ

Problems.

Find a characterization of those ΛΠ which are clones when Π 6∈ ΛΠ.

Structure of the family of decomposable classes of operations?

Références

Documents relatifs

Late fetal loss occurs in 100% to 0% of SCNT pregnancies, depending on the breed, nuclear transfer technique and donor cell genotype and lineage, with an average figure of about

The construction presented in the above section cannot be used to show that pclone(f) contains a family of strong partial clones of continuum cardinality if the matrix A contains

RÉSUMÉ La distribution des isoenzymes de la peroxydase et de la phosphatase acide a été étudiée dans le feuillage de 5 hybrides entre clones hétérozygotes.. Les

Next we prove that the bounded base of a finite constraint language is expressive enough to generate all functions in pPol(Γ), by defining an operator stronger than

In this preliminary study we establish sufficient conditions on a pivotal operation Π so that the corresponding class of Π-decomposable operations constitutes a clone, and discuss

L’on est bien sûr ici en terre inconnue, et des facteurs encore ignorés peuvent rendre le clonage d’un être humain nettement plus difficile (ou, au contraire, bien plus facile)

In partic- ular, we introduce the concepts of pivotal operation and of pivotally decomposable class, and we observe that, under certain conditions, pivotal decompositions lead to

lattice X are those lattice polynomial functions on X (see Example 2.6) which are reflexive (i.e., f (x,. Even though the class of lattice polynomial functions is