2008 IEEE International Conference on Web Services 2008
DOI: 10.1109/icws.2008.110
|View full text |Cite
|
Sign up to set email alerts
|

Modeling and Discovery of Data Providing Services

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
31
0

Year Published

2013
2013
2019
2019

Publication Types

Select...
3
3
1

Relationship

0
7

Authors

Journals

citations
Cited by 41 publications
(31 citation statements)
references
References 9 publications
0
31
0
Order By: Relevance
“…This makes techniq description logic suitable for solving proble automatic discovery and composition of serv problems require matching between a seman user query and a semantically-specified W contrast, our work is based on formal support verification of correctness of a co For Web services, formal methods are sui problems related to compositional correctne that a service complies with its advertis From a software engineering perspectiv techniques and formal methods t complimentary, as they address software verification problems, respectively. While a approach can validate that a service or a services match a user query, a formal meth verify that the service or composition implemented correctly with respect to that u A related work in [11] identifies the databases visible to service discovery a algorithms. The authors propose an exten standards to support the specification o services.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…This makes techniq description logic suitable for solving proble automatic discovery and composition of serv problems require matching between a seman user query and a semantically-specified W contrast, our work is based on formal support verification of correctness of a co For Web services, formal methods are sui problems related to compositional correctne that a service complies with its advertis From a software engineering perspectiv techniques and formal methods t complimentary, as they address software verification problems, respectively. While a approach can validate that a service or a services match a user query, a formal meth verify that the service or composition implemented correctly with respect to that u A related work in [11] identifies the databases visible to service discovery a algorithms. The authors propose an exten standards to support the specification o services.…”
Section: Related Workmentioning
confidence: 99%
“…The service's mai to retrieve data from a data store based on Their approach facilitates the automatic disc by applying ontological reasoning. They su data sources as RDF views over a shared m Specifically, the local schema of each data s to concepts of a shared OWL ontology, a used to define RDF views describing the da mediated schema [11]. Their approach is us a service with a user query based on reasoning.…”
Section: Related Workmentioning
confidence: 99%
“…They suggest describing data sources as RDF views over a shared mediated schema. Specifically, the local schema of each data source is mapped to concepts of a shared OWL ontology, and its terms are used to define RDF views describing the data sources in the mediated schema (Vaculin et al 2008). Their approach is useful in matching a service with a user query based on ontology-based reasoning.…”
Section: Related Workmentioning
confidence: 99%
“…A related work in (Vaculin et al 2008) identifies the need to make databases visible to service discovery and composition algorithms. The authors propose an extension to OWL-S standards to support the specification of dataproviding services.…”
Section: Related Workmentioning
confidence: 99%
“…I/O are not sufficient to find accurate services and compositions. As shown in [21], the SWS in our case are data providers and they have specific constrainsts on I/O. [15] introduces a representation method for IOPE that explicitly defines the link between I/O based on Preconditions and Effects using SPARQL.…”
Section: Problem and Contributionsmentioning
confidence: 99%