Multi-adjoint relation equations: definition, properties and solutions using concept lattices
From MaRDI portal
(Redirected from Publication:497930)
Recommendations
- Using concept lattice theory to obtain the set of solutions of multi-adjoint relation equations
- Solving general fuzzy relation equations using property-oriented concept lattices
- Solving systems of fuzzy relation equations by fuzzy property-oriented concepts
- Multi-adjoint property-oriented and object-oriented concept lattices
- Dual multi-adjoint concept lattices
Cites work
- scientific article; zbMATH DE number 45267 (Why is no real title available?)
- scientific article; zbMATH DE number 1884400 (Why is no real title available?)
- A comparative study of adjoint triples
- A comparative study of fuzzy rough sets
- A new algebraic tool for automatic theorem provers. Multisemilattice: A structure to improve the efficiency of provers in temporal logics
- Analytical solution methods for fuzzy relational equations
- Concept Equations
- Concept lattices and order in fuzzy logic
- Concept lattices of fuzzy contexts: formal concept analysis vs. rough set theory
- Formal concept analysis via multi-adjoint concept lattices
- Fuzzy function as an approximate solution to a system of fuzzy relation equations
- Fuzzy logic programming via multilattices
- Fuzzy relation equations in semilinear spaces
- Lattices of Fixed Points of Fuzzy Galois Connections
- Lindig’s Algorithm for Concept Lattices over Graded Attributes
- Multi-adjoint property-oriented and object-oriented concept lattices
- Multi-adjoint t-concept lattices
- Non-dual fuzzy connections
- On fuzzy relational equations and the covering problem
- Partially ordered sets and the Schreier refinement theorem, II. Theory of multistructures
- Resolution of composite fuzzy relation equations
- Resolution of fuzzy relational equations -- method, algorithm and software with applications
- Rough sets
- Semantics of implication operators and fuzzy relational products
- Solution to the covering problem
- Solving systems of fuzzy relation equations by fuzzy property-oriented concepts
- Sup-t-norm and inf-residuum are a single type of relational equations
- Sup-t-norm and inf-residuum are one type of relational product: unifying framework and consequences
- System of fuzzy relation equations with inf-\(\rightarrow \) composition: Complete set of solutions
- The concept of a linguistic variable and its application to approximate reasoning. I
- Theory and Applications of Relational Structures as Knowledge Instruments
Cited in
(38)- Solving general fuzzy relation equations using property-oriented concept lattices
- Attribute reduction in multi-adjoint concept lattices
- Approximating fuzzy relation equations through concept lattices
- Right adjoint algebras versus operator left residuated posets
- Multi-adjoint algebras versus non-commutative residuated structures
- On the solvability of bipolar max-product fuzzy relation equations with the standard negation
- Multi-adjoint lattices from adjoint triples with involutive negation
- A computational procedure for variable selection preserving different initial conditions
- Notes on ``Solution sets of inf-\(\alpha_{\mathcal{T}}\) fuzzy relational equations on complete Brouwerian lattices and ``Fuzzy relational equations on complete Brouwerian lattices
- Powerset operators induced by fuzzy relations as a basis for fuzzification of various mathematical structures
- Adjoint Triples and Residuated Aggregators
- GENERALIZED RESIDUATED LATTICES BASED F-TRANSFORM
- Impact Zadeh's theory to algebraic structures. Multi-adjoint algebras
- Generating isotone Galois connections on an unstructured codomain
- The use of two relations in \( L\)-fuzzy contexts
- Minimal solutions of fuzzy relation equations via maximal independent elements
- Bipolar max-product fuzzy relation equations with the product negation
- On the impact of sup‐compositions in the resolution of multi‐adjoint relation equations
- Optimization under fuzzy max-t-norm relation constraints
- Rough sets based on Galois connections
- Characterizing reducts in multi-adjoint concept lattices
- Using concept lattice theory to obtain the set of solutions of multi-adjoint relation equations
- On the solvability of bipolar max-product fuzzy relation equations with the product negation
- Implication operators generating pairs of weak negations and their algebraic structure
- Adjoint negations, more than residuated negations
- A logical characterization of multi-adjoint algebras
- Multi-adjoint lattice logic and truth-stressing hedges
- On the Exchange Principle in Adjoint Triples
- Multi-adjoint property-oriented and object-oriented concept lattices
- Minimal solutions of general fuzzy relation equations on linear carriers. An algebraic characterization
- Solutions of matrix equations with weak fuzzy equivalence relations
- On the definition of suitable orderings to generate adjunctions over an unstructured codomain
- Algebraic structure and characterization of adjoint triples
- Multi-adjoint concept lattices with heterogeneous conjunctors and hedges.
- Minimal solutions of generalized fuzzy relational equations: clarifications and corrections towards a more flexible setting
- Generalized quantifiers in formal concept analysis
- Minimal solutions of fuzzy relation equations with general operators on the unit interval
- On homogeneousL-bonds and heterogeneousL-bonds
This page was built for publication: Multi-adjoint relation equations: definition, properties and solutions using concept lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q497930)
