Conjunction-Based Clauses for Equivalent Transformation of Query-Answering Problems - Volume 1 Number 1 (Jun. 2012) - IJFCC
  • Aug 09, 2018 News![CFP] The annual meeting of IJFCC Editorial Board, ICCTD 2019, will be held in Prague, Czech Republic during March 2-4, 2019.   [Click]
  • Aug 09, 2018 News!IJFCC Vol. 6, No. 1-No. 3 has been indexed by EI (Inspec).   [Click]
  • Aug 09, 2018 News!IJFCC Vol. 5, No. 6 has been indexed by EI (Inspec).   [Click]
General Information
    • ISSN: 2010-3751
    • Frequency: Bimonthly (2012-2016); Quarterly (Since 2017)
    • DOI: 10.18178/IJFCC
    • Editor-in-Chief: Prof. Mohamed Othman
    • Executive Editor: Ms. Cherry L. Chan
    • Abstracting/ Indexing: Google Scholar,  Crossref, Electronic Journals LibraryEI (INSPEC, IET), etc.
    • E-mail:  ijfcc@ejournal.net 
Editor-in-chief
Prof. Mohamed Othman
Department of Communication Technology and Network Universiti Putra Malaysia, Malaysia
It is my honor to be the editor-in-chief of IJFCC. The journal publishes good papers in the field of future computer and communication. Hopefully, IJFCC will become a recognized journal among the readers in the filed of future computer and communication.
IJFCC 2012 Vol.1(1): 5-8 ISSN: 2010-3751
DOI: 10.7763/IJFCC.2012.V1.2

Conjunction-Based Clauses for Equivalent Transformation of Query-Answering Problems

Kiyoshi Akama and Ekawit Nantajeewarawat

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.

Index Terms—Query-answering problem, equivalent transformation, conjunction-based clause, representative set, forwarding transformation.

Kiyoshi Akama is with the Information Initiative Center, Hokkaido University, Japan (e-mail: akama@iic.hokudai.ac.jp).
Ekawit Nantajeewarawat is with the Sirindhorn International Institute of Technology, Thammasat University, Thailand.

[PDF]

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.

Copyright © 2008-2018. International Journal of Future Computer and Communication. All rights reserved.
E-mail: ijfcc@ejournal.net