Embedding Proof Problems into Query-answering Problems and Problem Solving by Equivalent Transformation

Kiyoshi Akama, Ekawit Nantajeewarawat

2013

Abstract

A proof problem is a “yes/no” problem concerning with checking whether one logical formula is a logical consequence of another logical formula, while a query-answering problem (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. In order to establish a precise relation between these two problem classes, the concept of an embedding mapping is introduced. When one problem class can be embedded into another problem class at low computational cost, the former class can be regarded as a subclass of the latter class and, consequently, problems in the former class can be solved through a method for solving problems in the latter one. 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 the equivalent transformation principle is presented. Application of the procedure to the two problem classes is illustrated.

References

  1. Akama, K. and Nantajeewarawat, E. (2011). MeaningPreserving Skolemization. In Proceedings of the 2011 International Conference on Knowledge Engineering and Ontology Development, KEOD 2011, pages 322- 327.
  2. Akama, K. and Nantajeewarawat, E. (2012). Proving Theorems Based on Equivalent Transformation Using Resolution and Factoring. In Proceedings of the Second World Congress on Information and Communication Technologies, WICT 2012, pages 7-12.
  3. Akama, K. and Nantajeewarawat, E. (2013). Embedding Proof Problems into Query-Answering Problems and Problem Solving by Equivalent Transformation. Technical report, Hokkaido University, Sapporo, Japan.
  4. Beth, E. W. (1955). Semantic Entailment and Formal Derivability. Amsterdam : Noord-Hollandsche Uitg. Mij.
  5. Chang, C.-L. and Lee, R. C.-T. (1973). Symbolic Logic and Mechanical Theorem Proving. Academic Press.
  6. Fitting, M. (1996). First-Order Logic and Automated Theorem Proving. Springer-Verlag, second edition.
  7. Gallier, J. H. (1986). Logic for Computer Science: Foundations of Automatic Theorem Proving. Wiley.
  8. Lloyd, J. W. (1987). Foundations of Logic Programming. Springer-Verlag, second, extended edition.
  9. Motik, B., Sattler, U., and Studer, R. (2005). Query Answering for OWL-DL with Rules. Journal of Web Semantics, 3(1):41-60.
  10. Newborn, M. (2000). Automated Theorem Proving: Theory and Practice. Springer-Verlag.
  11. Robinson, J. A. (1965). A Machine-Oriented Logic Based on the Resolution Principle. Journal of the ACM, 12:23-41.
Download


Paper Citation


in Harvard Style

Akama K. and Nantajeewarawat E. (2013). Embedding Proof Problems into Query-answering Problems and Problem Solving by Equivalent Transformation . In Proceedings of the International Conference on Knowledge Engineering and Ontology Development - Volume 1: KEOD, (IC3K 2013) ISBN 978-989-8565-81-5, pages 253-260. DOI: 10.5220/0004546202530260


in Bibtex Style

@conference{keod13,
author={Kiyoshi Akama and Ekawit Nantajeewarawat},
title={Embedding Proof Problems into Query-answering Problems and Problem Solving by Equivalent Transformation},
booktitle={Proceedings of the International Conference on Knowledge Engineering and Ontology Development - Volume 1: KEOD, (IC3K 2013)},
year={2013},
pages={253-260},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004546202530260},
isbn={978-989-8565-81-5},
}


in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Knowledge Engineering and Ontology Development - Volume 1: KEOD, (IC3K 2013)
TI - Embedding Proof Problems into Query-answering Problems and Problem Solving by Equivalent Transformation
SN - 978-989-8565-81-5
AU - Akama K.
AU - Nantajeewarawat E.
PY - 2013
SP - 253
EP - 260
DO - 10.5220/0004546202530260