There is, I think, something ethereal about i —the square root of minus one. I remember first hearing about it at school. It seemed an odd beast at that time—an intruder hovering on the edge of reality.

Usually familiarity dulls this sense of the bizarre, but in the case of i it was the reverse: over the years the sense of its surreal nature intensified. It seemed that it was impossible to write mathematics that described the real world in …

I and i

Deposits of clastic carbonate-dominated (calciclastic) sedimentary slope systems in the rock record have been identified mostly as linearly-consistent carbonate apron deposits, even though most ancient clastic carbonate slope deposits fit the submarine fan systems better. Calciclastic submarine fans are consequently rarely described and are poorly understood. Subsequently, very little is known especially in mud-dominated calciclastic submarine fan systems. Presented in this study are a sedimentological core and petrographic characterisation of samples from eleven boreholes from the Lower Carboniferous of Bowland Basin (Northwest England) that reveals a >250 m thick calciturbidite complex deposited in a calciclastic submarine fan setting. Seven facies are recognised from core and thin section characterisation and are grouped into three carbonate turbidite sequences. They include: 1) Calciturbidites, comprising mostly of highto low-density, wavy-laminated bioclast-rich facies; 2) low-density densite mudstones which are characterised by planar laminated and unlaminated muddominated facies; and 3) Calcidebrites which are muddy or hyper-concentrated debrisflow deposits occurring as poorly-sorted, chaotic, mud-supported floatstones. These

Phd by thesis

Much previous work in artificial intelligence has neglected representing time in all its complexity. In particular, it has neglected continuous change and the indeterminacy of the future. To rectify this, I have developed a first-order temporal logic, in which it is possible to name and prove things about facts, events, plans, and world histories. In particular, the logic provides analyses of causality, continuous change in quantities, the persistence of facts (the frame problem), and the relationship between tasks and actions. It may be possible to implement a temporal-inference machine based on this logic, which keeps track of several “maps” of a time line, one per possible history.

A Temporal Logic for Reasoning about Processes and Plans.

Fuzzy Relational Systems: Foundations and Principles

E n los últimos años nos hemos acostumbrado a ver soluciones de automatización y control en que la utilización de técnicas de inteligencia artificial aporta beneficios contrastables. Varias marcas comercializan reguladores borrosos o combinados (por ejemplo, PID con control anticipativo borroso), o incluyen mecanismos de ajuste fino de parámetros basados en lógica borrosa. Ocasionalmente, las redes neuronales se han utilizado en el modelado y control de sistemas no lineales. La implantación masiva de sistemas de adquisición y registro de datos (en ocasiones impuestos por requisitos de trazabilidad y calidad) ha permitido un mejor conocimiento de las plantas, que se ha reflejado en las tareas de ingeniería y gestión. Se persigue, por tanto, la reutilización de este conocimiento directamente en planta para detectar y diagnosticar en línea. El beneficio recaerá tanto en la mejora de planes de mantenimiento (ajuste de tiempos, predicción de fallos, asignación de recursos, planificación, etc.) como en la toma de decisiones por parte del supervisor (reducción del tiempo para conocer las causas) para evitar situaciones catastróficas.

A.I. (Inteligencia Artificial)

In this paper, a method for computing the closure of a set of attributes according to a specification of functional dependencies of the relational model is described. The main feature of this method is that it computes the closure using solely the inference system of the SL FD logic. For the first time, logic is used in the design of automated deduction methods to solve the closure problem. The strong link between the SL FD logic and the closure algorithm is presented and an SL FD simplification paradigm emerges as the key element of our method. In addition, the soundness and completeness of the closure algorithm are shown. Our method has linear complexity, as the classical closure algorithms, and it has all the advantages provided by the use of logic. We have empirically compared our algorithm with the Diederich and Milton classical algorithm. This experiment reveals the best behaviour of our method which shows a significant improvement in the average speed.

Closure via functional dependence simplification

In the design of mathematical methods for a medical problem, one of the kernel issues is the identification of symptoms and measures that could help in the diagnosis. Discovering connections among them constitute a big challenge because it allows to reduce the number of parameters to be considered in the mathematical model. In this work, we focus on formal concept analysis as a very promising technique to address this problem. In previous works, we have studied the use of formal concept analysis to manage attribute implications. In this work, we propose to extend the knowledge that we can extract from every context using positive and negative information, which constitutes an open problem.



Based on the main classical algorithms, we propose new methods to generate the lattice concept with positive and negative information to be used as a kind of map of attribute connections. We also compare them in an experiment built with datasets from the UCI repository for machine learning. We finally apply the mining techniques to extract the knowledge contained in a real data set containing information about patients suffering breast cancer. The result obtained have been contrasted with medical scientists to illustrate the benefits of our proposal. Copyright © 2016 John Wiley & Sons, Ltd.

Data mining algorithms to compute mixed concepts with negative attributes: an application to breast cancer data analysis

Concept lattices with negative information

Negative attributes and implications in Formal Concept Analysis

This work can be seen as a contribution to the area of social network analysis By considering Formal Concept Analysis (FCA) as the underlying formalizing tool, we use logic-based techniques in order to offer novel solutions to identify user's influence in a social network We propose the use of the Simplification Logic SL FD for attribute implications as the core of an automated method to build a structure containing the complete set of influences among users

Manuel Enciso

Papers

Closure via functional dependence simplification

Data mining algorithms to compute mixed concepts with negative attributes: an application to breast cancer data analysis

Concept lattices with negative information

Negative attributes and implications in Formal Concept Analysis

Knowledge discovery in social networks by using a logic-based treatment of implications