Boolean structure of triangular norms.

Seyed Abbas Ziaie; S. Ray; Mashallah Mashinchi; Rasool Kamran

Displaying similar documents to “Boolean structure of triangular norms.”

Representation of a Boolean algebra by its triangular norms.

Suryansu Ray (1997)

Mathware and Soft Computing

Similarity:

Given a complete and atomic Boolean algebra B, there exists a family tau of triangular norms on B such that, under the partial ordering of triangular norms, tau is a Boolean algebra isomorphic to B, where gamma is the set of all atoms in B. In other words, as we have shown in this note, every complete and atomic Boolean algebra can be represented by its own triangular norms. What we have not shown in this paper is our belief that tau is not unique for B and that, for such a representation,...

Knowledge discovery in data using formal concept analysis and random projections

Cherukuri Aswani Kumar (2011)

International Journal of Applied Mathematics and Computer Science

Similarity:

In this paper our objective is to propose a random projections based formal concept analysis for knowledge discovery in data. We demonstrate the implementation of the proposed method on two real world healthcare datasets. Formal Concept Analysis (FCA) is a mathematical framework that offers a conceptual knowledge representation through hierarchical conceptual structures called concept lattices. However, during the design of a concept lattice, complexity plays a major role.

Non-reflexive pentagon subspace lattices

M. Lambrou, W. Longstaff (1997)

Studia Mathematica

Similarity:

Compactness of support of solutions for some classes of nonlinear elliptic and parabolic systems.

M. Bouchekif (1994)

Publicacions Matemàtiques

Similarity:

In this paper, we obtain some existence theorems of nonnegative solutions with compact support for homogeneous Dirichlet elliptic problems; we also extend these results to parabolis systems. Supersolution and comparison principles are our main ingredients.

Evolutionary Design of Digital Circuits Using Improved Multi Expression Programming (IMEP).

F. Z. Hadjam, C. Moraga, M. K. Rahmouni (2007)

Mathware and Soft Computing

Similarity:

Basic theory of the analytic hierarchy process: How to make a Decision.

THOMAS L. SAATY (1999)

Revista de la Real Academia de Ciencias Exactas Físicas y Naturales

Similarity:

On the symmetric difference of sets as a group operation

Henry Helson (1948)

Colloquium Mathematicae

Similarity:

New machine learning methods for prediction of protein secondary structures

Jacek Błażewicz, Piotr Łukasik, Szymon Wilk (2007)

Control and Cybernetics

Similarity:

CAPS in Z(2,n)

Kurz, Sascha (2009)

Serdica Journal of Computing

Similarity:

We consider point sets in (Z^2,n) where no three points are on a line – also called caps or arcs. For the determination of caps with maximum cardinality and complete caps with minimum cardinality we provide integer linear programming formulations and identify some values for small n.