Proceedings of the eleventh international conference on Logic programming
Logical foundations of object-oriented and frame-based languages
Journal of the ACM (JACM)
Unfounded sets and well-founded semantics for general logic programs
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Web Semantics: Science, Services and Agents on the World Wide Web
Nonmonotonic reasoning in FLORA-2
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
From SPARQL to rules (and back)
Proceedings of the 16th international conference on World Wide Web
Combining answer set programming with description logics for the Semantic Web
Artificial Intelligence
Combining RDF Vocabularies for Expert Finding
ESWC '07 Proceedings of the 4th European conference on The Semantic Web: Research and Applications
Rules and Ontologies for the Semantic Web
Reasoning Web
Versatile Semantic Modeling of Frame Logic Programs under Answer Set Semantics
ASWC '08 Proceedings of the 3rd Asian Semantic Web Conference on The Semantic Web
Package-Based Description Logics
Modular Ontologies
Modular Nonmonotonic Logic Programming Revisited
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
A Formal Theory for Modular ERDF Ontologies
RR '09 Proceedings of the 3rd International Conference on Web Reasoning and Rule Systems
A Social Vision of Knowledge Representation and Reasoning
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
A semantically enabled service oriented architecture
WImBI'06 Proceedings of the 1st WICI international conference on Web intelligence meets brain informatics
dRDF: entailment for domain-restricted RDF
ESWC'08 Proceedings of the 5th European semantic web conference on The semantic web: research and applications
Combining nonmonotonic knowledge bases with external sources
FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
MWeb: A principled framework for modular web rule bases and its semantics
ACM Transactions on Computational Logic (TOCL)
Analyzing the AIR language: a semantic web (production) rule language
RR'10 Proceedings of the Fourth international conference on Web reasoning and rule systems
A step toward tight integration of fuzzy ontological reasoning with forward rules
RR'10 Proceedings of the Fourth international conference on Web reasoning and rule systems
A rule-based implementation of fuzzy tableau reasoning
RuleML'10 Proceedings of the 2010 international conference on Semantic web rules
A self-policing policy language
ISWC'10 Proceedings of the 9th international semantic web conference on The semantic web - Volume Part I
Context-dependent OWL reasoning in sindice - experiences and lessons learnt
RR'11 Proceedings of the 5th international conference on Web reasoning and rule systems
Linked rules: principles for rule reuse on the web
RR'11 Proceedings of the 5th international conference on Web reasoning and rule systems
Interoperation between information spaces on the web
EDBT'06 Proceedings of the 2006 international conference on Current Trends in Database Technology
Tracing where and who provenance in Linked Data: A calculus
Theoretical Computer Science
A framework for modular ERDF ontologies
Annals of Mathematics and Artificial Intelligence
RDFS and OWL reasoning for linked data
RW'13 Proceedings of the 9th international conference on Reasoning Web: semantic technologies for intelligent data access
Hi-index | 0.00 |
Knowledge representation formalisms used on the Semantic Web adhere to a strict open world assumption. Therefore, nonmonotonic reasoning techniques are often viewed with scepticism. Especially negation as failure, which intuitively adopts a closed world view, is often claimed to be unsuitable for the Web where knowledge is notoriously incomplete. Nonetheless, it was suggested in the ongoing discussions around rules extensions for languages like RDF(S) or OWL to allow at least restricted forms of negation as failure, as long as negation has an explicitly defined, finite scope. Yet clear definitions of such “scoped negation” as well as formal semantics thereof are missing. We propose logic programs with contexts and scoped negation and discuss two possible semantics with desirable properties. We also argue that this class of logic programs can be viewed as a rule extension to a subset of RDF(S).