Sciweavers

3047 search results - page 3 / 610
» On the Meaning of Logical Completeness
Sort
View
JAPLL
2010
104views more  JAPLL 2010»
13 years 5 months ago
Complete axiomatizations for XPath fragments
We provide complete axiomatizations for several fragments of XPath: sets of equivalences from which every other valid equivalence is derivable. Specifically, we axiomatize downwar...
Balder ten Cate, Tadeusz Litak, Maarten Marx
ICFP
2009
ACM
14 years 8 months ago
Complete and decidable type inference for GADTs
GADTs have proven to be an invaluable language extension, a.o. for ensuring data invariants and program correctness. Unfortunately, they pose a tough problem for type inference: w...
Tom Schrijvers, Simon L. Peyton Jones, Martin Sulz...
ISORC
2000
IEEE
13 years 11 months ago
Verification of UML-Based Real-Time System Designs by Means of cTLA
The Unified Modeling Language UML is well-suited for the design of real-time systems. In particular, the design of dynamic system behaviors is supported by interaction diagrams an...
Günter Graw, Peter Herrmann, Heiko Krumm
ICDT
2009
ACM
125views Database» more  ICDT 2009»
14 years 8 months ago
How big must complete XML query languages be?
Marx and de Rijke have shown that the navigational core of the w3c XML query language XPath is not first-order complete ? that is it cannot express every query definable in firsto...
Clemens Ley, Michael Benedikt
CORR
2011
Springer
185views Education» more  CORR 2011»
13 years 2 months ago
Sound and Complete Query Answering in Intensional P2P Data Integration
Contemporary use of the term ’intension’ derives from the traditional logical doctrine that an idea has both an extension and an intension. In this paper we introduce an intens...
Zoran Majkic