다중혈관 관상동맥 환자에서 y-문합을 이용하여 양쪽 내흉동맥만을 사용한 우회술의 조기 성적

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

An Introduction to MultiAgent Systems.

https://www.cs.ox.ac.uk/people/bernardo.cuencagrau/publications/PelletDemo.pdf

Pellet: A practical OWL-DL reasoner

Data integration is the problem of combining data residing at different sources, and providing the user with a unified view of these data. The problem of designing data integration systems is important in current real world applications, and is characterized by a number of issues that are interesting from a theoretical point of view. This document presents on overview of the material to be presented in a tutorial on data integration. The tutorial is focused on some of the theoretical issues that are relevant for data integration. Special attention will be devoted to the following aspects: modeling a data integration application, processing queries in data integration, dealing with inconsistent data sources, and reasoning on queries.

/pdf/data-integration-a-theoretical-perspective-58aesjvhuk.pdf

Data integration: a theoretical perspective

UML is the de-facto standard formalism for software design and analysis. One of the most important components of UML are class diagrams, which model the information on the domain of interest in terms of objects organized in classes and relationships between them. To support the design of large-scale industrial applications, CASE tools should be equipped with automated reasoning capabilities in order to detect relevant formal properties of UML diagrams, such as inconsistencies or redundancies. However, reasoning on UML class diagrams is fairly complex: in this paper we show that it is EXPTIME-hard.

/pdf/reasoning-on-uml-class-diagrams-is-exptime-hard-4iqhzvjemu.pdf

Reasoning on UML Class Diagrams is EXPTIME-hard.

Dealing with inconsistencies is one the main challenges in data integration systems, where data stored in the local sources may violate integrity constraints specified at the global level. Recently, declarative approaches have been proposed to deal with such a problem. Existing declarative proposals do not take into account preference assertions specified between sources when trying to solve inconsistency. On the other hand, the designer of an integration system may often include in the specification preference rules indicating the quality of data sources. In this paper, we consider Local-As-View integration systems, and propose a method that allows one to assign formal semantics to a data integration system whose declarative specification includes information on source preferences. To the best of our knowledge, our approach is the first one to consider in a declarative way information on source quality for dealing with inconsistent data in Local-As-View integration systems.

https://www.dis.uniroma1.it/~degiacom/papers/2004/IQIS04degiacomo_etal.pdf

Tackling inconsistencies in data integration through source preferences

We aim at reasoning about actions and about high-level programs over knowledge bases (KBs) expressed in Description Logics (DLs). This is a critical issue that has resisted good, robust solutions for a long time. In particular, while welldeveloped theories of actions and high-level programs exist in AI, e.g., the ones based on the Situation Calculus, these theories do not apply to DL KBs, since these impose very rich state constraints (all the intensional part of the ontology itself). Here we propose a radical solution: we assume a Levesque’s functional view of KBs and see them as systems that allow for two kinds of operations: ASK, which returns the (certain) answer to a query, and TELL, which produces a new knowledge base as the result of the application of an atomic action. In particular, we consider DL KBs formed by two components: a TBox, providing the intensional knowledge about the domain of interest, which we assume to be immutable over time; and an ABox, providing (incomplete) information at the extensional level, which we assume to be changed by atomic actions based on generic forms of instance level updates. The only requirement that we pose on such updates is that the resulting ABox is still expressible in the original DL language. We demonstrate the effectiveness of the approach by introducing Golog/ConGolog-like high-level programs on DL KBs, characterizing the notion of single-step executability of such programs, and devising nice methods for reasoning about sequences of actions generated by such programs. All our basic results are parametric wrt the specific DL language. Though for concreteness we present them using a particularly well behaved DL, namely DL-LiteA,id.

/pdf/actions-and-programs-over-description-logic-knowledge-bases-24h6urszax.pdf

Actions and Programs over Description Logic Knowledge Bases: A Functional Approach

We devise a general framework for formalizing Description Logic Based Dynamic Systems that is parametric w.r.t. the description logic knowledge base and the progression mechanism. We study verification and adversarial syn- thesis for specifications expressed in a variant of first-order -calculus, with a controlled form of quantification across successive states. We provide key de- cidability results for both verification and synthesis, under a "bounded-state" assumption. We then study two instantiations of this general framework, where the knowledge base is expressed in DL-Lite andALCQI, respectively.

/pdf/verification-and-synthesis-in-description-logic-based-4jinnacrzi.pdf

Verification and Synthesis in Description Logic Based Dynamic Systems (Abridged Version)

The study of node-selection query languages for (finite) trees has been a major topic in the recent research on query languages for Web documents. On one hand, there has been an extensive study of XPath and its various extensions. On the other hand, query languages based on classical logics, such as first-order logic (FO) or monadic second-order logic (MSO), have been considered. Results in this area typically relate an Xpath-based language to a classical logic. What has yet to emerge is an XPath-related language that is expressive as MSO, and at the same time enjoys the computational properties of XPath, which are linear query evaluation and exponential query-containment test. In this paper we propose µXPath, which is the alternation-free fragment of XPath extended with fixpoint operators. Using two-way alternating automata, we show that this language does combine desired expressiveness and computational properties, placing it as an attractive candidate as the definite query language for trees.

/pdf/node-selection-query-languages-for-trees-30ovh1v1kr.pdf

Giuseppe De Giacomo

Papers

Reasoning on UML Class Diagrams is EXPTIME-hard.

Tackling inconsistencies in data integration through source preferences

Actions and Programs over Description Logic Knowledge Bases: A Functional Approach

Verification and Synthesis in Description Logic Based Dynamic Systems (Abridged Version)

Node selection query languages for trees