Model-Intersection Problems with Existentially Quantified Function Variables: Formalization and a Solution Schema

Kiyoshi Akama, Ekawit Nantajeewarawat

Abstract

Built-in constraint atoms play a very important role in knowledge representation and are indispensable for practical applications. It is very natural to use built-in constraint atoms together with user-defined atoms when formalizing logical problems using first-order formulas. In the presence of built-in constraint atoms, however, the conventional Skolemization in general preserves neither the satisfiability nor the logical meaning of a given first-order formula, motivating us to step outside the conventional Skolemization and the usual space of first- order formulas. We propose general solutions for proof problems and query-answering (QA) problems on first-order formulas possibly with built-in constraint atoms. We map, by using new meaning-preserving Skolemization, all proof problems and all QA problems, preserving their answers, into a new class of model-intersection (MI) problems on an extended clause space, where clauses are in a sense ``higher-order'' since they may contain not only built-in constraint atoms but also function variables. We propose a general schema for solving this class of MI problems by equivalent transformation (ET), where problems are solved by repeated simplification using ET rules. The correctness of this solution schema is shown. Since MI problems in this paper form a very large class of logical problems, this theory is also useful for inventing solutions for many classes of logical problems.

References

  1. Akama, K. and Nantajeewarawat, E. (2008). MeaningPreserving Skolemization on Logical Structures. In Proceedings of the 9th International Conference on Intelligent Technologies, pages 123-132, Samui, Thailand.
  2. Akama, K. and Nantajeewarawat, E. (2011). MeaningPreserving Skolemization. In Proceedings of the 3rd International Conference on Knowledge Engineering and Ontology Development, pages 322-327, Paris, France.
  3. Akama, K. and Nantajeewarawat, E. (2015a). 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.
  4. Akama, K. and Nantajeewarawat, E. (2015b). Functionvariable Elimination and Its Limitations. In Proceedings of the 7th International Joint Conference on Knowledge Discovery, Knowledge Engineering and Knowledge Management (IC3K 2015), Volume 2: KEOD, pages 212-222, Lisbon, Portugal.
  5. Baader, F., Calvanese, D., McGuinness, D. L., Nardi, D., and Patel-Schneider, P. F., editors (2007). The Description Logic Handbook. Cambridge University Press, second edition.
  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. Donini, F. M., Lenzerini, M., Nardi, D., and Schaerf, A. (1998). AL -log: Integrating Datalog and Description Logics. Journal of Intelligent Information Systems, 16:227-252.
  9. Fitting, M. (1996). First-Order Logic and Automated Theorem Proving. Springer-Verlag, second edition.
  10. 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.
  11. Gelfond, M. and Lifschitz, V. (1991). Classical Negation in Logic Programs and Disjunctive Databases. New Generation Computing, 9:365-386.
  12. Lloyd, J. W. (1987). Foundations of Logic Programming. Springer-Verlag, second, extended edition.
  13. Motik, B., Sattler, U., and Studer, R. (2005). Query Answering for OWL-DL with Rules. Journal of Web Semantics, 3(1):41-60.
  14. Robinson, J. A. (1965). A Machine-Oriented Logic Based on the Resolution Principle. Journal of the ACM, 12:23-41.
  15. Tessaris, S. (2001). Questions and Answers: Reasoning and Querying in Description Logic. PhD thesis, Department of Computer Science, The University of Manchester, UK.
Download


Paper Citation


in Harvard Style

Akama K. and Nantajeewarawat E. (2016). Model-Intersection Problems with Existentially Quantified Function Variables: Formalization and a Solution Schema . 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 52-63. DOI: 10.5220/0006056800520063


in Bibtex Style

@conference{keod16,
author={Kiyoshi Akama and Ekawit Nantajeewarawat},
title={Model-Intersection Problems with Existentially Quantified Function Variables: Formalization and a Solution Schema},
booktitle={Proceedings of the 8th International Joint Conference on Knowledge Discovery, Knowledge Engineering and Knowledge Management - Volume 2: KEOD, (IC3K 2016)},
year={2016},
pages={52-63},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006056800520063},
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 - Model-Intersection Problems with Existentially Quantified Function Variables: Formalization and a Solution Schema
SN - 978-989-758-203-5
AU - Akama K.
AU - Nantajeewarawat E.
PY - 2016
SP - 52
EP - 63
DO - 10.5220/0006056800520063