Authors:
Kiyoshi Akama
1
and
Ekawit Nantajeewarawat
2
Affiliations:
1
Information Initiative Center and Hokkaido University, Japan
;
2
Sirindhorn International Institute of Technology and Thammasat University, Thailand
Keyword(s):
Unfolding, Extended Clause, Function Variable, Model-intersection Problem, Equivalent Transformation.
Related
Ontology
Subjects/Areas/Topics:
Artificial Intelligence
;
Knowledge Engineering and Ontology Development
;
Knowledge Representation
;
Knowledge-Based Systems
;
Symbolic Systems
Abstract:
Conventional theories cannot solve many logical problems due to the limitations of the underlying clause space. In conventional clauses, all variables are universally quantified and no existential quantification is allowed. Conventional clauses are therefore not sufficiently expressive for representing first-order formulas. To extend clauses with the expressive power of existential quantification, variables of a new type, called function variables, have been introduced, resulting in a new space of extended clauses, called ECLS_F. This new space is necessary to overcome the limitations of the conventional clause space. To solve problems on ECLS_F, many equivalent transformation rules are used. We formally defined unfolding transformation on ECLS_F, which is applicable not only to definite clauses but also to multi-head clauses. The proposed unfolding transformation preserves the answers to model-intersection problems and is useful for solving many logical problems such as proof proble
ms and query-answering problems on first-order logic with built-in constraint atoms.
(More)