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

物件導向軟體之架構(Object-Oriented Software Construction)探討

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

Pellet: A practical OWL-DL reasoner

Ontologies tend to be found everywhere. They are viewed as the silver bullet for many applications, such as database integration, peer-to-peer systems, e-commerce, semantic web services, or social networks. However, in open or evolving systems, such as the semantic web, different parties would, in general, adopt different ontologies. Thus, merely using ontologies, like using XML, does not reduce heterogeneity: it just raises heterogeneity problems to a higher level. Euzenat and Shvaikos book is devoted to ontology matching as a solution to the semantic heterogeneity problem faced by computer systems. Ontology matching aims at finding correspondences between semantically related entities of different ontologies. These correspondences may stand for equivalence as well as other relations, such as consequence, subsumption, or disjointness, between ontology entities. Many different matching solutions have been proposed so far from various viewpoints, e.g., databases, information systems, and artificial intelligence. The second edition of Ontology Matching has been thoroughly revised and updated to reflect the most recent advances in this quickly developing area, which resulted in more than 150 pages of new content. In particular, the book includes a new chapter dedicated to the methodology for performing ontology matching. It also covers emerging topics, such as data interlinking, ontology partitioning and pruning, context-based matching, matcher tuning, alignment debugging, and user involvement in matching, to mention a few. More than 100 state-of-the-art matching systems and frameworks were reviewed. With Ontology Matching, researchers and practitioners will find a reference book that presents currently available work in a uniform framework. In particular, the work and the techniques presented in this book can be equally applied to database schema matching, catalog integration, XML schema matching and other related problems. The objectives of the book include presenting (i) the state of the art and (ii) the latest research results in ontology matching by providing a systematic and detailed account of matching techniques and matching systems from theoretical, practical and application perspectives.

Ontology Matching

What is modal logic

Knowledge bases, data bases and object-oriented systems (referred to in the paper as Object-Centered systems) all rely on attributes as the main construct used to associate properties to objects; among these, a fundamental role is played by the so-called part-whole relation. The representation of such structural information usually requires particular semantics together with specialized inference and update mechanisms, but rarely do current modelling formalisms and methodologies give it a specific, ‘first-class’ dignity. The main thesis of this paper is that the part-whole relation cannot simply be considered as an ordinary attribute: its specific ontological nature requires to be understood and integrated within data-modelling formalisms and methodologies. On the basis of such an ontological perspective, we survey the conceptual modelling issues involving part-whole relations, and the various modelling frameworks provided by knowledge representation and object-oriented formalisms.

Part-whole relations in object-centered systems: an overview

The DIG Description Logic Interface

We consider different methods of optimizing the classification process of terminological representation systems, and evaluate their effect on three different types of test data Though these techniques can probably be found in many existing systems, until now there has been no coherent description of these techniques and their impact on the performance of a system One goal of this paper is to make such a description available for future implementors of terminological systems Building the optimizations that came off best into the KRIS system greatly enhanced its efficiency

An empirical analysis of optimization techniques for terminological representation systems : or: 'Making KRIS get a move on'

This paper surveys the temporal extensions of description logics appearearing in the literature. The analysis considers a large spectrum of approaches appearearing in the temporal description logics area: from the loosely coupled approaches – which comprise, for example, the enhancement of simple description logics with a constraint based mechanism – to the most principled ones – which consider a combined semantics for the abstract and the temporal domains. It will be shown how these latter approaches have a strict connection with temporal logics.

Advantages of using temporal description logics are their high expressivity combined with desirable computational properties – such as decidability, soundness and completeness of deduction procedures. In this survey the computational properties of various families of temporal description logics will be pointed out.

/pdf/a-survey-of-temporal-extensions-of-description-logics-33ty2608zw.pdf

A survey of temporal extensions of description logics

A class of interval-based temporal languages for uniformly representing and reasoning about actions and plans is presented. Actions are represented by describing what is true while the action itself is occurring, and plans are constructed by temporally relating actions and world states. The temporal languages are members of the family of Description Logics, which are characterized by high expressivity combined with good computational properties. The subsumption problem for a class of temporal Description Logics is investigated and sound and complete decision procedures are given. The basic language TL-F is considered first: it is the composition of a temporal logic TL - able to express interval temporal networks - together with the non-temporal logic F - a Feature Description Logic. It is proven that subsumption in this language is an NP-complete problem. Then it is shown how to reason with the more expressive languages TLU-FU and TL-ALCF. The former adds disjunction both at the temporal and non-temporal sides of the language, the latter extends the non-temporal side with set-valued features (i.e., roles) and a propositionally complete language.

/pdf/a-temporal-description-logic-for-reasoning-about-actions-and-tonlgcuj37.pdf

Enrico Franconi

Papers

Part-whole relations in object-centered systems: an overview

The DIG Description Logic Interface

An empirical analysis of optimization techniques for terminological representation systems : or: 'Making KRIS get a move on'

A survey of temporal extensions of description logics

A temporal description logic for reasoning about actions and plans