کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
9673392 | 1451633 | 2005 | 37 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Completeness, decidability and complexity of entailment for RDF Schema and a semantic extension involving the OWL vocabulary
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
سیستم های اطلاعاتی
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
We define semantic extensions of RDFS that involve datatypes and a subset of the OWL vocabulary that includes the property-related vocabulary (e.g. FunctionalProperty), the comparisons (e.g. sameAs and differentFrom) and the value restrictions (e.g. allValuesFrom). These semantic extensions are in line with the 'if-semantics' of RDFS and weaker than the 'iff-semantics' of D-entailment and OWL (DL or Full). For these semantic extensions we present entailment rules, prove completeness results, prove that consistency is in P and that, just as for RDFS, entailment is NP-complete, and in P if the target graph does not contain blank nodes. There are no restrictions on use to obtain decidability: classes can be used as instances.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Web Semantics: Science, Services and Agents on the World Wide Web - Volume 3, Issues 2â3, October 2005, Pages 79-115
Journal: Web Semantics: Science, Services and Agents on the World Wide Web - Volume 3, Issues 2â3, October 2005, Pages 79-115
نویسندگان
Herman J. ter Horst,