doi: 10.7763/IJFCC.2012.V1.2
Conjunction-Based Clauses for Equivalent Transformation of Query-Answering Problems
Kiyoshi Akama
1
,
- 1 Information Initiative Center, Hokkaido University, Japan.
- 2 Sirindhorn International Institute of Technology, Thammasat University, Thailand.
Abstract
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.
Keywords
- Query-answering problem
- equivalent transformation
- conjunction-based clause
- representative set
- forwarding transformation
How to Cite
Kiyoshi Akama and Ekawit Nantajeewarawat, "Conjunction-Based Clauses for Equivalent Transformation of Query-Answering Problems," International Journal of Future Computer and Communication, vol. 1, no. 1, pp. 5-8, 2012. https://doi.org/ 10.7763/IJFCC.2012.V1.2
Copyright & License
Copyright © 2012 by the authors. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).