On reasoning about structural equality in XML: a description logic approach

We define a boolean complete dialect of description logic called DLFDreg that can be used to reason about structural equality in semistructured ordered data in the presence of document type definitions. This application depends on the novel ability of DLFDreg to express functional dependencies over possibly infinite sets of feature paths defined by regular languages. We also present a decision procedure for the associated logical implication problem. The procedure underlies a mapping of such problems to satisfiability problems of Datalog¬nS.

[1]  Vitaliy L. Khizder,et al.  Reasoning about Duplicate Elimination with Description Logic , 2000, Computational Logic.

[2]  Donald E. Knuth,et al.  The art of computer programming: sorting and searching (volume 3) , 1973 .

[3]  Diego Calvanese,et al.  Identification Constraints and Functional Dependencies in Description Logics , 2001, IJCAI.

[4]  Minoru Ito,et al.  Implication Problems for Functional Constraints on Databases Supporting Complex Objects , 1994, J. Comput. Syst. Sci..

[5]  Wilhelm Ackermann,et al.  Solvable Cases Of The Decision Problem , 1954 .

[6]  Marianne Baudinet,et al.  Constraint-Generating Dependencies , 1994, PPCP.

[7]  Donald E. Knuth,et al.  The art of computer programming, volume 3: (2nd ed.) sorting and searching , 1998 .

[8]  Georg Gottlob,et al.  Disjunctive datalog , 1997, TODS.

[9]  Francesco Scarcello,et al.  Disjunctive Stable Models: Unfounded Sets, Fixpoint Semantics, and Computation , 1997, Inf. Comput..

[10]  Jack Minker.  Foundations of deductive databases and logic programming , 1988 .

[11]  Ian Horrocks,et al.  Practical Reasoning for Expressive Description Logics , 1999, LPAR.

[12]  Wenfei Fan,et al.  On verifying consistency of XML specifications , 2002, PODS.

[13]  Gert Smolka,et al.  Attributive Concept Descriptions with Complements , 1991, Artif. Intell..

[14]  Jack Minker,et al.  Logic-Based Artificial Intelligence , 2000 .

[15]  Jeffrey D. Ullman,et al.  Principles Of Database And Knowledge-Base Systems , 1979 .

[16]  David Toman,et al.  On Attributes, Roles, and Dependencies in Description Logics and the Ackermann Case of the Decision Problem , 2001, Description Logics.

[17]  Igor Walukiewicz,et al.  Automata for the-calculus and Related Results , 1995 .

[18]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[19]  Alexander Borgida,et al.  Adding uniqueness constraints to description logics , 1997 .

[20]  Marcelo Arenas,et al.  A normal form for XML documents , 2002, PODS '02.

[21]  Jorge Lobo,et al.  Foundations of disjunctive logic programming , 1992, Logic Programming.

[22]  Wolfgang Faber,et al.  Declarative problem-solving using the DLV system , 2000 .

[23]  Alberto O. Mendelzon,et al.  Functional dependencies in Horn clause queries , 1991, TODS.

[24]  Jorge Lobo,et al.  Disjunctive LP+integrity constraints= stable model semantics , 2005, Annals of Mathematics and Artificial Intelligence.

[25]  Diego Calvanese,et al.  Description Logic Framework for Information Integration , 1998, KR.

[26]  Jack Minker,et al.  A Fixpoint Semantics for Disjunctive Logic Programs , 1990, J. Log. Program..

[27]  Grant E. Weddell,et al.  Reasoning about functional dependencies generalized for semantic data models , 1992, TODS.

[28]  Jan Chomicki,et al.  Finite representation of infinite query answers , 1993, TODS.

[29]  Donald E. Knuth,et al.  The Art of Computer Programming: Volume 3: Sorting and Searching , 1998 .

[30]  Wenfei Fan,et al.  Keys for XML , 2002, Comput. Networks.

[31]  Alexander Borgida,et al.  Adding Uniqueness Constraints to Description Logics (Preliminary Report) , 1997, DOOD.

[32]  Jan Chomicki,et al.  Functional deductive databases: query processing in the presence of limited function symbols , 1990 .

[33]  Scott Boag,et al.  XQuery 1.0 : An XML Query Language , 2007 .

[34]  David Toman,et al.  On Decidability and Complexity of Description Logics with Uniqueness Constraints , 2001, Description Logics.

[35]  David Janin,et al.  Automata for the mu-calculus and Related Results , 1995 .

[36]  John Wylie Lloyd,et al.  Foundations of Logic Programming , 1987, Symbolic Computation.

[37]  Jack Minker,et al.  Procedural Interpretation of Non-Horn Logic Programs , 1988, CADE.

[38]  Jeffrey D. Ullman,et al.  Principles of Database and Knowledge-Base Systems, Volume II , 1988, Principles of computer science series.

[39]  Serge Abiteboul,et al.  Foundations of Databases , 1994 .

[40]  Yuri Gurevich,et al.  The Classical Decision Problem , 1997, Perspectives in Mathematical Logic.

[41]  Gerald Pfeifer,et al.  The KR System dlv: Progress Report, Comparisons and Benchmarks , 1998, KR.

[42]  Wolfgang Faber,et al.  DLV - A System for Declarative Problem Solving , 2000, ArXiv.

[43]  Daniela Florescu,et al.  Quilt: An XML Query Language for Heterogeneous Data Sources , 2000, WebDB.

[44]  Eugene J. Shekita,et al.  Fundamental Techniques for Order Optimization , 1996, EDBT.

[45]  Jennifer Widom,et al.  Proceedings of the 1996 ACM SIGMOD international conference on Management of data , 1996, PODS 1996.

[46]  Igor Walukiewicz,et al.  Automata for the Modal mu-Calculus and related Results , 1995, MFCS.

[47]  E. Allen Emerson,et al.  Tree automata, mu-calculus and determinacy , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[48]  A. Wilkie.  THE CLASSICAL DECISION PROBLEM (Perspectives in Mathematical Logic) By Egon Börger, Erich Grädel and Yuri Gurevich: 482 pp., DM.158.–, ISBN 3 540 57073 X (Springer, 1997). , 1998 .

[49]  Diego Calvanese,et al.  Representing and Reasoning on XML Documents: A Description Logic Approach , 1999, J. Log. Comput..