Higher-order logic programming
Proceedings on Third international conference on logic programming
A calculus for complex objects
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
Sets and negation in a logic data base language (LDL1)
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A higher-order logic as the basis for logic programming
A higher-order logic as the basis for logic programming
A logical language for data and knowledge bases
A logical language for data and knowledge bases
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
Object identity as a query language primitive
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
COL: a logic-based language for complex objects
Advances in database programming languages
HILOG: a foundation for higher-order logic programming
Journal of Logic Programming
Object identity as a query language primitive
Journal of the ACM (JACM)
WWW '99 Proceedings of the eighth international conference on World Wide Web
Data on the Web: from relations to semistructured data and XML
Data on the Web: from relations to semistructured data and XML
A relational model of data for large shared data banks
Communications of the ACM
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Towards algebraic query optimisation for XQuery
Journal on Data Semantics VII
A Fixed-Point Query Language for XML
Proceedings of the 2010 conference on Information Modelling and Knowledge Bases XXI
| Hi-index | 0.00 |
As the eXtensible Markup Language (XML) is about to emerge as a new standard for databases, the problem of providing solid logical grounds for XML query languages arises. For the relational data model first-order logic, i.e. the Relational Calculus turned out to be an intuitive basic approach to provide these foundations. For XML, however, it is necessary to deal with ordered trees. In this paper the problem is approached by viewing XML as a data model based on complex objects that are arranged in a class hierarchy. This results in the natural development of a higher-order type system for XML data, and henceforth a higher-order predicate typed logic, the XML calculus (XMLC). The paper presents the basics of the XML object model (XOM), the syntacs and semantics of XMLC, and discusses the expressiveness of the language by means of representative important query samples.