Add to ORKGInternational audienceImplication bases in n-lattices are not formally defined. We clarify the different types of implications we need to reconstruct a concept n-lattice and show they can be derived from the same set of implications. We use this to identify a particular type of implication base in n-contexts. Finally, we provide an algorithm for computing implicational closures with n-dimensional bases
Closure system is a fundamental concept appearing in several areas such as databases, formal concept...
AbstractThis paper is motivated by a result of Metropolis and Rota on an algebraic characterization ...
Abstract. Closure system on a finite set is a unifying concept in logic pro-gramming, relational dat...
International audienceImplication bases in n-lattices are not formally defined. We clarify the diffe...
AbstractAlthough many notions familiar from topology and matroid theory make sense for arbitrary clo...
Abstract. We introduce the notion of n-fold implicative filters and n-fold implicative lattice impli...
International audienceIn this paper we consider k-meet-semidistributive lattices and we are interest...
International audienceIn this paper we consider k-meet-semidistributive lattices and we are interest...
International audienceIn this paper we consider k-meet-semidistributive lattices and we are interest...
We introduce the notion of n-fold implicative filters and n-fold implicative lattice implication alg...
Computation of the dependency basis is the fundamental step in solving the implication problem for M...
Each finite closure system, whence each finite lattice, can be described in terms of “implicational ...
Computation of the dependency basis is the fundamental step in solving the implication problem for M...
URL des Cahiers :http://mse-univ-paris1.fr/MSEFramCahier2005.htmCahiers de la Maison des Sciences Ec...
AbstractThis paper is motivated by a result of Metropolis and Rota on an algebraic characterization ...
Closure system is a fundamental concept appearing in several areas such as databases, formal concept...
AbstractThis paper is motivated by a result of Metropolis and Rota on an algebraic characterization ...
Abstract. Closure system on a finite set is a unifying concept in logic pro-gramming, relational dat...
International audienceImplication bases in n-lattices are not formally defined. We clarify the diffe...
AbstractAlthough many notions familiar from topology and matroid theory make sense for arbitrary clo...
Abstract. We introduce the notion of n-fold implicative filters and n-fold implicative lattice impli...
International audienceIn this paper we consider k-meet-semidistributive lattices and we are interest...
International audienceIn this paper we consider k-meet-semidistributive lattices and we are interest...
International audienceIn this paper we consider k-meet-semidistributive lattices and we are interest...
We introduce the notion of n-fold implicative filters and n-fold implicative lattice implication alg...
Computation of the dependency basis is the fundamental step in solving the implication problem for M...
Each finite closure system, whence each finite lattice, can be described in terms of “implicational ...
Computation of the dependency basis is the fundamental step in solving the implication problem for M...
URL des Cahiers :http://mse-univ-paris1.fr/MSEFramCahier2005.htmCahiers de la Maison des Sciences Ec...
AbstractThis paper is motivated by a result of Metropolis and Rota on an algebraic characterization ...
Closure system is a fundamental concept appearing in several areas such as databases, formal concept...
AbstractThis paper is motivated by a result of Metropolis and Rota on an algebraic characterization ...
Abstract. Closure system on a finite set is a unifying concept in logic pro-gramming, relational dat...