Conceptual structures: information processing in mind and machine
Conceptual structures: information processing in mind and machine
Semiring-based constraint satisfaction and optimization
Journal of the ACM (JACM)
Reasoning in description logics
Principles of knowledge representation
Towards Correspondence between Conceptual Graphs and Description Logics
ICCS '98 Proceedings of the 6th International Conference on Conceptual Structures: Theory, Tools and Applications
Knowledge Representation and Reasonings Based on Graph Homomorphism
ICCS '00 Proceedings of the Linguistic on Conceptual Structures: Logical Linguistic, and Computational Issues
Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
Semirings for Soft Constraint Solving and Programming (LECTURE NOTES IN COMPUTER SCIENCE)
Semirings for Soft Constraint Solving and Programming (LECTURE NOTES IN COMPUTER SCIENCE)
Modeling component connectors in Reo by constraint automata
Science of Computer Programming - Special issue on second international workshop on foundations of coordination languages and software architectures (FOCLASA'03)
Automated semantic web service discovery with OWLS-MX
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Handbook of Constraint Programming (Foundations of Artificial Intelligence)
Handbook of Constraint Programming (Foundations of Artificial Intelligence)
Similarity search for web services
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Scalable querying services over fuzzy ontologies
Proceedings of the 17th international conference on World Wide Web
URBE: Web Service Retrieval Based on Similarity Evaluation
IEEE Transactions on Knowledge and Data Engineering
Hi-index | 0.00 |
In this paper, we focus on the discovery process of Web Services (WSs) by basing the search on the similarities among the service requirements and candidate search results, in order to cope with over-constrained queries or to find satisfactory alternatives for user requirements. This discovery process needs to involve the so-called Soft Constraint Satisfaction Problems (SCSPs). First we represent both WSs and the search query of the user as Rooted Trees, i.e., a particular form of Conceptual Graphs. Then, we find a homomorphism between these two trees as a solution of an SCSP. The main contribution of this paper is the enhanced expressiveness offered by this "softness": in over-constrained scenarios, when a user query cannot be satisfied, classical crisp constraints (i.e., CSP) are not expressive enough to find "close" solutions to meet the users' needs.