𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A semantically complete extension sequence of the system(mathcal{L}^* )

✍ Scribed by Daowu Pei; Guojun Wang

Book ID
111784543
Publisher
Science in China Press (SCP)
Year
2003
Tongue
English
Weight
162 KB
Volume
46
Category
Article
ISSN
1674-733X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Completeness, decidability and complexit
Completeness, decidability and complexity of entailment for RDF Schema and a semantic extension involving the OWL vocabulary
✍ Herman J. ter Horst πŸ“‚ Article πŸ“… 2005 πŸ› Elsevier Science 🌐 English βš– 496 KB

We prove that entailment for RDF Schema (RDFS) is decidable, NP-complete, and in P if the target graph does not contain blank nodes. We show that the standard set of entailment rules for RDFS is incomplete and that this can be corrected by allowing blank nodes in predicate position. We define seman