作者: Herman J. ter Horst
DOI: 10.1007/11574620_48
关键词:
摘要: This paper extends the model theory of RDF with rules, placing an emphasis on integration OWL and decidability entailment. We start from abstract syntax that views a rule as pair graphs which generalize by also allowing variables in subject, predicate object positions. include RDFS well decidable part weakens D-entailment Full. Classes can be used instances. Almost all examples DAML set test rules are covered our approach. For R, we define general notion R-entailment. Extending earlier results OWL, prove completeness result for shows restricted form application introduce blank nodes is sufficient to determine For do not nodes, R-entailment R-consistency PSPACE. satisfy bound size bodies, P, NP, P if target graph ground.