2,615 research outputs found

    Towards Intelligent Databases

    Get PDF
    This article is a presentation of the objectives and techniques of deductive databases. The deductive approach to databases aims at extending with intensional definitions other database paradigms that describe applications extensionaUy. We first show how constructive specifications can be expressed with deduction rules, and how normative conditions can be defined using integrity constraints. We outline the principles of bottom-up and top-down query answering procedures and present the techniques used for integrity checking. We then argue that it is often desirable to manage with a database system not only database applications, but also specifications of system components. We present such meta-level specifications and discuss their advantages over conventional approaches

    Construcción de un sistema de información y de ayuda a la decisión mediante lógica difusa para el cultivo del olivar en Andalucía

    Get PDF
    In Southern Spain, olive (Olea europaea L.) growing is an important part of the economy, especially in the provinces of Jaén, Córdoba and Granada. This work proposes the first stages of an Information and Decision-Support System (IDSS) for providing different types of users (farmers, agricultural engineers, public services, etc.) with information on olive growing and the environment, and also assisting in decision-making. The main purposes of the project reported in this paper are to process uncertain or imprecise data, such as those concerning the environment or crops, and combine user data with other scientific-experimental data. The possibility of storing agricultural and ecological information in fuzzy relational databases, vital to the development of an IDSS is described. The information will be processed using knowledge extraction tools (fuzzy data-mining) that will allow rules on expert knowledge for assessing suitability of land to be developed and making thematic maps with the aid of Geographic Information Systems. Flexible querying will allow the users to collect information interactively from databases, while user information is constantly added. Flexible querying of databases, land suitability and thematic maps may be used to help in decisionmaking.El cultivo del olivo (Olea europaea L.) tiene una enorme importancia económica en la zona sur de España y concretamente en las provincias de Jaén, Córdoba y Granada. En este trabajo se propone la construcción de un sistema de información y ayuda a la toma de decisión (IDSS) que permita en el futuro a distintos tipos de usuarios (agricultores, agrónomos, administraciones públicas, etc.) obtener y manejar información sobre el cultivo de olivar y el soporte ambiental del mismo, así como ayudar en la toma de decisiones. Los principales objetivos desarrollados en este trabajo son el tratamiento de datos inciertos e imprecisos, como es el caso de la información ambiental y sobre cultivos, y la fusión de datos sobre cultivo y otros de carácter científico-experimental. Se describe la posibilidad de almacenar la información de carácter agronómico y ecológico en bases de datos relacionales, que es vital para el desarrollo de un IDSS. La información será procesada a través de herramientas de extracción de conocimiento (minería de datos difusa) y permitirá sobre la base del conocimiento experto el desarrollo de reglas para la clasificación de aptitud del terreno y para la obtención de mapas temáticos con la ayuda de Sistemas de Información Geográfica. La consulta flexible permitirá a los distintos usuarios la consulta interactiva de toda la información almacenada en las bases de datos, así como una implementación constante de las mismas. La consulta flexible de bases de datos, la idoneidad de los terrenos y los mapas temáticos pueden ser de gran utilidad en la toma de decisiones.This work is part of the research projects 1FD97-0244-CO3-2 (financed with FEDER funds) and CGL2004-02282BTE (Spanish Ministry of Education and Science)

    On the similarity relation within fuzzy ontology components

    Get PDF
    Ontology reuse is an important research issue. Ontology merging, integration, mapping, alignment and versioning are some of its subprocesses. A considerable research work has been conducted on them. One common issue to these subprocesses is the problem of defining similarity relations among ontologies components. Crisp ontologies become less suitable in all domains in which the concepts to be represented have vague, uncertain and imprecise definitions. Fuzzy ontologies are developed to cope with these aspects. They are equally concerned with the problem of ontology reuse. Defining similarity relations within fuzzy context may be realized basing on the linguistic similarity among ontologies components or may be deduced from their intentional definitions. The latter approach needs to be dealt with differently in crisp and fuzzy ontologies. This is the scope of this paper.ou

    Toward Entity-Aware Search

    Get PDF
    As the Web has evolved into a data-rich repository, with the standard "page view," current search engines are becoming increasingly inadequate for a wide range of query tasks. While we often search for various data "entities" (e.g., phone number, paper PDF, date), today's engines only take us indirectly to pages. In my Ph.D. study, we focus on a novel type of Web search that is aware of data entities inside pages, a significant departure from traditional document retrieval. We study the various essential aspects of supporting entity-aware Web search. To begin with, we tackle the core challenge of ranking entities, by distilling its underlying conceptual model Impression Model and developing a probabilistic ranking framework, EntityRank, that is able to seamlessly integrate both local and global information in ranking. We also report a prototype system built to show the initial promise of the proposal. Then, we aim at distilling and abstracting the essential computation requirements of entity search. From the dual views of reasoning--entity as input and entity as output, we propose a dual-inversion framework, with two indexing and partition schemes, towards efficient and scalable query processing. Further, to recognize more entity instances, we study the problem of entity synonym discovery through mining query log data. The results we obtained so far have shown clear promise of entity-aware search, in its usefulness, effectiveness, efficiency and scalability

    A New Rational Algorithm for View Updating in Relational Databases

    Full text link
    The dynamics of belief and knowledge is one of the major components of any autonomous system that should be able to incorporate new pieces of information. In order to apply the rationality result of belief dynamics theory to various practical problems, it should be generalized in two respects: first it should allow a certain part of belief to be declared as immutable; and second, the belief state need not be deductively closed. Such a generalization of belief dynamics, referred to as base dynamics, is presented in this paper, along with the concept of a generalized revision algorithm for knowledge bases (Horn or Horn logic with stratified negation). We show that knowledge base dynamics has an interesting connection with kernel change via hitting set and abduction. In this paper, we show how techniques from disjunctive logic programming can be used for efficient (deductive) database updates. The key idea is to transform the given database together with the update request into a disjunctive (datalog) logic program and apply disjunctive techniques (such as minimal model reasoning) to solve the original update problem. The approach extends and integrates standard techniques for efficient query answering and integrity checking. The generation of a hitting set is carried out through a hyper tableaux calculus and magic set that is focused on the goal of minimality.Comment: arXiv admin note: substantial text overlap with arXiv:1301.515
    corecore