Share Email Print
cover

Proceedings Paper

Simplifying query-answering problems by unfolding
Author(s): Kiyoshi Akama; Ekawit Nantajeewarawat
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

To convert a first-order formula containing an existential quantification into an equivalent clausal normal form, it is necessary to introduce function variables and accordingly extend the space of first-order formulas. This paper proposes unfolding transformation in such an extended formula space and demonstrates how it is employed to simplify queryanswering problems. The presented work provides a foundation for constructing a correct method for solving queryanswering problems that include unrestricted use of universal and existential quantifications.

Paper Details

Date Published: 13 January 2012
PDF: 5 pages
Proc. SPIE 8350, Fourth International Conference on Machine Vision (ICMV 2011): Computer Vision and Image Analysis; Pattern Recognition and Basic Technologies, 835033 (13 January 2012); doi: 10.1117/12.920621
Show Author Affiliations
Kiyoshi Akama, Hokkaido Univ. (Japan)
Ekawit Nantajeewarawat, Thammasat Univ. (Thailand)


Published in SPIE Proceedings Vol. 8350:
Fourth International Conference on Machine Vision (ICMV 2011): Computer Vision and Image Analysis; Pattern Recognition and Basic Technologies

© SPIE. Terms of Use
Back to Top