Abstract
This paper presents a decidable fragment for combining ontologies and rules in order-sorted logic programming. We describe order-sorted logic programming with sort, predicate, and meta-predicate hierarchies for deriving predicate and meta-predicate assertions. Meta-level predicates (predicates of predicates) are useful for representing relationships between predicate formulas, and further, they conceptually yield a hierarchy similar to the hierarchies of sorts and predicates. By extending the order-sorted Horn-clause calculus, we develop a query-answering system that can answer queries such as atoms and meta-atoms generalized by containing predicate variables. We show that the expressive query-answering system computes every generalized query in single exponential time, i.e., the complexity of our query system is equal to that of DATALOG.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Chen, W., Kifer, M.: Sorted HiLog: Sorts in higher-order logic data languages. In: Y. Vardi, M., Gottlob, G. (eds.) ICDT 1995. LNCS, vol. 893, pp. 252–265. Springer, Heidelberg (1995)
Cohn, A.G.: Taxonomic reasoning with many sorted logics. Artificial Intelligence Review 3, 89–128 (1989)
Dantsin, E., Eiter, T., Gottlob, G., Voronkov, A.: Complexity and expressive power of logic programming. In: IEEE Conference on Computational Complexity, pp. 82–101 (1997)
Doets, K.: From Logic to Logic Programming. MIT Press, Cambridge (1994)
Grosof, B., Horrocks, I., Volz, R., Decker, S.: Description Logic Programs: Combining Logic Programs with Description Logics. In: Proc. of the Twelfth International World Wide Web Conference (WWW 2003), Budapest, Hungary (2003)
Hanus, M.: Logic programming with type specifications. In: Pfenning, F. (ed.) Types in Logic Programming. The MIT Press, Cambridge (1992)
Hitzler, P., Parsia, B.: Ontologies and rules. In: Staab, S., Studer, R. (eds.) Handbook on Ontologies, 2nd edn. (2009)
Horrocks, I., Patel-Schneider, P.F.: A proposal for an owl rules language. In: Proc. of the Thirteenth International World Wide Web Conference (WWW 2004), pp. 723–731. ACM, New York (2004)
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 Recommendation, http://www.w3.org/submission/swrl/
Jouannaud, J.-P., Okada, M.: Satisfiability of systems of ordinal notations with the subterm property is decidable. In: Leach Albert, J., Monien, B., Rodríguez-Artalejo, M. (eds.) ICALP 1991. LNCS, vol. 510, pp. 455–468. Springer, Heidelberg (1991)
Kaneiwa, K.: Order-sorted logic programming with predicate hierarchy. Artificial Intelligence 158(2), 155–188 (2004)
Kaneiwa, K., Mizoguchi, R.: An order-sorted quantified modal logic for meta-ontology. In: Beckert, B. (ed.) TABLEAUX 2005. LNCS (LNAI), vol. 3702, pp. 169–184. Springer, Heidelberg (2005)
Kaneiwa, K., Mizoguchi, R.: Distributed reasoning with ontologies and rules in order-sorted logic programming. In: Journal of Web Semantics (in press, 2009)
Krötzsch, M., Rudolph, S., Hitzler, P.: ELP: Tractable rules for OWL 2. In: Sheth, A.P., Staab, S., Dean, M., Paolucci, M., Maynard, D., Finin, T., Thirunarayan, K. (eds.) ISWC 2008. LNCS, vol. 5318, pp. 649–664. Springer, Heidelberg (2008)
Lloyd, J.W.: Foundations of Logic Programming. Springer, Heidelberg (1987)
Motik, B.: On the Properties of Metamodeling in OWL. Journal of Logic and Computation 17(4), 617–637 (2007)
Nguyen, P.H.P., Kaneiwa, K., Corbett, D.R., Nguyen, M.-Q.: An ontology formalization of relation type hierarchy in conceptual structure theory. In: Wobcke, W., Zhang, M. (eds.) AI 2008. LNCS (LNAI), vol. 5360, pp. 79–85. Springer, Heidelberg (2008)
Patel-Schneider, P.F., Hayes, P., Horrocks, I.: OWL Web Ontology Language Semantics and Abstract Syntax, W3C Recommendation, http://www.w3.org/tr/2004/rec-owl-semantics-20040210/
Rosati, R.: On the decidability and complexity of integrating ontologies and rules. Journal of Web Semantics 3(1), 41–60 (2005)
Socher-Ambrosius, R., Johann, P.: Deduction Systems. Springer, Heidelberg (1996)
Woods, W., Schmolze, J.: The KL-ONE family. Computers and Mathematics with Applications, Special Issue on Semantic Networks in Artificial Intelligence, Part 1 23(2–5), 133–178 (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kaneiwa, K., Nguyen, P.H.P. (2009). Decidable Order-Sorted Logic Programming for Ontologies and Rules with Argument Restructuring. In: Bernstein, A., et al. The Semantic Web - ISWC 2009. ISWC 2009. Lecture Notes in Computer Science, vol 5823. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04930-9_21
Download citation
DOI: https://doi.org/10.1007/978-3-642-04930-9_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04929-3
Online ISBN: 978-3-642-04930-9
eBook Packages: Computer ScienceComputer Science (R0)