On the satisfiability of dependency constraints in entity-relationship schemata
Information Systems
Conceptual database design: an Entity-relationship approach
Conceptual database design: an Entity-relationship approach
Modal logic
Deductive Entity Relationship Modeling
IEEE Transactions on Knowledge and Data Engineering
On the Interaction Between ISA and Cardinality Constraints
Proceedings of the Tenth International Conference on Data Engineering
The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
The description logic handbook
Theory of Computation (Texts in Computer Science)
Theory of Computation (Texts in Computer Science)
Fundamentals of Database Systems (5th Edition)
Fundamentals of Database Systems (5th Edition)
DL-Lite: tractable description logics for ontologies
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
DL-lite in the light of first-order logic
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Reasoning on UML class diagrams
Artificial Intelligence
Verifying UML/OCL Operation Contracts
IFM '09 Proceedings of the 7th International Conference on Integrated Formal Methods
Foundations of Temporal Conceptual Data Models
Conceptual Modeling: Foundations and Applications
Abstract ERIA: a web language for conceptual metadata integration and abstraction in the large
Proceedings of the International Conference on Management of Emergent Digital EcoSystems
On the complexities of consistency checking for restricted UML class diagrams
Theoretical Computer Science
Minimal module extraction from DL-lite ontologies using QBF solvers
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Tractable Query Answering over Conceptual Schemata
ER '09 Proceedings of the 28th International Conference on Conceptual Modeling
The DL-lite family and relations
Journal of Artificial Intelligence Research
DL-Lite with temporalised concepts, rigid axioms and roles
FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
Logic-based ontology comparison and module extraction, with an application to DL-Lite
Artificial Intelligence
Dependencies between ontology design parameters
International Journal of Metadata, Semantics and Ontologies
A framework for multidimensional design of data warehouses from ontologies
Data & Knowledge Engineering
Complexity of reasoning over temporal data models
ER'10 Proceedings of the 29th international conference on Conceptual modeling
Full satisfiability of UML class diagrams
ER'10 Proceedings of the 29th international conference on Conceptual modeling
Query answering under expressive entity-relationship schemata
ER'10 Proceedings of the 29th international conference on Conceptual modeling
Design, redesign and publication of linked schema repositories in the large
Proceedings of the International Conference on Management of Emergent Digital EcoSystems
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications: Part II
Scalable analysis of conceptual data models
Proceedings of the 2011 International Symposium on Software Testing and Analysis
Reducing multiplicities in class diagrams
Proceedings of the 14th international conference on Model driven engineering languages and systems
Tailoring temporal description logics for reasoning over temporal conceptual models
FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
Conjunctive query answering in the description logic SH using knots
Journal of Computer and System Sciences
Ontological query answering under expressive Entity-Relationship schemata
Information Systems
OCL-Lite: Finite reasoning on UML/OCL conceptual schemas
Data & Knowledge Engineering
Efficiency frontiers of XML cardinality constraints
Data & Knowledge Engineering
Temporal description logic for ontology-based data access
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Hi-index | 0.00 |
We investigate the computational complexity of reasoning over various fragments of the Extended Entity-Relationship (EER) language, which includes a number of constructs: ISA between entities and relationships, disjointness and covering of entities and relationships, cardinality constraints for entities in relationships and their refinements as well as multiplicity constraints for attributes. We extend the known EXPTIME-completeness result for UML class diagrams [5] and show that reasoning over EER diagrams with ISA between relationships is EXPTIME-complete even without relationship covering. Surprisingly, reasoning becomes NP-complete when we drop ISA between relationships (while still allowing all types of constraints on entities). If we further omit disjointness and covering over entities, reasoning becomes polynomial. Our lower complexity bound results are proved by direct reductions, while the upper bounds follow from the correspondences with expressive variants of the description logic DL-Lite, which we establish in this paper. These correspondences also show the usefulness of DL-Lite as a language for reasoning over conceptual models and ontologies.