403 research outputs found
Relation-based Galois connections: towards the residual of a relation
Inma P. Cabrera, Pablo Cordero, Manuel Ojeda-Aciego, Relation-based Galois connections: towards the residual of a relation, CMMSE 2017: Proceedings of the 17th International Conference on Mathematical Methods in Science and Engineering ( ISBN: 978-84-617-8694-7) , pp. 469--475We explore a suitable generalization of the notion of Galois connection in which their components are binary relations. Many different approaches are possible depending both on the (pre-)order relation between subsets in the underlying powerdomain and the chosen type of relational composition.Universidad de Málaga. Campus de Excelencia Internacional Andalucía Tech
Detrital zircon and apatite (U‐Th)/He geochronology of intercalated baked sediments: a new approach to dating young basalt flows
On the notion of fuzzy adjunctions between fuzzy orders
Las adjunciones (también denominadas conexiones de Galois isótonas) entre dos estructuras matemáticas proporcionan una manera de conectar ambas teorías que permite compartir las ventajas de ambas. Hay varios resultados en la literatura previa acerca de las condiciones necesarias y suficientes para la existencia de conexiones de Galois entre dos conjuntos parcialmente ordenados. En otros trabajos anteriores, los autores han estudiado la existencia y construcción del adjunto por la derecha de una aplicación dada entre conjuntos preordenados o dotados de un orden difuso, entendido éste como una relación binaria difusa satisfaciendo reflexividad, transitividad y antisimetría. Se entiende el término adjunción difusa como una pareja de aplicaciones entre dos conjuntos crisp que están dotados de órdenes difusos para las culaes se verifica la condición ρ(a,g(b)) = ρ(f(a),b). Esta definición no está suficientemente justificada en un contexto difuso puesto que las aplicaciones que se consideran se dan entre conjuntos clásicos. En este trabajo se explica la forma en la que la citada definición está relacionada con las funciones difusas, mostrando así que la definición sí es adecuada en ambiente difuso también. La extensión natural de la noción difusa de adjunción contempla dos posibilidades, según si uno considera igualdades difusas o equivalencias difusas asociadas al orden difuso o no.Universidad de Málaga. Campus de Excelencia Internacional Andalucía Tech
Preface Volume 66, Issue 5
AbstractThis part of the volume contains the papers accepted for presentation at the workshop on Unification in Non-Classical Logics (UNCL), co-located with ICALP 2002, which took place on July 12, 2002 in M\'alaga, Spain.The workshop was concerned with one of the most promising areas of research on non-classical logics and its applications. Unification in non-classical logics, with various approaches to handling generalised terms, has drawn more and more attention in recent years. So far, most popular lines of research include fuzzy unification of (conventional) databases and the use of fuzzy concepts in information retrieval.This workshop was conceived as a forum for the exchange of ideas relevant for the concept of unification in non-classical logics, including, but not limited to, the topics of:
•Unification in multiple-valued and fuzzy logic programming.•Unification based on similarities and fuzzy equivalence relations.•Categorical unification.•Practical use of non-classical unification, e.g. in expert systems and information retrieval.The program committee selected six papers after a reviewing process in which each submitted paper received at least two reviews. Considerable effort was devoted for the evaluation of the submissions and to providing the authors with helpful feedback. The criteria for selection were originality, quality, and relevance to the topic of the workshop.Alsinet et al reviewed and compared two models which extend first order possibilistic logic in order to enable fuzzy unification. The extension considers mainly fuzzy constants, and in form of restrictions on existential quantifiers.Banerjee and Bujosa presented a non-classical interpretion of classical unification in terms of geometrical constructions over a suitable R-module M. The main result is that unification of two terms can be seen as the intersection of their corresponding affine varieties on M. This paves the way of using methods from computer algebra in the field of unification.In Eklund et al, substitutions and unifiers appear as constructs in Kleisli categories related to particular composed powerset term monads. It is shown that an often used similarity-based approach to fuzzy unification is compatible with the categorical approach, and can be adequately extended.Kutsia presented a unification procedure for a theory with individual and sequence variables, free fixed and flexible arity function symbols and patterns. These theories have been used in different contexts such as databases, rewriting, programming languages, or theorem proving.Medina et al introduced a formal model for similarity-based fuzzy unification in multi-adjoint logic programs. On this computational model, a similarity-based unification approach which provides a semantic framework for logic programming with different notions of similarity was constructed.Virtanen introduced unification in similarity-based logic programming. One of the crucial points is the definition of similarity degrees between sets, giving rise to [lambda]-interpretations. The selection of so called most significant terms again is one of the cornerstones of the paper.We would like to thank all those who submitted papers for consideration, the authors of accepted papers for their interesting discussions during the workshop, the additional referees for their careful work, and Inma Fortes from the local organising committee for her assistance
Using the Chu Construction for generalizing formal concept analysis
L. Antoni, I. P. Cabrera, S. Krajči, O. Krídlo, and M. Ojeda-Aciego. Using the Chu construction for generalizing formal concept analysis. In CLA 2015, pp. 147–158, Blaise Pascal University, LIMOS laboratory, Clermont-Ferrand, 2015El objetivo de este artículo es mostrar la conexión entre generalizaciones de Análisis de Conceptos Formales y la construcción de Chu sobre la categoría ChuCors de contextos formales y correspondencias de Chu. Todas las propiedades categóricas necesarias para la comprensión de los resultados de este trabajo como producto categórico, producto tensorial o propiedades de su bifuntor se presentan y demuestran. Finalmente, la generalización de Análisis de Conceptos Formales de segundo orden se representa por una categoría construida en términos de la Construcción de Chu
Relational Galois connections between transitive fuzzy digraphs
Fuzzy-directed graphs are often chosen as the data structure to model and implement solutions to several problems in the applied sciences. Galois connections have also shown to be useful both in theoretical and in practical problems. In this paper, the notion of relational Galois connection is extended to be applied between transitive fuzzy directed graphs. In this framework, the components of the connection are crisp relations satisfying certain reasonable properties given in terms of the so-called full powering
Formation of Box Canyon, Idaho, by megaflood: implications for seepage erosion on Earth and Mars
Amphitheater- headed canyons have been used as diagnostic indicators of erosion by groundwater seepage, which has important implications for landscape evolution on Earth and astrobiology on Mars. Of perhaps any canyon studied, Box Canyon, Idaho, most strongly meets the proposed morphologic criteria for groundwater sapping because it is incised into a basaltic plain with no drainage network upstream, and approximately 10 cubic meters per second of seepage emanates from its vertical headwall. However, sediment transport constraints, ^4He and ^14C dates, plunge pools, and scoured rock indicate that a megaflood (greater than 220 cubic meters per second) carved the canyon about 45,000 years ago. These results add to a growing recognition of Quaternary catastrophic flooding in the American northwest, and may imply that similar features on Mars also formed by floods rather than seepage erosion
Fuzzy Adjunctions revisited
En este trabajo se intenta obtener la noción de adjunción más débil entre estructuras difusas. Este trabajo continúa la línea de investigación en el estudio y construcción d adjunciones que han realizado los autores en contribuciones anteriores. Nos centraremos ahora en la noción de relación difusa que es en cierto sentido interpretable como una función difusa. Existen varios trabajos en la literatura relacionados con este tema. Entre todos ellos, trabajaremos con un enfoque próximo al de Ciric et al cuando definen las denominadas funciones parciales difusas. El nuevo concepto estudiado es el de relaciones difusas funcionales y la construcción de adjunciones entre ellas.Universidad de Málaga. Campus de Excelencia Internacional Andalucía Tech
On the existence of right adjoints for surjective mappings between fuzzy structures0
En este trabajo los autores continúan su estudio de la caracterización de la existencia de adjunciones (conexiones de Galois isótonas) cuyo codominio no está dotado de estructura en principio. En este artículo se considera el caso difuso en el que se tiene un orden difuso R definido en un conjunto A y una aplicación sobreyectiva f:A-> B compatible respecto de dos relaciones de similaridad definidas en el dominio A y en el condominio B, respectivamente. Concretamente, el problema es encontrar un orden difuso S en B y una aplicación g:B-> A compatible también con las correspondientes similaridades definidas en A y en B, de tal forma que el par (f,g) constituya un adjunción
- …