Sciweavers

710 search results - page 18 / 142
» Relational Expressive Power of Constraint Query Languages
Sort
View
PODS
2003
ACM
142views Database» more  PODS 2003»
14 years 7 months ago
Query containment and rewriting using views for regular path queries under constraints
In this paper we consider general path constraints for semistructured databases. Our general constraints do not suffer from the limitations of the path constraints previously stud...
Gösta Grahne, Alex Thomo
IS
2008
13 years 7 months ago
On the expressibility of functions in XQuery fragments
XQuery is a powerful XML query language with many features and syntactic constructs. For many common queries we do not need all the expressive power of XQuery. We investigate the ...
Jan Hidders, Stefania Marrara, Jan Paredaens, Roel...
ICDE
2006
IEEE
146views Database» more  ICDE 2006»
14 years 9 months ago
Using XML to Build Efficient Transaction-Time Temporal Database Systems on Relational Databases
In this paper, we present the ArchIS system that achieves full-functionality transaction-time databases without requiring temporal extensions in XML or database standards. ArchIS&...
Fusheng Wang, Xin Zhou, Carlo Zaniolo
EACL
1989
ACL Anthology
13 years 8 months ago
Programming in Logic with Constraints for Natural Language Processing
In this paper, we present a logic-based computational model for movement theory in Government and Binding Theory. For that purpose, we have designed a language called DISLOG. DISL...
Patrick Saint-Dizier
SYNTHESE
2008
99views more  SYNTHESE 2008»
13 years 7 months ago
Public and private communication are different: results on relative expressivity
Dynamic Epistemic Logic (DEL) is the study of how to reason about knowledge, belief, and communication. This paper studies the relative expressivity of certain fragments of the DE...
Bryan Renne