6,037 research outputs found

    Introducing Dynamic Behavior in Amalgamated Knowledge Bases

    Full text link
    The problem of integrating knowledge from multiple and heterogeneous sources is a fundamental issue in current information systems. In order to cope with this problem, the concept of mediator has been introduced as a software component providing intermediate services, linking data resources and application programs, and making transparent the heterogeneity of the underlying systems. In designing a mediator architecture, we believe that an important aspect is the definition of a formal framework by which one is able to model integration according to a declarative style. To this purpose, the use of a logical approach seems very promising. Another important aspect is the ability to model both static integration aspects, concerning query execution, and dynamic ones, concerning data updates and their propagation among the various data sources. Unfortunately, as far as we know, no formal proposals for logically modeling mediator architectures both from a static and dynamic point of view have already been developed. In this paper, we extend the framework for amalgamated knowledge bases, presented by Subrahmanian, to deal with dynamic aspects. The language we propose is based on the Active U-Datalog language, and extends it with annotated logic and amalgamation concepts. We model the sources of information and the mediator (also called supervisor) as Active U-Datalog deductive databases, thus modeling queries, transactions, and active rules, interpreted according to the PARK semantics. By using active rules, the system can efficiently perform update propagation among different databases. The result is a logical environment, integrating active and deductive rules, to perform queries and update propagation in an heterogeneous mediated framework.Comment: Other Keywords: Deductive databases; Heterogeneous databases; Active rules; Update

    A procedure for mediation of queries to sources in disparate contexts

    Get PDF
    Includes bibliographical references (p. 17-19).S. Bressan ... [et al.]

    Identification of Design Principles

    Get PDF
    This report identifies those design principles for a (possibly new) query and transformation language for the Web supporting inference that are considered essential. Based upon these design principles an initial strawman is selected. Scenarios for querying the Semantic Web illustrate the design principles and their reflection in the initial strawman, i.e., a first draft of the query language to be designed and implemented by the REWERSE working group I4

    Agent-based Computational Economics: a Methodological Appraisal

    Get PDF
    This paper is an overview of "Agent-based Computational Economics (ACE)", an emerging approach to the study of decentralized market economies, in methodological perspective. It summarizes similarities and differences with respect to conventional economic models, outlines the unique methodological characteristics of this approach, and discusses its implications for economic methodology as a whole. While ACE rejoins the reflection on the unintended social consequences of purposeful individual action which is constitutive of economics as a discipline, the paper shows that it complements state-of the-art research in experimental and behavioral economics. In particular, the methods and techniques of ACE have reinforced the laboratory finding that fundamental economic results rely less on rational choice theory than is usually assumed, and have provided insight into the importance of market structures and rules in addition to individual choice. In addition, ACE has enlarged the range of inter-individual interactions that are of interest for economists. In this perspective, ACE provides the economist‘s toolbox with valuable supplements to existing economic techniques rather than proposing a radical alternative. Despite some open methodological questions, it has potential for better integration into economics in the future.Agent-based Computational Economics, Economic Methodology, Experimental Economics.

    First-Order Rewritability and Complexity of Two-Dimensional Temporal Ontology-Mediated Queries

    Get PDF
    Aiming at ontology-based data access to temporal data, we design two-dimensional temporal ontology and query languages by combining logics from the (extended) DL-Lite family with linear temporal logic LTL over discrete time (Z,<). Our main concern is first-order rewritability of ontology-mediated queries (OMQs) that consist of a 2D ontology and a positive temporal instance query. Our target languages for FO-rewritings are two-sorted FO(<) - first-order logic with sorts for time instants ordered by the built-in precedence relation < and for the domain of individuals - its extension FOE with the standard congruence predicates t \equiv 0 mod n, for any fixed n > 1, and FO(RPR) that admits relational primitive recursion. In terms of circuit complexity, FOE- and FO(RPR)-rewritability guarantee answering OMQs in uniform AC0 and NC1, respectively. We proceed in three steps. First, we define a hierarchy of 2D DL-Lite/LTL ontology languages and investigate the FO-rewritability of OMQs with atomic queries by constructing projections onto 1D LTL OMQs and employing recent results on the FO-rewritability of propositional LTL OMQs. As the projections involve deciding consistency of ontologies and data, we also consider the consistency problem for our languages. While the undecidability of consistency for 2D ontology languages with expressive Boolean role inclusions might be expected, we also show that, rather surprisingly, the restriction to Krom and Horn role inclusions leads to decidability (and ExpSpace-completeness), even if one admits full Booleans on concepts. As a final step, we lift some of the rewritability results for atomic OMQs to OMQs with expressive positive temporal instance queries. The lifting results are based on an in-depth study of the canonical models and only concern Horn ontologies

    Enterprise resource planning adoption and satisfaction determinants

    Get PDF
    JEL classification: M15 – IT Management, M10 – General Business AdministrationEnterprise Resource Planning (ERP) systems are at the core of every firm. Making people use this costly and time consuming investment is one of the most important issues to deal with. The main objective of the present dissertation is to find the key determinants that open the door to user satisfaction and adoption. A theoretical model was set and an online survey was conducted to understand ERP users’ perspective on such matters. The outcome was the model validation and the understanding that top management support, training, and the system quality are important constructs to assess adoption and user satisfaction. In fact, the latter (system quality) has a significant influence on the behavioural intention to use and also in the overall user satisfaction.Os sistemas de Enterprise Resource Planning (ERP) fazem parte do centro nevrálgico de todas as empresas. Fazer com que as pessoas tirem partido de um investimento desta importância é um aspeto crucial que tem de se levar em conta. É o principal objetivo da presente dissertação identificar os principais determinantes que levam à satisfação e adoção por parte dos utilizadores. Para este efeito foi elaborado um modelo teórico e levado a cabo um questionário online junto dos utilizadores de sistemas ERP. O resultado foi a validação do modelo e a confirmação de que o suporte da gestão de topo, a formação e a qualidade do sistema são construtos decisivos para avaliar a adoção e satisfação por parte dos utilizadores. De fato, a qualidade do sistema tem uma influência muito forte na intenção comportamental de utilizar o sistema e também na satisfação global do utilizador
    corecore