The famous proof method by the conventional Skolemization and resolution has a serious limitation. It does
not guarantee the correctness of proving theorems in the presence of built-in constraints. In order to understand
this difficulty, we use meaning-preserving Skolemization (MPS) and equivalent transformation (ET), which
together provide a general framework for solving query-answering (QA) problems on first-order logic. We
introduce a rule for function variable elimination (FVE), by which we regard the conventional Skolemization
as a kind of the composition of MPS and FVE. We prove that the FVE rule preserves the answers to a class
of QA problems consisting of only user-defined atoms, while we cannot prove it in the presence of built-in
constraints. By avoiding the application of the FVE rule in MPS & ET computation, we obtain a more general
solution for proof problems, which guarantees the correctness of computation even in the presence of built-in
constraints.
[1]
Kiyoshi Akama,et al.
Embedding Proof Problems into Query-answering Problems and Problem Solving by Equivalent Transformation
,
2013,
KEOD.
[2]
K. Akama,et al.
Proving theorems based on equivalent transformation using resolution and factoring
,
2012,
2012 World Congress on Information and Communication Technologies.
[3]
Kiyoshi Akama,et al.
Meaning-preserving Skolemization
,
2011,
KEOD.
[4]
J. A. Robinson,et al.
A Machine-Oriented Logic Based on the Resolution Principle
,
1965,
JACM.
[5]
Kiyoshi Akama,et al.
Equivalent Transformation in an Extended Space for Solving Query-Answering Problems
,
2014,
ACIIDS.
[6]
Boris Motik,et al.
Query Answering for OWL-DL with Rules
,
2004,
SEMWEB.