Sciweavers

778 search results - page 102 / 156
» Expressiveness and complexity of graph logic
Sort
View
MOBIHOC
2007
ACM
14 years 10 months ago
Approximation algorithms for longest-lived directional multicast communications in WANETs
Several centralized and distributed algorithms have been recently proposed to maximize the multicast lifetime for directional communications in wireless ad-hoc networks. Their per...
Song Guo, Oliver W. W. Yang, Victor C. M. Leung
POPL
2006
ACM
14 years 11 months ago
Certified assembly programming with embedded code pointers
Embedded code pointers (ECPs) are stored handles of functions and continuations commonly seen in low-level binaries as well as functional or higher-order programs. ECPs are known ...
Zhaozhong Ni, Zhong Shao
JAPLL
2010
104views more  JAPLL 2010»
13 years 9 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
SEMWEB
2010
Springer
13 years 9 months ago
Evolution of DL - Lite Knowledge Bases
Abstract. We study the problem of evolution for Knowledge Bases (KBs) expressed in Description Logics (DLs) of the DL-Lite family. DL-Lite is at the basis of OWL 2 QL, one of the t...
Diego Calvanese, Evgeny Kharlamov, Werner Nutt, Dm...
GG
2008
Springer
14 years 2 days ago
Graph-Based Tools: The Contest
This event is the second instance of the contest for graph transformation-based tools, which was first held as part of the AGTIVE workshop. The aim is to stimulate tool developmen...
Arend Rensink, Pieter Van Gorp