Tractable approximate deduction for OWL

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tractable approximate deduction for OWL

Today’s ontology applications require efficient and reliable description logic (DL) reasoning services. Expressive DLs usually have high worst case complexity while tractable DLs are restricted in terms of expressive power. This brings a new challenge: can users use expressive DLs to build their ontologies and still enjoy the efficient services as in tractable languages? Approximation has been ...

متن کامل

ELP: Tractable Rules for OWL 2

We introduce ELP as a decidable fragment of the Semantic Web Rule Language (SWRL) that admits reasoning in polynomial time. ELP is based on the tractable description logic EL, and encompasses an extended notion of the recently proposed DL rules for that logic. Thus ELP extends EL with a number of features introduced by the forthcoming OWL 2, such as disjoint roles, local reflexivity, certain ra...

متن کامل

Tractable approximate robust geometric programming

The optimal solution of a geometric program (GP) can be sensitive to variations in the problem data. Robust geometric programming can systematically alleviate the sensitivity problem by explicitly incorporating a model of data uncertainty in a GP and optimizing for the worst-case scenario under this model. However, it is not known whether a general robust GP can be reformulated as a tractable o...

متن کامل

TrOWL: Tractable OWL 2 Reasoning Infrastructure

The Semantic Web movement has led to the publication of thousands of ontologies online. These ontologies present and mediate information and knowledge on the Semantic Web. Tools exist to reason over these ontologies and to answer queries over them, but there are no large scale infrastructures for storing, reasoning, and querying ontologies on a scale that would be useful for a large enterprise ...

متن کامل

Conjunctive Queries for a Tractable Fragment of OWL 1.1

Despite the success of the Web Ontology Language OWL, the development of expressive means for querying OWL knowledge bases is still an open issue. In this paper, we investigate how a very natural and desirable form of queries—namely conjunctive ones—can be used in conjunction with OWL such that one of the major design criteria of the latter—namely decidability—can be retained. More precisely, w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Artificial Intelligence

سال: 2016

ISSN: 0004-3702

DOI: 10.1016/j.artint.2015.10.004