Publicaciones

Secure and Optimal Base Contraction in Graded {\L}ukasiewicz Logics

Tipo de Publicación:

Conference Paper

Autores:

Pere Pardo; Pilar Dellunde; Lluís Godo

Origen:

Artificial Intelligence Research and Development. Proceedings of the 12th International Conference of the Catalan Association fo Artificial Intelligence, IOS Press, Volumen202, Cardona, Catalonia, Spain, p.265-274 (2009)

ISBN:

978-1-60750-061-2

Palabras clave:

Base Contraction; T-norm fuzzy logic; Partial meet

Resumen:

The operation of base contraction was characterized using remainder sets for several logics. The case of {\L}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.

Proyectos: 
AT
LOCOMOTION
»