The Logic of Extensional RDFS
نویسندگان
چکیده
The normative version of RDFS gives non-standard (intensional) interpretations to some standard notions such as classes and properties. In this paper we develop the extensional semantics for the RDFS vocabulary, which surprisingly preserves the simplicity and computational complexity of deduction of the intensional case. This result will impact current implementations in a positive sense, as reasoning in RDFS will follow common set-based intuitions and be compatible with OWL extensions; moreover, the rule system that we present is easily embeddable in existing libraries such as Jena.
منابع مشابه
Adding DL-Lite TBoxes to Proper Knowledge Bases
Levesque’s proper knowledge bases (proper KBs) correspond to infinite sets of ground positive and negative facts, with the notable property that for FOL formulas in a certain normal form, which includes conjunctive queries and positive queries possibly extended with a controlled form of negation, entailment reduces to formula evaluation. However proper KBs represent extensional knowledge only. ...
متن کاملIRIS - Integrated Rule Inference System
Ontologies, fundamental to the realization of the Semantic Web, provide a formal and precise conceptualization of a specific domain that can be used to describe resources on the Web. Reasoning over such resource descriptions is essential in order to facilitate automated processing using formal descriptions that are machine interpretable. In this context, Datalog (with extensions) can be used fo...
متن کاملDynamic Querying of Mass-Storage RDF Data with Rule-Based Entailment Regimes
RDF Schema (RDFS) as a lightweight ontology language is gaining popularity and, consequently, tools for scalable RDFS inference and querying are needed. SPARQL has become recently a W3C standard for querying RDF data, but it mostly provides means for querying simple RDF graphs only, whereas querying with respect to RDFS or other entailment regimes is left outside the current specification. In t...
متن کاملMinimum Model Semantics for Extensional Higher-order Logic Programming with Negation
Extensional higher-order logic programming has been introduced as a generalization of classical logic programming. An important characteristic of this paradigm is that it preserves all the well-known properties of traditional logic programming. In this paper we consider the semantics of negation in the context of the new paradigm. Using some recent results from non-monotonic fixed-point theory,...
متن کاملConstructive Negation in Extensional Higher-Order Logic Programming
Extensional higher-order logic programming has been recently proposed as an interesting extension of classical logic programming. An important characteristic of the new paradigm is that it preserves all the well-known properties of traditional logic programming. In this paper we enhance extensional higher-order logic programming with constructive negation. We argue that the main ideas underlyin...
متن کامل