Unfolding Existentially Quantified Sets of Extended Clauses

Kiyoshi Akama, Ekawit Nantajeewarawat

2016

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 problems and query-answering problems on first-order logic with built-in constraint atoms.

References

  1. Akama, K. and Nantajeewarawat, E. (2006). Logical Structures on Specialization Systems: Formalization and Satisfiability-Preserving Transformation. In Proceedings of the 7th International Conference on Intelligent Technologies, pages 100-109, Taipei, Taiwan.
  2. Akama, K. and Nantajeewarawat, E. (2011a). Construction of Logical Structures on Specialization Systems. In Proceedings of the 2011 World Congress on Information and Communication Technologies, WICT 2011, pages 1030-1035, Mumbai, India.
  3. Akama, K. and Nantajeewarawat, E. (2011b). MeaningPreserving Skolemization. In Proceedings of the 3rd International Conference on Knowledge Engineering and Ontology Development, pages 322-327, Paris, France.
  4. 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 (IC3K 2015), Volume 2: KEOD, pages 38-49, Lisbon, Portugal.
  5. Akama, K. and Nantajeewarawat, E. (2016). Unfolding Existentially Quantified Sets of Extended Clauses. Technical report, Information Initiative Center, Hokkaido University.
  6. Chang, C.-L. and Lee, R. C.-T. (1973). Symbolic Logic and Mechanical Theorem Proving. Academic Press.
  7. Clark, K. L. (1978). Negation as Failure. In Gallaire, H. and Minker, J., editors, Logic and Data Bases, pages 293-322. Plenum Press, New York.
  8. Fitting, M. (1996). First-Order Logic and Automated Theorem Proving. Springer-Verlag, second edition.
  9. Gelfond, M. and Lifschitz, V. (1988). The Stable Model Semantics for Logic Programming. In Proceedings of International Logic Programming Conference and Symposium, pages 1070-1080. MIT Press.
  10. Gelfond, M. and Lifschitz, V. (1991). Classical Negation in Logic Programs and Disjunctive Databases. New Generation Computing, 9:365-386.
  11. Lloyd, J. W. (1987). Foundations of Logic Programming. Springer-Verlag, second, extended edition.
Download


Paper Citation


in Harvard Style

Akama K. and Nantajeewarawat E. (2016). Unfolding Existentially Quantified Sets of Extended Clauses . In Proceedings of the 8th International Joint Conference on Knowledge Discovery, Knowledge Engineering and Knowledge Management - Volume 2: KEOD, (IC3K 2016) ISBN 978-989-758-203-5, pages 96-103. DOI: 10.5220/0006051500960103


in Bibtex Style

@conference{keod16,
author={Kiyoshi Akama and Ekawit Nantajeewarawat},
title={Unfolding Existentially Quantified Sets of Extended Clauses},
booktitle={Proceedings of the 8th International Joint Conference on Knowledge Discovery, Knowledge Engineering and Knowledge Management - Volume 2: KEOD, (IC3K 2016)},
year={2016},
pages={96-103},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006051500960103},
isbn={978-989-758-203-5},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 8th International Joint Conference on Knowledge Discovery, Knowledge Engineering and Knowledge Management - Volume 2: KEOD, (IC3K 2016)
TI - Unfolding Existentially Quantified Sets of Extended Clauses
SN - 978-989-758-203-5
AU - Akama K.
AU - Nantajeewarawat E.
PY - 2016
SP - 96
EP - 103
DO - 10.5220/0006051500960103