Sciweavers

504 search results - page 12 / 101
» Definitional Reflection and the Completion
Sort
View
SIGMOD
2003
ACM
106views Database» more  SIGMOD 2003»
14 years 7 months ago
XPath Processing in a Nutshell
We provide a concise yet complete formal definition of the semantics of XPath 1 and summarize efficient algorithms for processing queries in this language. Our presentation is int...
Georg Gottlob, Christoph Koch, Reinhard Pichler
FSKD
2005
Springer
90views Fuzzy Logic» more  FSKD 2005»
14 years 1 months ago
Direct Candidates Generation: A Novel Algorithm for Discovering Complete Share-Frequent Itemsets
The value of the itemset share is one way of evaluating the magnitude of an itemset. From business perspective, itemset share values reflect more the significance of itemsets for m...
Yu-Chiang Li, Jieh-Shan Yeh, Chin-Chen Chang
ICFP
2003
ACM
14 years 7 months ago
A sound and complete axiomatization of delimited continuations
The shift and reset operators, proposed by Danvy and Filinski, are powerful control primitives for capturing delimited continuations. Delimited continuation is a similar concept a...
Yukiyoshi Kameyama, Masahito Hasegawa
FUIN
2008
80views more  FUIN 2008»
13 years 7 months ago
Complete Process Semantics of Petri Nets
In the first part of this paper we extend the semantical framework proposed in [22] for process and causality semantics of Petri nets by an additional aim, firstly mentioned in the...
Gabriel Juhás, Robert Lorenz, Sebastian Mau...
LOBJET
2008
104views more  LOBJET 2008»
13 years 7 months ago
Une approche formelle de la reconfiguration dynamique
Self-adapting software adapts its behavior in an autonomic way, by dynamically adding, suppressing and recomposing components, and by the use of computational reflection. One way t...
M. Simonot, M. Aponte