Efficient Algorithms on the Family Associated to an Implicational SystemReportar como inadecuado

Efficient Algorithms on the Family Associated to an Implicational System - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

1 L3I - Laboratoire Informatique, Image et Interaction 2 LIFL - Laboratoire d-Informatique Fondamentale de Lille

Abstract : An implication system IS on a finite set S is a set of rules called Σ -implications of the kind A → Σ B, with A,B ⊆ S. A subset X ⊆ S satisfies A → Σ B when -A ⊆ X implies B ⊆ X- holds, so ISs can be used to describe constraints on sets of elements, such as dependency or causality. ISs are formally closely linked to the well known notions of closure operators and Moore families. This paper focuses on their algorithmic aspects. A number of problems issued from an IS Σ e.g. is it minimal, is a given implication entailed by the system can be reduced to the computation of closures φ Σ X, where φ Σ is the closure operator associated to Σ . We propose a new approach to compute such closures, based on the characterization of the direct-optimal IS Σ do which has the following properties: \beginenumerate ıtemit is equivalent to Σ ıtemφ Σ doX thus φ Σ X can be computed by a single scanning of Σ do-implications ıtemit is of minimal size with respect to ISs satisfying 1. and 2. \endenumerate We give algorithms that compute Σ do, and from Σ do closures φ Σ X and the Moore family associated to φ Σ .

Keywords : lattice ordered set Moore family implicational system closure operator algorithm

Autor: Karell Bertet - Mirabelle Nebut -

Fuente: https://hal.archives-ouvertes.fr/


Documentos relacionados