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 problems and query-answering problems on first-order logic with built-in constraint atoms.
[1]
Keith L. Clark,et al.
Negation as Failure
,
1987,
Logic and Data Bases.
[2]
Michael Gelfond,et al.
Classical negation in logic programs and disjunctive databases
,
1991,
New Generation Computing.
[3]
Melvin Fitting,et al.
First-Order Logic and Automated Theorem Proving
,
1990,
Graduate Texts in Computer Science.
[4]
Kiyoshi Akama,et al.
Construction of Logical Structures on Specialization Systems
,
2011,
2011 World Congress on Information and Communication Technologies.
[5]
Kiyoshi Akama,et al.
Meaning-preserving Skolemization
,
2011,
KEOD.
[6]
Kiyoshi Akama,et al.
A General Schema for Solving Model-Intersection Problems on a Specialization System by Equivalent Transformation
,
2015,
KEOD.
[7]
John Wylie Lloyd,et al.
Foundations of Logic Programming
,
1987,
Symbolic Computation.