Fuzzy Description Logics (f-DLs) are extensions of classic DLs that are capable of representing and reasoning about imprecise and vague knowledge. Though reasoning algorithms for very expressive fuzzy DLs have been explored, an open issue in the fuzzy DL community is the study of tractable systems. In this paper we introduce the fuzzy extension of EL, we provide its syntax and semantics togethe...

Dynamic light scattering (DLS) has become one of the most useful diagnostic tools for crystallization. The main purpose of using DLS in crystal screening is to help the investigator understand the size distribution, stability, and aggregation state of macromolecules in solution. It can also be used to understand how experimental variables influence aggregation. With commercially available instr...

We provide syntactic necessary and sufficient conditions on the formulae reducible by the second-order quantifier elimination algorithm DLS. It is shown that DLS is compete for all modal Sahlqvist and Inductive formulae, and that all modal formulae in a single propositional variable on which DLS succeeds are canonical.

In many scientific-publication digital libraries (DLs) such as CiteSeer, arXiv e-Print, DBLP, or Google Scholar, “citations” play an important role. (The term “citation” refers to the collection of bibliographic information such as author name, title, publication venue, or year that are pertinent to a particular article.) Users often use citations to find information of interest in DLs, and res...

Consequence-based calculi are a family of reasoning algorithms for description logics (DLs), and they combine hypertableau and resolution in a way that often achieves excellent performance in practice. Up to now, however, they were proposed for either Horn DLs (which do not support disjunction), or for DLs without counting quantifiers. In this paper we present a novel consequence-based calculus...

Fuzzy Description Logics (fuzzy DLs) have been proposed as a language to describe structured knowledge with vague concepts. A major theoretical and computational limitation so far is the inability to deal with General Concept Inclusions (GCIs), which is an important feature of classical DLs. In this paper, we address this issue and develop a calculus for fuzzy DLs with GCIs.

Fuzzy Description Logics (fuzzy DLs) have been proposed as a language to describe structured knowledge with vague concepts. A major theoretical and computational limitation so far is the inability to deal with General Concept Inclusions (GCIs), which is an important feature of classical DLs. In this paper, we address this issue and develop a calculus for fuzzy DLs with GCIs.

The Semantic Web aims at making information available in a form that is understandable and automatically manageable by machines. Ontologies are engineering artifacts used to this purpose, and Description Logics (DLs) are a family of logic-based languages particularly suitable for modeling (and reasoning upon) ontologies and the Semantic Web. Great effort has been spent in identifying decidable ...