Abstract
A query-answering problem (QA problem) is concerned with finding all ground instances of a query atomic formula that are logical consequences of a given logical formula describing the background knowledge of the problem. Based on the equivalent transformation (ET) solution method, a general framework for solving QA problems on first-order logic has been proposed, where a first-order formula representing background knowledge is converted by meaning-preserving Skolemization into a set of clauses typically containing global existential quantifications of function variables. The obtained clause set is then transformed successively using ET rules until the answer set of the original problem can be readily derived. In this paper, we extend the space of clauses by introducing constraints and invent three ET rules for simplifying problem descriptions by using interaction between clauses and constraints. This extension provides a general solution for a larger class of QA problems.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Akama, K., Nantajeewarawat, E.: Meaning-preserving Skolemization. In: 3rd International Conference on Knowledge Engineering and Ontology Development, Paris, France, pp. 322–327 (2011)
Akama, K., Nantajeewarawat, E.: Equivalent transformation in an extended space for solving query-answering problems. In: Nguyen, N.T., Attachoo, B., Trawiński, B., Somboonviwat, K. (eds.) ACIIDS 2014. LNCS (LNAI), vol. 8397, pp. 232–241. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-05476-6_24
Akama, K., Nantajeewarawat, E.: Function-variable elimination and its limitations. In: 7th International Joint Conference on Knowledge Discovery, Knowledge Engineering and Knowledge Management, Lisbon, Portugal, vol. 2, pp. 212–222 (2015)
Akama, K., Nantajeewarawat, E.: Model-intersection problems with existentially quantified function variables: formalization and a solution schema. In: 8th International Joint Conference on Knowledge Discovery, Knowledge Engineering and Knowledge Management, Porto, Portugal, vol. 2, pp. 52–63 (2016)
Akama, K., Nantajeewarawat, E.: Unfolding existentially quantified sets of extended clauses. In: 8th International Joint Conference on Knowledge Discovery, Knowledge Engineering and Knowledge Management, Porto, Portugal, vol. 2, pp. 96–103 (2016)
Akama, K., Nantajeewarawat, E.: Side-change transformation. Technical report, Hokkaido University (2017)
Lloyd, J.W.: Foundations of Logic Programming, 2nd edn. Springer, Heidelberg (1987). https://doi.org/10.1007/978-3-642-83189-8
Robinson, J.A.: A machine-oriented logic based on the resolution principle. J. ACM 12, 23–41 (1965)
Donini, F.M., Lenzerini, M., Nardi, D., Schaerf, A.: \(\cal{AL}\)-log: integrating datalog and description logics. J. Intell. Coop. Inf. Syst. 10, 227–252 (1998)
Motik, B., Sattler, U., Studer, R.: Query answering for OWL-DL with rules. J. Web Semant. 3, 41–60 (2005)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Akama, K., Nantajeewarawat, E. (2018). Solving Query-Answering Problems with Constraints for Function Variables. In: Nguyen, N., Hoang, D., Hong, TP., Pham, H., Trawiński, B. (eds) Intelligent Information and Database Systems. ACIIDS 2018. Lecture Notes in Computer Science(), vol 10751. Springer, Cham. https://doi.org/10.1007/978-3-319-75417-8_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-75417-8_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-75416-1
Online ISBN: 978-3-319-75417-8
eBook Packages: Computer ScienceComputer Science (R0)