Abstract
The problem of integration of rules and ontologies is addressed in a general framework based on the well-founded semantics of normal logic programs and inspired by the ideas of Constraint Logic Programming (CLP). Hybrid rules are defined as normal clauses extended with constraints in the bodies. The constraints are formulae in a language of a first order theory defined by a set \({\mathcal T}\) of axioms. Instances of the framework are obtained by specifying a language of constraints and providing \({\mathcal T}\). A hybrid program is a pair \(({\mathcal P,T})\) where \(\mathcal P\) is a finite set of hybrid rules. Thus integration of (non-disjunctive) Datalog with ontologies formalized in a Description Logic is covered as a special case.
The paper defines a declarative semantics of hybrid programs and a formal operational semantics. The latter can be seen as an extension of SLS-resolution and provides a basis for hybrid implementations combining Prolog with constraint solvers. In the restricted case of positive rules, hybrid programs are formulae of FOL. In that case the declarative semantics reduces to the standard notion of logical consequence. The operational semantics is sound and it is complete for a restricted class of hybrid programs.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Apt, K.R., Bol, R.N.: Logic programming and negation: A survey. J. Log. Program. 19/20, 9–71 (1994)
Baader, F., Calvanese, D., McGuiness, D., Nardi, D., Patel-Schneider, P. (eds.): The Description Logic Handbook. Cambridge University Press, Cambridge (2003)
Clark, K.: Negation as failure. In: Logic and Data Bases, pp. 293–322 (1978)
Donini, F., Lenzerini, M., Nardi, D., Schaerf, A.: AL-Log: Integrating datalog and description logics. Intelligent Information Systems 10(3), 227–252 (1998)
Drabent, W.: SLS-resolution without floundering. In: Pereira, L.M., Nerode, A. (eds.) Proc. 2nd International Workshop on Logic Programming and Non-Monotonic Reasoning, pp. 82–98. MIT Press, Cambridge, MA (1993)
Drabent, W.: What is failure? An approach to constructive negation. Acta Informatica 32(1), 27–59 (1995)
Drabent, W., Henriksson, J., Maluszynski, J.: Hybrid reasoning with rules and constraints under well-founded semantics. In: Marchiori, M., Pan, J.Z., de Sainte Marie, C. (eds.) RR 2007. LNCS, vol. 4524, pp. 348–357. Springer, Heidelberg (2007)
Eiter, T., Ianni, G., Schindlauer, R., Tompits, H.: Effective integration of declarative rules with external evaluations for semantic-web reasoning. In: Sure, Y., Domingue, J. (eds.) ESWC 2006. LNCS, vol. 4011, pp. 273–287. Springer, Heidelberg (2006)
Eiter, T., Lukasiewicz, T., Schindlauer, R., Tompits, H.: Combining answer set programming with description logics for the semantic web. In: Proc. of the International Conference of Knowledge Representation and Reasoning (KR’04) (2004)
Eiter, T., Lukasiewicz, T., Schindlauer, R., Tompits, H.: Well-founded semantics for description logic programs in the semantic web. In: Antoniou, G., Boley, H. (eds.) RuleML 2004. LNCS, vol. 3323, pp. 81–97. Springer, Heidelberg (2004)
Ferrand, G., Deransart, P.: Proof method of partial correctness and weak completeness for normal logic programs. J. Log. Program. 17(2/3&4), 265–278 (1993)
Marriott, K., Stuckey, P.J., Wallace, M.: Constraint logic programming. In: Handbook of Constraint Programming, Elsevier, Amsterdam (2006)
Motik, B., Rosati, R.: A faithful integration of description logics with logic programming. In: IJCAI, pp. 477–482 (2007)
Motik, B., Sattler, U., Studer, R.: Query answering for OWL-DL with rules. J. Web Sem. 3(1), 41–60 (2005)
Rosati, R.: On the decidability and complexity of integrating ontologies and rules. Journal of Web Semantics 3, 61–73 (2005)
Rosati, R.: DL+log: Tight integration of description logics and disjunctive datalog. In: Doherty, P., Mylopoulos, J., Welty, C.A. (eds.) KR, pp. 68–78. AAAI Press, California (2006)
Rosati, R.: Integrating ontologies and rules: Semantic and computational issues. In: Barahona, P., Bry, F., Franconi, E., Henze, N., Sattler, U. (eds.) Reasoning Web. LNCS, vol. 4126, pp. 128–151. Springer, Heidelberg (2006)
van Gelder, A., Ross, K.A., Schlipf, J.S.: Unfounded sets and well-founded semantics for general logic programs. In: Principles of Database Systems, pp. 221–230. ACM, New York (1988)
XSB: XSB Prolog. Available at http://xsb.sourceforge.net
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Drabent, W., Małuszyński, J. (2007). Well-Founded Semantics for Hybrid Rules. In: Marchiori, M., Pan, J.Z., Marie, C.d.S. (eds) Web Reasoning and Rule Systems. RR 2007. Lecture Notes in Computer Science, vol 4524. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72982-2_1
Download citation
DOI: https://doi.org/10.1007/978-3-540-72982-2_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72981-5
Online ISBN: 978-3-540-72982-2
eBook Packages: Computer ScienceComputer Science (R0)