Juan Perez

We propose an extension of answer sets, that we call safe beliefs, that can be used to study several properties and notions of answer sets and logic programming from a more general point of view. Our definition, based on intuitionistic logic and following ideas from D. Pearce [Stable inference as intuitionistic validity, Logic Programming 38 79–91], also provides a general approach to define several semantics based on different logics or inference systems. We prove that, in particular, intuitionistic logic can be replaced with any other proper intermediate logic without modifying the resulting semantics. We also show that the answer set semantics satisfies an important property, the “extension by definition”, that can be used to construct program translations. As a result we are able to provide a polynomial translation from propositional theories into the class of disjunctive programs

El objeto de este artículo es doble. Por una parte, examina el uso que Vives hace de la lengua y del lenguaje, y, por otra parte, indica sus aportaciones al campo de la traducción e interpretación. La diversidad temática presente en su obra hace que su persona sea un punto de referencia para diferentes campos científicos, entre ellos la Filología. Para Vives, tanto el acercamiento filológico, como el aprendizaje de la lengua no sólo deben tener en cuenta la lengua desde un punto teórico, sino también sociocultural. Su especial interés por las lenguas le llevó a realizar un considerable esfuerzo filológico haciendo lecturas e introducciones de varios textos clásicos latinos y también griegos, y transmitiendo su opinión acerca de la forma de realizar versiones o interpretaciones

We propose an extension of answer sets, that we call safe beliefs, that can be used to study several properties and notions of answer sets and logic programming from a more general point of view. Our definition, based on intuitionistic logic and following ideas from D. Pearce [Stable inference as intuitionistic validity, Logic Programming 38 79–91], also provides a general approach to define several semantics based on different logics or inference systems. We prove that, in particular, intuitionistic logic can be replaced with any other proper intermediate logic without modifying the resulting semantics. We also show that the answer set semantics satisfies an important property, the “extension by definition”, that can be used to construct program translations. As a result we are able to provide a polynomial translation from propositional theories into the class of disjunctive programs.