| Title | Secure and Optimal Base Contraction in Graded {Ł}ukasiewicz Logics |
| Publication Type | Conference Paper |
| Year of Publication | 2009 |
| Authors | Pardo P, Dellunde P, Godo L |
| Editor | M. Sandri S-MS, Cortés U. |
| Conference Name | Artificial Intelligence Research and Development. Proceedings of the 12th International Conference of the Catalan Association fo Artificial Intelligence |
| Volume | 202 |
| Publisher | IOS Press |
| Conference Location | Cardona, Catalonia, Spain |
| Pagination | 265-274 |
| Date Published | 21/10/2009 |
| ISBN Number | 978-1-60750-061-2 |
| Keywords | Base Contraction, Partial meet, T-norm fuzzy logic |
| Abstract | The operation of base contraction was characterized using remainder sets for several logics. The case of {Ł}ukasiewicz logics with truth-constants requires to switch from remainders to maximal consistent subsets. We characterize first contraction operators that establish a security-threshold, and use these to define optimal operators, which are provably sound w.r.t. axioms. Finally, these are shown to collapse to the former case for any finite base. |
