Syntheses of DL-Hydroxylysine and DL-Allohydroxylysine
نویسندگان
چکیده
منابع مشابه
SPARQL-DL: SPARQL Query for OWL-DL
There are many query languages (QLs) that can be used to query RDF and OWL ontologies but neither type is satisfactory for querying OWL-DL ontologies. RDF-based QLs (RDQL, SeRQL, SPARQL) are harder to give a semantics w.r.t. OWL-DL and are more powerful than what OWL-DL reasoners can provide. DL-based QLs (DIG ask queries, nRQL) have clear semantics but are not powerful enough in the general ca...
متن کاملExtending the 5S Digital Library (DL) Framework: From a Minimal DL towards a DL Reference Model
In this paper, we describe ongoing research in three DL projects that build upon a common foundation – the 5S DL framework. In each project, we extend the 5S framework to provide specifications for a particular type of DL service and/or system – finally, moving towards a DL reference model. In the first project, we are working on formalizing content-based image retrieval services in a DL. In th...
متن کاملDL-Proline.
In the structure of DL-proline, C5H9NO2, the molecules are connected via classical intermolecular N-H...O hydrogen bonds involving the amine and carboxyl groups [N...O = 2.7129 (15) and 2.8392 (16) A], and form chains along the b-axis direction and parallel to (-101). The chains are linked into sheets via weak non-classical hydrogen bonds. The conformation of the molecule and its packing are no...
متن کاملDL-SR: a Lite DL with Expressive Rules: Preliminary Results
Simple conceptual graphs can be seen as a very basic description logic, allowing however for answering conjunctive queries. In the first part of this paper, we translate some results obtained for conceptual graph rules of form “if A then B” into an equivalent DL-based formalism. Then we show that, our algorithms can automatically decide in some cases whether a given DL has the FOL-reducibility ...
متن کاملDL Systems Comparison
The tradeoff between expressiveness and tractability in Description Logics (DLs) has long been recognised [9]. For DL system designers and implementors there are several possible approaches to this problem [3]. These include: • (severely) constraining expressiveness so that (Tbox) reasoning can be performed in polynomial time (e.g., Classic [11]); • using tractable but incomplete reasoning algo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Chemical Society of Japan
سال: 1962
ISSN: 0009-2673,1348-0634
DOI: 10.1246/bcsj.35.2006