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.
This research has been partially funded by European Commission and by the Swiss Federal Office for Education and Science within the 6th Framework Programme project REWERSE number 506779 (cf. http://rewerse.net)
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alferes, J.J., Damásio, C.V., Pereira, L.M.: A logic programming system for non-monotonic reasoning. Journal of Automated Reasoning 14(1), 93–147 (1995)
Analyti, A., Antoniou, G., Damásio, C.V., Wagner, G.: Stable Model Theory for Extended RDF Ontologies. In: 4th Int. Semantic Web Conf., pp. 21–36 (2005)
Berners-Lee, T., Hendler, J., Lassila, O.: The semantic web. Scientific American (May 2001)
Bugliesi, M., Lamma, E., Mello, P.: Modularity in logic programming. Journal of Logic Programming 12(1) (1993)
CWM-closed world machine, http://www.w3.org/2000/10/swap/doc/cwm.html
Damásio, C.V., Pereira, L.M.: A survey of paraconsistent semantics for logic programs. In: Gabbay, D., Smets, P. (eds.) Handbook of Defeasible Reasoning and Uncertainty Management Systems, vol. 2, pp. 241–320. Kluwer, Dordrecht (1998)
Duerst, Suignard: Internationalized Resource Identifiers. RFC 3987 (January 2005)
Eiter, T., Ianni, G., Schindlauer, R., Tompits, H.: A uniform integration of higher-order reasoning and external evaluations in answer-set programming. In: Proc. of IJCAI 2005, pp. 90–96. Professional Book Center (2005)
Gavriloaie, R., Nejdl, W., Olmedilla, D., Seamons, K.E., Winslett, M.: No registration needed: How to use declarative policies and negotiation to access sensitive resources on the semantic web. In: Bussler, C.J., Davies, J., Fensel, D., Studer, R. (eds.) ESWS 2004. LNCS, vol. 3053, pp. 342–356. Springer, Heidelberg (2004)
Gelfond, M., Lifschitz, V.: Logic programs with classical negation. In: Warren, Szeredi (eds.) Proc. of 7th ICLP, pp. 579–597. MIT Press, Cambridge (1990)
Heflin, J., Avila, H.M.: Lcw-based agent planning for the semantic web. In: Ontologies and the Semantic Web. WS-02-11, pp. 63–70. AAAI Press, Menlo Park (2002)
Herre, H., Jaspars, J., Wagner, G.: Partial Logics with Two Kinds of Negation as a Foundation of Knowledge-Based Reasoning. In: Gabbay, D.M., Wansing, H. (eds.) What Is Negation? Kluwer Academic Publishers, Dordrecht (1999)
Horrocks, I., Patel-Schneider, P.F., Boley, H., Tabet, S., Grosof, B., Dean, M.: SWRL: A semantic web rule language combining OWL and RuleML. W3C Member Submission (May 21, 2004)
Kifer, M., de Bruijn, J., Boley, H., Fensel, D.: A realistic architecture for the semantic web. In: Adi, A., Stoutenburg, S., Tabet, S. (eds.) RuleML 2005. LNCS, vol. 3791, pp. 17–29. Springer, Heidelberg (2005)
Pereira, L.M., Alferes, J.J.: Well founded semantics for logic programs with explicit negation. In: Neumann, B. (ed.) ECAI 1992, pp. 102–106. John Wiley & Sons, Chichester (1992)
The rule interchange WG charter, http://www.w3.org/2005/rules/wg/charter
The Rule Markup Initiative (RuleML). available at: http://www.ruleml.org
Sagonas, K., Swift, T., Warren, D.S.: XSB as an efficient deductive database engine. In: Proc. of SIGMOD 1994 Conference. ACM, New York (1994)
Sakama, C., Inoue, K.: Paraconsistent Stable Semantics for extended disjunctive programs. Journal of Logic and Computation 5(3), 265–285 (1995)
Shepherdson, J.: Negation in logic programming for general logic programs. In: Minker, J. (ed.) Found. of Ded. Databases and Logic Programming, pp. 19–88. Morgan Kaufmann, San Francisco (1988)
Shepherdson, J.C.: Negation as failure: a comparison of Clark’s completed data base and Reiter’s CWA. Journal of Logic Programming 1(1), 51–79 (1984)
Sintek, M., Decker, S.: TRIPLE - A Query, Inference, and Transformation Language for the Semantic Web. In: Horrocks, I., Hendler, J. (eds.) ISWC 2002. LNCS, vol. 2342, pp. 364–378. Springer, Heidelberg (2002)
Wagner, G.: Web Rules Need Two Kinds of Negation. In: Bry, F., Henze, N., Małuszyński, J. (eds.) PPSWR 2003. LNCS, vol. 2901, pp. 33–50. Springer, Heidelberg (2003)
Yang, G., Kifer, M., Zhao, C.: Flora-2: A Rule-Based Know. Representation and Inference Infrastructure for the Sem. Web. In: Meersman, R., Tari, Z., Schmidt, D.C. (eds.) CoopIS 2003, DOA 2003, and ODBASE 2003. LNCS, vol. 2888, pp. 671–688. Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Damásio, C.V., Analyti, A., Antoniou, G., Wagner, G. (2006). Supporting Open and Closed World Reasoning on the Web. In: Alferes, J.J., Bailey, J., May, W., Schwertel, U. (eds) Principles and Practice of Semantic Web Reasoning. PPSWR 2006. Lecture Notes in Computer Science, vol 4187. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11853107_11
Download citation
DOI: https://doi.org/10.1007/11853107_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-39586-7
Online ISBN: 978-3-540-39587-4
eBook Packages: Computer ScienceComputer Science (R0)