On the Computability and Complexity Issues of Extended RDF

Authors:
Anastasia Analyti;Grigoris Antoniou;Carlos Viegas Damásio;Gerd Wagner
Affiliations:
Institute of Computer Science, FORTH-ICS, Greece;Institute of Computer Science, FORTH-ICS, Greece and Department of Computer Science, University of Crete, Greece;CENTRIA, Departamento de Informatica, Faculdade de Ciencias e Tecnologia, Universidade Nova de Lisboa, Caparica, Portugal 2829-516;Inst. of Informatics, Brandenburg Univ. of Technology at Cottbus, Germany
Venue:
PRICAI '08 Proceedings of the 10th Pacific Rim International Conference on Artificial Intelligence: Trends in Artificial Intelligence
Year:
2008

Citing 7
Cited 3

Logic programs with classical negation

Logic programming
Logical foundations of object-oriented and frame-based languages

Journal of the ACM (JACM)
Complexity and expressive power of logic programming

ACM Computing Surveys (CSUR)
RDF and Logic: Reasoning and Extension

DEXA '07 Proceedings of the 18th International Conference on Database and Expert Systems Applications
N3logic: A logical framework for the world wide web

Theory and Practice of Logic Programming
Extended RDF as a semantic foundation of rule markup languages

Journal of Artificial Intelligence Research
Combining RDF and part of OWL with rules: semantics, decidability, complexity

ISWC'05 Proceedings of the 4th international conference on The Semantic Web

A Formal Theory for Modular ERDF Ontologies

RR '09 Proceedings of the 3rd International Conference on Web Reasoning and Rule Systems
Implementing Simple Modular ERDF ontologies

Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
A framework for modular ERDF ontologies

Annals of Mathematics and Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

ERDF stable model semantics is a recently proposed semantics for ERDF ontologies and a faithful extension of RDFS semantics on RDF graphs. In this paper, we elaborate on the computability and complexity issues of the ERDF stable model semantics. We show that decidability under this semantics cannot be achieved, unless ERDF ontologies of restricted syntax are considered. Therefore, we propose a slightly modified semantics for ERDF ontologies, called ERDF #n-stable model semantics . We show that entailment under this semantics is in general decidable and it also extends RDFS entailment. An equivalence statement between the two semantics and various complexity results are provided.