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)
Well founded semantics for logic programs with explicit negation
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Logical foundations of object-oriented and frame-based languages
Journal of the ACM (JACM)
Combining Horn rules and description logics in CARIN
Artificial Intelligence
{\cal A}{\cal L}-log: Integrating Datalog and Description Logics
Journal of Intelligent Information Systems
Representation results for defeasible logic
ACM Transactions on Computational Logic (TOCL)
Description logics of minimal knowledge and negation as failure
ACM Transactions on Computational Logic (TOCL)
XSB: A System for Effciently Computing WFS
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
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
The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
A proposal for an owl rules language
Proceedings of the 13th international conference on World Wide Web
N3logic: A logical framework for the world wide web
Theory and Practice of Logic Programming
Web Semantics: Science, Services and Agents on the World Wide Web
On the decidability and complexity of integrating ontologies and rules
Web Semantics: Science, Services and Agents on the World Wide Web
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
Stable model theory for extended RDF ontologies
ISWC'05 Proceedings of the 4th international conference on The Semantic Web
Combining RDF and part of OWL with rules: semantics, decidability, complexity
ISWC'05 Proceedings of the 4th international conference on The Semantic Web
Ten theses on logic languages for the semantic web
PPSWR'05 Proceedings of the Third international conference on Principles and Practice of Semantic Web Reasoning
On the Computability and Complexity Issues of Extended RDF
PRICAI '08 Proceedings of the 10th Pacific Rim International Conference on Artificial Intelligence: Trends in Artificial Intelligence
Computability and Complexity Issues of Extended RDF
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
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
MWeb: A principled framework for modular web rule bases and its semantics
ACM Transactions on Computational Logic (TOCL)
Embeddings of simple modular extended RDF
RR'10 Proceedings of the Fourth international conference on Web reasoning and rule systems
Embedding nonground logic programs into autoepistemic logic for knowledge-base combination
ACM Transactions on Computational Logic (TOCL)
A framework for modular ERDF ontologies
Annals of Mathematics and Artificial Intelligence
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.