13 January 2012 Simplifying query-answering problems by unfolding
Author Affiliations +
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.
© (2012) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Kiyoshi Akama, Kiyoshi Akama, Ekawit Nantajeewarawat, Ekawit Nantajeewarawat, "Simplifying query-answering problems by unfolding", 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; https://doi.org/10.1117/12.920621

Back to Top