loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Kiyoshi Akama and Ekawit Nantajeewarawat

Affiliation: Hokkaido University, Japan

Keyword(s): Equivalent Transformation, Query-answering Problems, Unfolding, Skolemization, Extended Clauses.

Related Ontology Subjects/Areas/Topics: Artificial Intelligence ; Knowledge Engineering and Ontology Development ; Knowledge Representation ; Knowledge-Based Systems ; Symbolic Systems

Abstract: A query-answering problem (QA problem) is concerned with finding all ground instances of a query atomic formula that are logical consequences of a given logical formula describing the background knowledge of the problem. A method for solving QA problems on full first-order logic has been invented based on the equivalent transformation (ET) principle, where a given QA problem on first-order logic is converted into a QA problem on extended clauses and is then further transformed repeatedly and equivalently into simpler forms until its answer set can be readily obtained. In this paper, such a clause-based solution is extended by proposing a new method for effectively utilizing a universally quantified if-and-only-if statement defining a predicate, which is called an iff-formula. The background knowledge of a given QA problem is separated into two parts: (i) a conjunction of iff-formulas and (ii) other types of knowledge. Special ET rules for manipulating iffformulas are introduced. The new solution method deals with both iff-knowledge in first-order logic and a set of extended clauses. Application of this solution method 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 3.15.145.50

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. (2014). Solving Query-answering Problems with If-and-Only-If Formulas. In Proceedings of the International Conference on Knowledge Engineering and Ontology Development (IC3K 2014) - KEOD; ISBN 978-989-758-049-9; ISSN 2184-3228, SciTePress, pages 333-344. DOI: 10.5220/0005097903330344

@conference{keod14,
author={Kiyoshi Akama. and Ekawit Nantajeewarawat.},
title={Solving Query-answering Problems with If-and-Only-If Formulas},
booktitle={Proceedings of the International Conference on Knowledge Engineering and Ontology Development (IC3K 2014) - KEOD},
year={2014},
pages={333-344},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005097903330344},
isbn={978-989-758-049-9},
issn={2184-3228},
}

TY - CONF

JO - Proceedings of the International Conference on Knowledge Engineering and Ontology Development (IC3K 2014) - KEOD
TI - Solving Query-answering Problems with If-and-Only-If Formulas
SN - 978-989-758-049-9
IS - 2184-3228
AU - Akama, K.
AU - Nantajeewarawat, E.
PY - 2014
SP - 333
EP - 344
DO - 10.5220/0005097903330344
PB - SciTePress

- Science and Technology Publications, Lda.
RESOURCES

Proceedings

Papers

Authors

Ontology

CONTACTS

Science and Technology Publications, Lda
Avenida de S. Francisco Xavier, Lote 7 Cv. C,
2900-616 Setúbal, Portugal.

Phone: +351 265 520 185 (National fixed network call)
Fax: +351 265 520 186
Email: info@scitepress.org

EXTERNAL LINKS

PRIMORIS

INSTICC

SCITEVENTS

CROSSREF

PROCEEDINGS SUBMITTED FOR INDEXATION BY:

dblp

Ei Compendex

SCOPUS

Semantic Scholar

Google Scholar

Microsoft Academic