Abstract
Proof problems have long been the main target for logical problem solving. A problem in this class is a “yes/no” problem concerning with checking whether one logical formula is a logical consequence of another logical formula. Meanwhile, the importance of anther class of problems, query-answering problems (QA problems), has been increasingly recognized. A QA problem is an “all-answers finding” problem concerning with finding all ground instances of a query atomic formula that are logical consequences of a given logical formula. Several specific subclasses of QA problems have been addressed based on solution techniques for proof problems, without success of finding general solutions. In order to establish solution methods for proof problems and QA problems, we integrate these two classes of problems by embedding proof problems into QA problems. Construction of low-cost embedding mappings from proof problems to QA problems is demonstrated. By such embedding, proof problems can be solved using a procedure for solving QA problems. A procedure for solving QA problems based on equivalent transformation is presented. The presented work provides a new framework for integration of proof problems and QA problems and a solution for them by the general principle of equivalent transformation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Akama, K., Nantajeewarawat, E.: Meaning-preserving skolemization. In: 2011 International Conference on Knowledge Engineering and Ontology Development, Paris, France, pp. 322–327 (2011)
Akama, K., Nantajeewarawat, E.: Proving theorems based on equivalent transformation using resolution and factoring. In: 2nd World Congress on Information and Communication Technologies, Trivandrum, India, pp. 7–12 (2012)
Akama, K., Nantajeewarawat, E.: Embedding proof problems into query-answering problems and problem solving by equivalent transformation. Technical report, Hokkaido University, Sapporo, Japan (2013)
Beth, E.W.: Semantic Entailment and Formal Derivability. Noord-Hollandsche Uitg. Mij, Amsterdam (1955)
Chang, C.-L., Lee, R.C.-T.: Symbolic Logic and Mechanical Theorem Proving. Academic Press, New York (1973)
Fitting, M.: First-Order Logic and Automated Theorem Proving, 2nd edn. Springer, New York (1996)
Gallier, J.H.: Logic for Computer Science: Foundations of Automatic Theorem Proving. Wiley, New York (1986)
Lloyd, J.W.: Foundations of Logic Programming, 2nd edn. Springer, Heidelberg (1987)
Motik, B., Sattler, U., Studer, R.: Query answering for OWL-DL with rules. J. Web Semant. 3, 41–60 (2005)
Newborn, M.: Automated Theorem Proving: Theory and Practice. Springer, New York (2000)
Robinson, J.A.: A machine-oriented logic based on the resolution principle. J. ACM 12, 23–41 (1965)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Akama, K., Nantajeewarawat, E. (2015). Integration of and a Solution for Proof Problems and Query-Answering Problems. In: Fred, A., Dietz, J., Liu, K., Filipe, J. (eds) Knowledge Discovery, Knowledge Engineering and Knowledge Management. IC3K 2013. Communications in Computer and Information Science, vol 454. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-46549-3_14
Download citation
DOI: https://doi.org/10.1007/978-3-662-46549-3_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-46548-6
Online ISBN: 978-3-662-46549-3
eBook Packages: Computer ScienceComputer Science (R0)