Decrement Operators in Belief Change

While research on iterated revision is predominant in the field of iterated belief change, the class of iterated contraction operators received more attention in recent years. In this article, we examine a non-prioritized generalisation of iterated contraction. In particular, the class of weak decrement operators is introduced, which are operators that by multiple steps achieve the same as a contraction. Inspired by Darwiche and Pearl's work on iterated revision the subclass of decrement operators is defined. For both, decrement and weak decrement operators, postulates are presented and for each of them a representation theorem in the framework of total preorders is given. Furthermore, we present two sub-types of decrement operators

Diseño de un algoritmo para la revisión de creencias entre formas conjuntivas

"El problema a tratar en este trabajo de tesis es proponer un algoritmo para la revisión y actualización de una base de conocimiento usando lógica proposicional. Una base de conocimiento almacena conocimiento en una forma legible para la computadora, usualmente con el fin de obtener razonamiento deductivo automático aplicado a ellas, las cuales contienen una serie de datos en forma de reglas que describen el conocimiento de manera lógicamente consistente usando operadores lógicos"