Conjunction-Based Clauses for Equivalent Transformationof Query-Answering Problems

This paper introduces a class of conjunction-based clauses with function variables and their semantics, with an aim to provide a larger problem-transformation space that seamlessly supports both top-down computation and bottom-up computation. A representative set of the collection of all models of a set of conjunction-based clauses is formulated. Two types of equivalent transformation on conjunction-based clauses, i.e., unfolding and forwarding, are presented and their application is illustrated. The presented work provides a foundation for constructing a correct method for solving query-answering problems.

[1]  Kiyoshi Akama,et al.  Meaning-preserving Skolemization , 2011, KEOD.

[2]  Boris Motik,et al.  Query Answering for OWL-DL with Rules , 2004, International Semantic Web Conference.

[3]  Kiyoshi Akama,et al.  Formalization of the Equivalent Transformation Computation Model , 2006, J. Adv. Comput. Intell. Intell. Informatics.

[4]  John Wylie Lloyd,et al.  Foundations of Logic Programming , 1987, Symbolic Computation.

[5]  Ian Horrocks,et al.  OWL rules: A proposal and prototype implementation , 2005, J. Web Semant..

[6]  Richard C. T. Lee,et al.  Symbolic logic and mechanical theorem proving , 1973, Computer science classics.