Theory of generalized annotated logic programming and its applications
Journal of Logic Programming
Combining fuzzy information from multiple systems
Journal of Computer and System Sciences
Proceedings of the 17th International Conference on Data Engineering
Approximating Most Specific Concepts in Description Logics with Existential Restrictions
KI '01 Proceedings of the Joint German/Austrian Conference on AI: Advances in Artificial Intelligence
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Progressive skyline computation in database systems
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
Fuzzy Logic and the Semantic Web (Capturing Intelligence)
Fuzzy Logic and the Semantic Web (Capturing Intelligence)
Reasoning within fuzzy description logics
Journal of Artificial Intelligence Research
Towards a fuzzy description logic for the semantic web (preliminary report)
ESWC'05 Proceedings of the Second European conference on The Semantic Web: research and Applications
Uncertainty Issues and Algorithms in Automating Process Connecting Web and User
Uncertainty Reasoning for the Semantic Web I
Multi-Criterion Search from the Semantic Point of View(Comparing TIL and Description Logic)
Proceedings of the 2008 conference on Information Modelling and Knowledge Bases XIX
A Description Logic with Concept Instance Ordering and Top-k Restriction
Proceedings of the 2009 conference on Information Modelling and Knowledge Bases XX
Tractable reasoning with vague knowledge using fuzzy $\mathcal{EL}^{++}$
Journal of Intelligent Information Systems
| Hi-index | 0.00 |
We consider querying containing several vague concepts of user's preferences (with preference scale T ), which is quite typical in semantic web. These particular preferences need to be combined to get an overall ordering of results. We propose T-EL@ --a description logic allowing existential restrictions, crisp roles, T -fuzzy concepts and T -fuzzy combining functions @. We discuss problems of consistency, subsumption and the instance problem. We show some results on polynomial complexity of this problem. We conclude with a sketch of an embedding of T-EL@ into a sort of classical EL logic with concrete domain.