Sciweavers

710 search results - page 3 / 142
» Relational Expressive Power of Constraint Query Languages
Sort
View
JACM
2000
81views more  JACM 2000»
13 years 7 months ago
Relational queries over interpreted structures
We rework parts of the classical relational theory when the underlying domain is a structure with some interpreted operations that can be used in queries. We identify parts of the...
Michael Benedikt, Leonid Libkin
WWW
2001
ACM
14 years 8 months ago
A unified constraint model for XML
Integrity constraints are an essential part of a modern schema definition language. They are useful for semantic specification, update consistency control, query optimization, inf...
Gabriel M. Kuper, Jérôme Siméo...
UML
2001
Springer
14 years 1 days ago
On Querying UML Data Models with OCL
UML is the de-facto standard language for Object-Oriented analysis and design of information systems. Persistent storage and extraction of data in such systems is supported by dat...
David H. Akehurst, Behzad Bordbar
AIR
2006
124views more  AIR 2006»
13 years 7 months ago
Expressiveness of temporal query languages: on the modelling of intervals, interval relationships and states
Abstract Storing and retrieving time-related information are important, or even critical, tasks on many areas of Computer Science (CS) and in particular for Artificial Intelligence...
Rodolfo Sabás Gómez, Juan Carlos Aug...
LICS
2007
IEEE
14 years 1 months ago
Symmetric Datalog and Constraint Satisfaction Problems in Logspace
We introduce symmetric Datalog, a syntactic restriction of linear Datalog and show that its expressive power is exactly that of restricted symmetric monotone Krom SNP. The deep re...
László Egri, Benoit Larose, Pascal T...