<?xml version="1.0" encoding="UTF-8"?>
<XML><RECORDS>
<RECORD>
	<REFERENCE_TYPE>3</REFERENCE_TYPE>
	<AUTHORS>
		<AUTHOR>Pere Pardo</AUTHOR>
		<AUTHOR>Pilar Dellunde</AUTHOR>
		<AUTHOR>LluĂ­s Godo</AUTHOR>
	</AUTHORS>
	<YEAR>2009</YEAR>
	<TITLE>Secure and Optimal Base Contraction in Graded {\L}ukasiewicz Logics</TITLE>
	<SECONDARY_AUTHORS>
		<SECONDARY_AUTHOR>S. Sandri, M. Sánchez-Marrč and U. Cortés</SECONDARY_AUTHOR>
	</SECONDARY_AUTHORS>
	<SECONDARY_TITLE>Artificial Intelligence Research and Development. Proceedings of the 12th International Conference of the Catalan Association fo Artificial Intelligence</SECONDARY_TITLE>
	<PLACE_PUBLISHED>Cardona, Catalonia, Spain</PLACE_PUBLISHED>
	<PUBLISHER>IOS Press</PUBLISHER>
	<VOLUME>202</VOLUME>
	<PAGES>265-274</PAGES>
	<TERTIARY_TITLE>Frontiers in Aritficial Intelligence and Applications</TERTIARY_TITLE>
	<DATE>21/10/2009</DATE>
	<ISBN>978-1-60750-061-2</ISBN>
	<KEYWORDS>
		<KEYWORD>Base</KEYWORD>
		<KEYWORD>Contraction,</KEYWORD>
		<KEYWORD>T-norm</KEYWORD>
		<KEYWORD>fuzzy</KEYWORD>
		<KEYWORD>logic,</KEYWORD>
		<KEYWORD>Partial</KEYWORD>
		<KEYWORD>meet</KEYWORD>
	</KEYWORDS>
	<ABSTRACT>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.   </ABSTRACT>
</RECORD>
</RECORDS></XML>