다중혈관 관상동맥 환자에서 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

As an alternative to planning, an approach to highlevel agent control based on concurrent program execution is considered. A formal definition in the situation calculus of such a programming language is presented and illustrated with a detailed example. The language includes facilities for prioritizing the concurrent execution, interrupting the execution when certain conditions become true, and dealing with exogenous actions. The language differs from other procedural formalisms for concurrency in that the initial state can be incompletely specified and the primitive actions can be user-defined by axioms in the situation calculus.

/pdf/reasoning-about-concurrent-execution-prioritized-interrupts-533gj54joo.pdf

Reasoning about concurrent execution, prioritized interrupts, and exogenous actions in the situation calculus

IndiGolog isaprogramming languagefor autonomousagentsthat sense their environment anddo planning astheyoperate. Insteadof classical planning, it supports high-level program execution. The programmer provides a high-level nondeterministicprograminvolving domain-speci? c actions andteststo perform the agent’s tasks. The IndiGolog interpreterthenreasons aboutthepreconditions andeffectsofthe actionsintheprogramtonda legalterminatingexecution.To support this, the programmer provides a declarative specication of the domain (i.e.,primitive actions,preconditions andeffects, whatis known aboutthe initial state)inthe situation calculus. Theprogrammer can controlthe amountof non-determinism in the program and how muchof it is searched over. The language isrichand supports concurrentprogramming.Programsareexecuted onlinetogether withsensingthe environment and monitoringforevents,thus supporting thedevelopmentofreactiveagents.We discussthe language, itsimplementation, and applicationsthathave beenrealized withit.

/pdf/indigolog-a-high-level-programming-language-for-embedded-3p5sthac3b.pdf

IndiGolog: A High-Level Programming Language for Embedded Reasoning Agents

This paper presents a prefixed tableaux calculus for Propositional Dynamic Logic with Converse based on a combination of different techniques such as prefixed tableaux for modal logics and model checkers for μ-calculus. We prove the correctness and completeness of the calculus and illustrate its features. We also discuss the transformation of the tableaux method (naively NEXPTIME) into an EXPTIME algorithm.

/pdf/combining-deduction-and-model-checking-into-tableaux-and-4mv3ryx1gv.pdf

Combining deduction and model checking into Tableaux and algorithms for converse-PDL

Query containment and query answering are two important computational tasks in databases. While query answering amounts to computing the result of a query over a database, query containment is the problem of checking whether, for every database, the result of one query is a subset of the result of another query.In this article, we deal with unions of conjunctive queries, and we address query containment and query answering under description logic constraints. Every such constraint is essentially an inclusion dependency between concepts and relations, and their expressive power is due to the possibility of using complex expressions in the specification of the dependencies, for example, intersection and difference of relations, special forms of quantification, regular expressions over binary relations. These types of constraints capture a great variety of data models, including the relational, the entity-relationship, and the object-oriented model, all extended with various forms of constraints. They also capture the basic features of the ontology languages used in the context of the Semantic Web.We present the following results on both query containment and query answering. We provide a method for query containment under description logic constraints, thus showing that the problem is decidable, and analyze its computational complexity. We prove that query containment is undecidable in the case where we allow inequalities in the right-hand-side query, even for very simple constraints and queries. We show that query answering under description logic constraints can be reduced to query containment, and illustrate how such a reduction provides upper-bound results with respect to both combined and data complexity.

/pdf/conjunctive-query-containment-and-answering-under-1vab5bs6z4.pdf

Conjunctive query containment and answering under description logic constraints

Information integration is the problem of combining the data residing at different, heterogeneous sources, and providing the user with a unified view of these data, called mediated schema The mediated schema is therefore a reconciled view of the information, which can be queried by the user It is the task of the system to free the user from the knowledge on where data are, and how data are structured at the sourcesIn this chapter, we discuss data integration in general, and describe a logic-based approach to data integration A logic of the Description Logics family is used to model the information managed by the integration system, to formulate queries posed to the system, and to perform several types of automated reasoning supporting both the modeling, and the query answering process We focus, in particular, on a specific Description Logic, called DLR, specifically designed for database applications In the chapter, we illustrate how DLR is used to model a mediated schema of an integration system, to specify the semantics of the data sources, and finally to support the query answering process by means of the associated reasoning methods

/pdf/description-logics-for-information-integration-47nsi3pqpr.pdf

Giuseppe De Giacomo

Papers

Reasoning about concurrent execution, prioritized interrupts, and exogenous actions in the situation calculus

IndiGolog: A High-Level Programming Language for Embedded Reasoning Agents

Combining deduction and model checking into Tableaux and algorithms for converse-PDL

Conjunctive query containment and answering under description logic constraints

Description Logics for Information Integration