On the interaction between inverse features and path-functional dependencies in description logics

Authors:
David Toman;Grant Weddell
Affiliations:
School of Computer Science, University of Waterloo;School of Computer Science, University of Waterloo
Venue:
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Year:
2005

Citing 4
Cited 7

Decomposition of Relationships through Pivoting

ER '96 Proceedings of the 15th International Conference on Conceptual Modeling
On reasoning about structural equality in XML: a description logic approach

Theoretical Computer Science - Database theory
Keys, nominate, and concrete domains

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Identification constraints and functional dependencies in description logics

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1

SPARQLing constraints for RDF

EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
On Keys and Functional Dependencies as First-Class Citizens in Description Logics

Journal of Automated Reasoning
Discovering functional dependencies for multidimensional design

Proceedings of the ACM twelfth international workshop on Data warehousing and OLAP
Applications and extensions of PTIME description logics with functional constraints

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
The DL-lite family and relations

Journal of Artificial Intelligence Research
On order dependencies for the semantic web

ER'07 Proceedings of the 26th international conference on Conceptual modeling
On keys and functional dependencies as first-class citizens in description logics

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate how inverse features can be added to a boolean complete description logic with path-functional dependencies in ways that avoid undecidability of the associated logical implication problem. In particular, we present two conditions that ensure the problem remains EXPTIME-complete. The first is syntactic in nature and limits the form that dependencies may have in argument terminologies. The second is a coherence condition on terminologies that is sufficiently weak to allow the transfer of relational and emerging object-oriented normalization techniques.