loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Kiyoshi Akama 1 and Ekawit Nantajeewarawat 2

Affiliations: 1 Hokkaido University, Japan ; 2 Thammasat University, Thailand

Keyword(s): Question-answering Problems, Proof Problems, Equivalent Transformation, Solving Logical Problems.

Related Ontology Subjects/Areas/Topics: Artificial Intelligence ; Enterprise Software Technologies ; Intelligent Problem Solving ; Knowledge Engineering and Ontology Development ; Knowledge Representation ; Knowledge-Based Systems ; Software Engineering ; Symbolic Systems

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 eq uivalent transformation principle is presented. Application of the procedure to the two problem classes is illustrated. (More)

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 18.232.66.188

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
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 (IC3K 2013) - KEOD; ISBN 978-989-8565-81-5; ISSN 2184-3228, SciTePress, pages 253-260. DOI: 10.5220/0004546202530260

@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 (IC3K 2013) - KEOD},
year={2013},
pages={253-260},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004546202530260},
isbn={978-989-8565-81-5},
issn={2184-3228},
}

TY - CONF

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