Keyword(s):Model-Intersection Problem, Query-Answering Problem, Equivalent Transformation, Problem Solving.

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

Abstract: A model-intersection problem (MI problem) is a pair of a set of clauses and an exit mapping. We define MI
problems on specialization systems, which include many useful classes of logical problems, such as proof
problems on first-order logic and query-answering (QA) problems in pure Prolog and deductive databases.
The theory presented in this paper makes clear the central and fundamental structure of representation and
computation for many classes of logical problems by (i) axiomatization and (ii) equivalent transformation.
Clauses in this theory are constructed based on abstract atoms and abstract operation on them, which can be
used for representation of many specific subclasses of problems with concrete syntax. Various computation
can be realized by repeated application of many equivalent transformation rules, allowing many possible
computation procedures, for instance, computation procedures based on resolution and unfolding. This theory
can also be useful for inventing solutions for new classes of logical problems.(More)

A model-intersection problem (MI problem) is a pair of a set of clauses and an exit mapping. We define MI problems on specialization systems, which include many useful classes of logical problems, such as proof problems on first-order logic and query-answering (QA) problems in pure Prolog and deductive databases. The theory presented in this paper makes clear the central and fundamental structure of representation and computation for many classes of logical problems by (i) axiomatization and (ii) equivalent transformation. Clauses in this theory are constructed based on abstract atoms and abstract operation on them, which can be used for representation of many specific subclasses of problems with concrete syntax. Various computation can be realized by repeated application of many equivalent transformation rules, allowing many possible computation procedures, for instance, computation procedures based on resolution and unfolding. This theory can also be useful for inventing solutions for new classes of logical problems.

Guests can use SciTePress Digital Library without having a SciTePress account. However, guests have limited access to downloading full text versions of papers and no access to special options.

Guests can use SciTePress Digital Library without having a SciTePress account. However, guests have limited access to downloading full text versions of papers and no access to special options.

Akama, K. and Nantajeewarawat, E. (2015). A General Schema for Solving Model-Intersection Problems on a Specialization System by Equivalent Transformation.In Proceedings of the 7th International Joint Conference on Knowledge Discovery, Knowledge Engineering and Knowledge Management - Volume 2: KEOD, (IC3K 2015) ISBN 978-989-758-158-8, pages 38-49. DOI: 10.5220/0005597000380049

@conference{keod15, author={Kiyoshi Akama. and Ekawit Nantajeewarawat.}, title={A General Schema for Solving Model-Intersection Problems on a Specialization System by Equivalent Transformation}, booktitle={Proceedings of the 7th International Joint Conference on Knowledge Discovery, Knowledge Engineering and Knowledge Management - Volume 2: KEOD, (IC3K 2015)}, year={2015}, pages={38-49}, publisher={SciTePress}, organization={INSTICC}, doi={10.5220/0005597000380049}, isbn={978-989-758-158-8}, }

TY - CONF

JO - Proceedings of the 7th International Joint Conference on Knowledge Discovery, Knowledge Engineering and Knowledge Management - Volume 2: KEOD, (IC3K 2015) TI - A General Schema for Solving Model-Intersection Problems on a Specialization System by Equivalent Transformation SN - 978-989-758-158-8 AU - Akama, K. AU - Nantajeewarawat, E. PY - 2015 SP - 38 EP - 49 DO - 10.5220/0005597000380049