354 search results - page 70 / 71 » Transforming Graph Based Scenarios into Graph Transformation... |
CONCUR
2009
Springer
14 years 15 hour ago
2009
Springer
Bisimulation equivalence is decidable in polynomial time for both sequential and commutative normed context-free processes, known as BPA and BPP, respectively. Despite apparent sim...
SEMWEB
2009
Springer
13 years 12 months ago
2009
Springer
Abstract. Most Semantic Web applications are build on top of technology based on the Semantic Web layer cake and the W3C ontology languages RDF(S) and OWL. However RDF(S) embodies ...
SG
2005
Springer
13 years 11 months ago
2005
Springer
This article describes the integration of knowledge based techniques into simulative Virtual Reality (VR) applications. The approach is motivated ltimodal Virtual Construction as a...
STACS
1992
Springer
13 years 9 months ago
1992
Springer
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...
CLIMA
2004
13 years 6 months ago
2004
Abstract. We introduce a logical framework suitable to formalize structures of epistemic agents. Such a framework is based on the notion of weighted directed acyclic graphs (WDAGs)...