Subgraph matching is a key operation on graph data. Social network (SN) providers may want to find all subgraphs within their social network that "match" certain query gr...
Let H be a fixed graph on h vertices. We say that a graph G is induced H-free if it does not contain any induced copy of H. Let G be a graph on n vertices and suppose that at leas...
I n this paper, we propose an approach to reuse-based software development using formal method. I n our approach, each software component is annotated with a set of predicates to ...
Chao-Tsun Chang, William C. Chu, Chung-Shyan Liu, ...
We present the latest release of the Ontology Pre-Processor Language, a language for querying and modifying Description Logic knowledge bases expressed in OWL. We briefly describe ...
Abstract--A widespread design approach in distributed applications based on the service-oriented paradigm, such as web-services, consists of clearly separating the enforcement of a...