Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
An automata theoretic decision procedure for the propositional mu-calculus
Information and Computation
The complexity of existential quantification in concept languages
Artificial Intelligence
Characteristic formulae for processes with divergence
Information and Computation
From structured documents to novel query facilities
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Automated temporal reasoning about reactive systems
Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata
Modal and temporal logics for processes
Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata
Querying Semistructured Heterogeneous Information
DOOD '95 Proceedings of the Fourth International Conference on Deductive and Object-Oriented Databases
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Adding Structure to Unstructured Data
ICDT '97 Proceedings of the 6th International Conference on Database Theory
A semantics and complete algorithm for subsumption in the classic description logic
Journal of Artificial Intelligence Research
A uniform framework for concept definitions in description logics
Journal of Artificial Intelligence Research
Type inference for queries on semistructured data
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Description Logics and Their Relationships with Databases
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Schema Based Data Storage and Query Optimization for Semi-structured Data
WAIM '00 Proceedings of the First International Conference on Web-Age Information Management
Queries and Constraints on Semi-structured Data
CAiSE '99 Proceedings of the 11th International Conference on Advanced Information Systems Engineering
Query Optimization for Semistructured Data Using Path Constraints in a Deterministic Data Model
DBPL '99 Revised Papers from the 7th International Workshop on Database Programming Languages: Research Issues in Structured and Semistructured Database Programming
UnQL: a query language and algebra for semistructured data based on structural recursion
The VLDB Journal — The International Journal on Very Large Data Bases
Reasoning in expressive description logics
Handbook of automated reasoning
The description logic handbook
Source integration for data warehousing
Multidimensional databases
Interaction between path and type constraints
ACM Transactions on Computational Logic (TOCL)
Using methods of declarative logic programming for intelligent information agents
Theory and Practice of Logic Programming
Associativity and Commutativity in Generic Merge
Conceptual Modeling: Foundations and Applications
What's in an attribute? consequences for the least common subsumer
Journal of Artificial Intelligence Research
Reasoning in expressive description logics with fixpoints based on automata on infinite trees
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Combining artificial intelligence and databases for data integration
Artificial intelligence today
Construction of fuzzy ontologies from fuzzy XML models
Knowledge-Based Systems
Hi-index | 0.00 |
The problem of modeling semi-structured data is important in many application areas such as multimedia data management, biological databases, digital libraries, and data integration. Graph schemas (Buneman et al. 1997) have been proposed recently as a simple and elegant formalism for representing semistructured data. In this model, schemas are represented as graphs whose edges are labeled with unary formulae of a theory, and the notions of conformance of a database to a schema and of subsumption between two schemas are defined in terms of a simulation relation. Several authors have stressed the need of extending graph schemas with various types of constraints, such as edge existence and constraints on the number of outgoing edges. In this paper we analyze the appropriateness of various knowledge representation formalisms for representing and reasoning about graph schemas extended with constraints. We argue that neither First Order Logic, nor Logic Programming nor Frame-based languages are satisfactory for this purpose, and present a solution based on very expressive Description Logics. We provide techniques and complexity analysis for the problem of deciding schema subsumption and conformance in various interesting cases, that differ by the expressive power in the specification of constraints.