Abstract
The \(\mathcal{DLF}\) family of description logics are fragments of first order logic with underlying signatures based on unary predicate symbols, called atomic concepts, and unary function symbols interpreted as total functions, called features. We show how computational properties relating to a key reasoning service for dialects of this family are preserved when (a) unary function symbols are now interpreted as partial functions, and when (b) a concept constructor is admitted that can characterize circumstances in which partial functions become total.
Keywords
- Part Features
- Conceptual Constructs
- Path Functional Dependencies (PFDs)
- Inclusion Dependencies
- Primitive Concepts
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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 subscriptionsNotes
- 1.
Such issues can be (and we believe should be) explicitly addressed elsewhere in an ontology.
- 2.
This arrangement is common and is referred to as the strict interpretation of undefined values.
- 3.
The last rule in the figure does not apply to \({ partial\!-\! \mathcal{{CFD}}}\) and is added w.l.o.g. in preparation for treating \({partial\!-\!}{{\mathcal {CFD}}}^{\forall }_{nc}\). This rule is neither necessary nor applicable in the \({ partial\!-\! \mathcal{{CFD}}}\) case.
- 4.
The details for this are beyond the scope of the paper.
References
Baader, F., Calvanese, D., McGuinness, D.L., Nardi, D., Patel-Schneider, P.F.: The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press, Cambridge (2003)
Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Boston (1979)
Khizder, V.L., Toman, D., Weddell, G.: Reasoning about duplicate elimination with description logic. In: Rules and Objects in Databases (DOOD, part of CL 2000), pp. 1017–1032 (2000)
Ramakrishnan, R.: Magic templates: a spellbinding approach to logic programs. J. Logic Program. 11(3 & 4), 189–216 (1991)
Toman, D., Weddell, G.: On attributes, roles, and dependencies in description logics and the ackermann case of the decision problem. In: Description Logics 2001, CEUR-WS, vol. 49, pp. 76–85 (2001)
Toman, D., Weddell, G.: On reasoning about structural equality in XML: a description logic approach. Theor. Comput. Sci. 336(1), 181–203 (2005)
Toman, D., Weddell, G.E.: On keys and functional dependencies as first-class citizens in description logics. J. Aut. Reason. 40(2–3), 117–132 (2008)
Toman, D., Weddell, G.E.: Applications and extensions of PTIME description logics with functional constraints. In: Proceedings International Joint Conference on Artificial Intelligence (IJCAI), pp. 948–954 (2009)
Toman, D., Weddell, G.E.: Conjunctive query answering in \({\cal CFD}_{nc}\): a PTIME description logic with functional constraints and disjointness. In: AI 2013: Advances in Artificial Intelligence - 26th Australasian Joint Conference, Dunedin, New Zealand, pp. 350–361 (2013)
Toman, D., Weddell, G.E.: Answering queries over \({\cal CFD}^{\forall }_{nc}\) knowledge bases. Technical report CS-2014-14, Cheriton School of Computer Science, University of Waterloo (2014)
Toman, D., Weddell, G.: On adding inverse features to the description logic \({\cal CFD}^{\forall }_{nc}\). In: Pham, D.-N., Park, S.-B. (eds.) PRICAI 2014. LNCS, vol. 8862, pp. 587–599. Springer, Heidelberg (2014)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Toman, D., Weddell, G. (2016). On Partial Features in the \(\mathcal{DLF}\) Family of Description Logics. In: Booth, R., Zhang, ML. (eds) PRICAI 2016: Trends in Artificial Intelligence. PRICAI 2016. Lecture Notes in Computer Science(), vol 9810. Springer, Cham. https://doi.org/10.1007/978-3-319-42911-3_44
Download citation
DOI: https://doi.org/10.1007/978-3-319-42911-3_44
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-42910-6
Online ISBN: 978-3-319-42911-3
eBook Packages: Computer ScienceComputer Science (R0)