Authors:
Kiyoshi Akama
1
;
Ekawit Nantajeewarawat
2
and
Taketo Akama
3
Affiliations:
1
Information Initiative Center, Hokkaido University, Sapporo and Japan
;
2
Computer Science, Sirindhorn International Institute of Technology, Thammasat University, Pathumthani and Thailand
;
3
Modeleet Labs, Sapporo and Japan
Keyword(s):
Model-Intersection Problem, Extended Clause, Equivalent Transformation, Side-Change Transformation, Computation Control.
Related
Ontology
Subjects/Areas/Topics:
Artificial Intelligence
;
Knowledge Engineering and Ontology Development
;
Knowledge Representation
;
Knowledge-Based Systems
;
Symbolic Systems
Abstract:
Many logical problems, such as proof problems and query-answering problems, can be mapped into model-intersection (MI) problems, which constitute one of the largest and most fundamentally important classes of logical problems. To solve MI problems, many equivalent transformation rules have been employed. In this paper, we introduce a new transformation, called side-change transformation, and propose unfolding/side-change computation control, i.e., when neither unfolding nor definite-clause removal is applicable, an attempt is made to transform a given problem using side-change transformation so as to derive an equivalent problem to which unfolding is applicable. The correctness of side-change transformation is shown. While a resolution-based proof method increases problem size monotonically no matter what control is taken, a reduction of problem size can often be achieved by using the unfolding/side-change control.