Supporting open and closed world reasoning on the web

Authors:
Carlos Viegas Damásio;Anastasia Analyti;Grigoris Antoniou;Gerd Wagner
Affiliations:
Centro de Inteligência Artificial, Universidade Nova de Lisboa, Caparica, Portugal;Institute of Computer Science, FORTH-ICS, Greece;Institute of Computer Science, FORTH-ICS, Greece;Institute of Informatics, Brandenburg Univ. of Technology at Cottbus, Germany
Venue:
PPSWR'06 Proceedings of the 4th international conference on Principles and Practice of Semantic Web Reasoning
Year:
2006

Citing 10
Cited 10

Negation as failure: a comparison of Clark's completed data base and Reiter's closed world assumption

Journal of Logic Programming
Negation in logic programming

Foundations of deductive databases and logic programming
Logic programs with classical negation

Logic programming
Well founded semantics for logic programs with explicit negation

ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
XSB as an efficient deductive database engine

SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
A survey of paraconsistent semantics for logic programs

Handbook of defeasible reasoning and uncertainty management systems
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 uniform integration of higher-order reasoning and external evaluations in answer-set programming

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Stable model theory for extended RDF ontologies

ISWC'05 Proceedings of the 4th international conference on The Semantic Web
A realistic architecture for the semantic web

RuleML'05 Proceedings of the First international conference on Rules and Rule Markup Languages for the Semantic Web

Rules and Ontologies for the Semantic Web

Reasoning Web
Hybrid reasoning in the CARE middleware for context awareness

International Journal of Web Engineering and Technology
Extended RDF as a semantic foundation of rule markup languages

Journal of Artificial Intelligence Research
MWeb: A principled framework for modular web rule bases and its semantics

ACM Transactions on Computational Logic (TOCL)
Combining ontologies with domain specific languages: a case study from network configuration software

ReasoningWeb'10 Proceedings of the 6th international conference on Semantic technologies for software engineering
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
Virtual knowledge communities for semantic agents

Proceedings of the International Conference on Web Intelligence, Mining and Semantics
A proposal for transactions in the semantic web

EPIA'11 Proceedings of the 15th Portugese conference on Progress in artificial intelligence
Towards semantic modeling of network physical devices

MODELS'09 Proceedings of the 2009 international conference on Models in Software Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper general mechanisms and syntactic restrictions are explored in order to specify and merge rule bases in the Semantic Web. Rule bases are expressed by extended logic programs having two forms of negation, namely strong (or explicit) and weak (also known as default negation or negation-as-failure). The proposed mechanisms are defined by very simple modular program transformations, and integrate both open and closed world reasoning. These program transformations are shown to be appropriate for the two major semantics for extended logic programs: answer set semantics and well-founded semantics with explicit negation. Moreover, the results obtained by both semantics are compared.