Decidable Order-Sorted Logic Programming for Ontologies and Rules with Argument Restructuring

Presented at: 8th International Semantic Web Conference (ISWC2009)

by Ken Kaneiwa, Philip Nguyen

Webpage: http://data.semanticweb.org/pdfs/iswc/2009/paper152.pdf
Webpage: http://dx.doi.org/10.1007/978-3-642-04930-9_21
Webpage: http://www.springerlink.com/content/uh32187455125n37

This paper presents a decidable fragment for combining ontologies andrules in order-sorted logic programming. We describe order-sortedlogic programming with sort, predicate, and meta-predicate hierarchiesfor deriving predicate and meta-predicate assertions. Meta-levelpredicates (predicates of predicates) are useful for representingrelationships between predicate formulas, and further, theyconceptually yield a hierarchy similar to the hierarchies of sorts andpredicates. By extending the order-sorted Horn-clause calculus, wedevelop a query-answering system that can answer queries such as atomsand meta-atoms generalized by containing predicate variables. We showthat the expressive query-answering system computes every generalizedquery in single exponential time, i.e., the complexity of our querysystem is equal to that of DATALOG.

Decidable Order-Sorted Logic Programming for Ontologies and Rules with Argument Restructuring was presented at this event.

Keywords: Semantic Web


Resource URI on the dog food server: http://data.semanticweb.org/conference/iswc/2009/paper/research/152


Explore this resource elsewhere: