F-logic: a higher-order language for reasoning about objects, inheritance, and scheme
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Logical foundations of object-oriented and frame-based languages
Journal of the ACM (JACM)
Deciding containment for queries with complex objects (extended abstract)
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the decidability of query containment under constraints
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Managing semistructured data with florid: a deductive object-oriented perspective
Information Systems - Special issue on semistructured data
Testing implications of data dependencies
ACM Transactions on Database Systems (TODS)
The entity-relationship model—toward a unified view of data
ACM Transactions on Database Systems (TODS) - Special issue: papers from the international conference on very large data bases: September 22–24, 1975, Framingham, MA
Query containment for data integration systems
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Data Exchange: Semantics and Query Answering
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Description Logics for Information Integration
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
TRIPLE - A Query, Inference, and Transformation Language for the Semantic Web
ISWC '02 Proceedings of the First International Semantic Web Conference on The Semantic Web
A software framework for matchmaking based on semantic web technology
WWW '03 Proceedings of the 12th international conference on World Wide Web
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
The Description Logic Handbook
The Description Logic Handbook
Containment of conjunctive queries over conceptual schemata
DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
Rules and ontologies in f-logic
Proceedings of the First international conference on Reasoning Web
The two cultures: mashing up web 2.0 and the semantic web
Proceedings of the 16th international conference on World Wide Web
Datalog±: a unified approach to ontologies and integrity constraints
Proceedings of the 12th International Conference on Database Theory
Conceptual Graph Rules and Equivalent Rules: A Synthesis
ICCS '09 Proceedings of the 17th International Conference on Conceptual Structures: Conceptual Structures: Leveraging Semantic Technologies
Extending decidable cases for rules with existential variables
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
On rules with existential variables: Walking the decidability line
Artificial Intelligence
A general Datalog-based framework for tractable query answering over ontologies
Web Semantics: Science, Services and Agents on the World Wide Web
Towards more expressive ontology languages: The query answering problem
Artificial Intelligence
Taming the infinite chase: query answering under expressive relational constraints
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
We consider the problem of query containment over an object data model derived from F-logic. F-logic has generated considerable interest commercially, in the academia, and within various standardization efforts as a means for building ontologies and for reasoning on the Semantic Web. Solution to the containment problem for F-logic queries can help with query optimization as well as the classification problem in information integration systems. An important property of F-logic queries, which sets them apart from database queries, is that they can mix the data-level and the meta-level in simple and useful ways. This means that such queries may refer not only to data but also schema information. To the best of our knowledge, the containment problem for such queries has not been considered in the literature. We show that, even for queries over meta-information together with data, this problem is decidable for non-recursive conjunctive queries. We also provide relevant complexity results.