| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 390843 | Fuzzy Sets and Systems | 2009 | 10 Pages |
Abstract
This work studies the problem of solving a sup-T composite finite relation equation over a complete lattice L, where T is a conjunctor. A criterion for the equation to have a solution is given. An algorithm for finding the solution set of the equation is presented.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
