Logic programs with classical negation
Logic programming
A database needs two kinds of negation
MFDBS 91 Proceedings of the 3rd symposium on Mathematical fundamentals of database and knowledge base systems
The well-founded semantics for general logic programs
Journal of the ACM (JACM)
Logical foundations of object-oriented and frame-based languages
Journal of the ACM (JACM)
TRIPLE - A Query, Inference, and Transformation Language for the Semantic Web
ISWC '02 Proceedings of the First International Semantic Web Conference on The Semantic Web
A proposal for an owl rules language
Proceedings of the 13th international conference on World Wide Web
Combining answer set programming with description logics for the Semantic Web
Artificial Intelligence
Rules and Ontologies for the Semantic Web
Reasoning Web
Extended RDF as a semantic foundation of rule markup languages
Journal of Artificial Intelligence Research
Logical foundations of (e)RDF(S): complexity and reasoning
ISWC'07/ASWC'07 Proceedings of the 6th international The semantic web and 2nd Asian conference on Asian semantic web conference
Hybrid reasoning with rules and ontologies
Semantic techniques for the web
PPSWR'06 Proceedings of the 4th international conference on Principles and Practice of Semantic Web Reasoning
Supporting open and closed world reasoning on the web
PPSWR'06 Proceedings of the 4th international conference on Principles and Practice of Semantic Web Reasoning
Hi-index | 0.00 |
Ontologies and automated reasoning are the building blocks of the Semantic Web initiative. Derivation rules can be included in an ontology to define derived concepts based on base concepts. For example, rules allow to define the extension of a class or property based on a complex relation between the extensions of the same or other classes and properties. On the other hand, the inclusion of negative information both in the form of negation-as-failure and explicit negative information is also needed to enable various forms of reasoning. In this paper, we extend RDF graphs with weak and strong negation, as well as derivation rules. The ERDF stable model semantics of the extended framework (Extended RDF) is defined, extending RDF(S) semantics. A distinctive feature of our theory, which is based on partial logic, is that both truth and falsity extensions of properties and classes are considered, allowing for truth value gaps. Our framework supports both closed-world and open-world reasoning through the explicit representation of the particular closed-world assumptions and the ERDF ontological categories of total properties and total classes.