Un Criterio Suficiente de Estabilidad en Plasmas Magnetizados Axisimétricos Cuasi-estáticos

In this paper we develope a sufficient condition of stability, applicable to quasi- static, ideally conductive, inviscid plasmas, frozen to general magnetic fields. We develop the criterion in spherical coordinates using a principle of hydromagnetic energy, and we look for the regions that can remain in equilibrium in each particular magnetic configuration and against the development of the proposed perturbations. The magnetic configurations studied are those that can consistently support a flow in the dynamic case. The analysis we perform is local, that is, by finding the eigenvalues of a self  adjoint matrix that relates the components of the perturbation with the external magnetic field, we can determine the regions in which a perturbation can be developed, and for this reason the criterion allows to decide if a given region is unstable but not if that region it is stable.En este artículo desarrollamos una condición suficiente de estabilidad, aplicable a plasmas cuasi-estáticos, idealmente conductores, sin viscosidad, congelados a campos magnéticos generales. Desarrollamos el criterio en coordenadas esféricas utilizando un principio de energía hidromagnético, y buscamos las regiones que pueden permanecer en equilibrio en cada configuración magnética particular y frente al desarrollo de perturbaciones lineales bidimensionales. Las configuraciones magnéticas estudiadas son las que autoconsistentemente pueden sustentar un flujo en el caso dinámico. El análisis que realizamos es local, es decir, hallando los autovalores de una matriz autoadjunta que relaciona las componentes de la perturbación con el campo magnético externo podemos determinar las regiones en las cuales una perturbación puede desarrollarse, y por esta razón el criterio permite decidir si una dada región es inestable pero no si esa región es estable frente a esa perturbación

Handling inconsistency on ontologies through a generalized dynamic argumentation framework

In this article we present a generalized dynamic argumentation framework that handles arguments expressed in an abstract language assumed to be some first order logic fragment. Once the formalism is presented, we propose a reification to the description logic ALC with the intention to handle ontology debugging. In this sense, since argumentation frameworks reason over graphs that relate arguments through attack, our methodology is proposed to bridge ontological inconsistency sources to attack relations in argumentation. Finally, an argumentation semantics is proposed as a consistency restoration tool to cope with the ontology debugging.Workshop de Agentes y Sistemas Inteligentes (WASI)Red de Universidades con Carreras en Informática (RedUNCI

A preliminary investigation on a revision-based approach to the status of warrant

In this article we are presenting a new perspective on the matter of belief revision by its relation to argumentation systems. Our approach is based on the argumentative formalism Defeasible Logic Programming, and therefore we propose a revision of a defeasible logic program by an argument. The revision operators here introduced are de ned as prioritized, since they ensure warrant of the conclusion of the argument being added to the program following a particular minimal change principle. To achieve this, we give two different approaches: one regarding arguments in the classical sense, whereas the other considers the revision by arguments that also include strict rules and facts. Finally, a brief discussion about the relation between our approach and the basic theory of belief revision is exposed, along with a description of other possible minimal change principles.Red de Universidades con Carreras en Informática (RedUNCI

Handling inconsistency on ontologies through a generalized dynamic argumentation framework

In this article we present a generalized dynamic argumentation framework that handles arguments expressed in an abstract language assumed to be some first order logic fragment. Once the formalism is presented, we propose a reification to the description logic ALC with the intention to handle ontology debugging. In this sense, since argumentation frameworks reason over graphs that relate arguments through attack, our methodology is proposed to bridge ontological inconsistency sources to attack relations in argumentation. Finally, an argumentation semantics is proposed as a consistency restoration tool to cope with the ontology debugging.Workshop de Agentes y Sistemas Inteligentes (WASI)Red de Universidades con Carreras en Informática (RedUNCI

A preliminary investigation on a revision-based approach to the status of warrant

In this article we are presenting a new perspective on the matter of belief revision by its relation to argumentation systems. Our approach is based on the argumentative formalism Defeasible Logic Programming, and therefore we propose a revision of a defeasible logic program by an argument. The revision operators here introduced are de ned as prioritized, since they ensure warrant of the conclusion of the argument being added to the program following a particular minimal change principle. To achieve this, we give two different approaches: one regarding arguments in the classical sense, whereas the other considers the revision by arguments that also include strict rules and facts. Finally, a brief discussion about the relation between our approach and the basic theory of belief revision is exposed, along with a description of other possible minimal change principles.Red de Universidades con Carreras en Informática (RedUNCI