Answering recursive queries using views
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
SAC '97 Proceedings of the 1997 ACM symposium on Applied computing
Information integration using logical views
Theoretical Computer Science - Special issue on the 6th International Conference on Database Theory—ICDT '97
Querying Heterogeneous Information Sources Using Source Descriptions
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
MiniCon: A scalable algorithm for answering queries using views
The VLDB Journal — The International Journal on Very Large Data Bases
Compiling propositional weighted bases
Artificial Intelligence - Special issue on nonmonotonic reasoning
Rewriting Queries Using Views for RDF-Based Relational Integration
ICTAI '05 Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence
ComposingWeb Services with Nondeterministic Behavior
ICWS '06 Proceedings of the IEEE International Conference on Web Services
Using views to generate efficient evaluation plans for queries
Journal of Computer and System Sciences
Quality-of-service oriented web service composition algorithm and planning architecture
Journal of Systems and Software
Multiobjective Optimization of SLA-Aware Service Composition
SERVICES '08 Proceedings of the 2008 IEEE Congress on Services - Part I
Automatic Web Service Composition Considering User Non-functional Preferences
NWESP '08 Proceedings of the 2008 4th International Conference on Next Generation Web Services Practices
Combining global optimization with local selection for efficient QoS-aware service composition
Proceedings of the 18th international conference on World wide web
Compilation of query-rewriting problems into tractable fragments of propositional logic
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
MINIMAXSAT: an efficient weighted max-SAT solver
Journal of Artificial Intelligence Research
Automatically Constructing Semantic Web Services from Online Sources
ISWC '09 Proceedings of the 8th International Semantic Web Conference
Semantic Web Service Composition in Social Environments
ISWC '09 Proceedings of the 8th International Semantic Web Conference
Optimizing QoS-Aware Semantic Web Service Composition
ISWC '09 Proceedings of the 8th International Semantic Web Conference
Optimizing Web Service Composition While Enforcing Regulations
ISWC '09 Proceedings of the 8th International Semantic Web Conference
A lightweight component caching scheme for satisfiability solvers
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Towards practical semantic web service discovery
ESWC'10 Proceedings of the 7th international conference on The Semantic Web: research and Applications - Volume Part II
ANAPSID: an adaptive query processing engine for SPARQL endpoints
ISWC'11 Proceedings of the 10th international conference on The semantic web - Volume Part I
Optimization techniques for qos-aware workflow realization in web services context
RED'10 Proceedings of the Third international conference on Resource Discovery
Challenges of quality-driven resource discovery
RED'10 Proceedings of the Third international conference on Resource Discovery
Automatic refinement of service compositions
ICWE'13 Proceedings of the 13th international conference on Web Engineering
Hi-index | 0.00 |
Given the large number of Semantic Web Services that can be created from online sources by using existing annotation tools, expressive formalisms and efficient and scalable approaches to solve the service selection problem are required to make these services widely available to the users. In this paper, we propose a framework that is grounded on logic and the Local-As-View approach for representing instances of the service selection problem. In our approach, Web services are semantically described using LAV mappings in terms of generic concepts from an ontology, user requests correspond to conjunctive queries on the generic concepts and, in addition, the user may specify a set of preferences that are used to rank the possible solutions to the given request. The LAV formulation allows us to cast the service selection problem as a query rewriting problem that must consider the relationships among the concepts in the ontology and the ranks induced by the preferences. Then, building on related work, we devise an encoding of the resulting query rewriting problem as a logical theory whose models are in correspondence with the solutions of the user request, and in presence of preferences, whose best models are in correspondence with the best-ranked solutions. Thus, by exploiting known properties of modern SAT solvers, we provide an efficient and scalable solution to the service selection problem. The approach provides the basis to represent a large number of real-world situations and interesting user requests.