๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Semantics for Dual Preferential Entailment

โœ Scribed by Katarina Britz; Johannes Heidema; Willem Labuschagne

Publisher
Springer Netherlands
Year
2008
Tongue
English
Weight
362 KB
Volume
38
Category
Article
ISSN
0022-3611

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