Vagueness in Description Logic Programs for the Semantic Web
نویسندگان
چکیده
This paper is directed towards an infrastructure for handling both uncertainty and vagueness in the Rules, Logic, and Proof layers of the Semantic Web. More concretely, we present probabilistic fuzzy description logic programs, which combine fuzzy description logics, fuzzy logic programs (with stratified nonmonotonic negation), and probabilistic uncertainty in a uniform framework for the Semantic Web. We define important concepts dealing with both probabilistic uncertainty and fuzzy vagueness, such as the expected truth value of a crisp sentence and the probability of a vague sentence. We then provide algorithms for query processing in probabilistic fuzzy description logic programs, and we also delineate a special case where query processing has a polynomial data complexity. Furthermore, we describe a shopping agent example, which gives evidence of the usefulness of probabilistic fuzzy description logic programs in realistic web applications. 1Dipartimento di Informatica e Sistemistica, Sapienza Università di Roma, Via Salaria 113, I-00198 Rome, Italy; e-mail: [email protected]. Institut für Informationssysteme, Technische Universität Wien, Favoritenstraße 9-11, A-1040 Vienna, Austria; e-mail: [email protected]. 2ISTI-CNR, Via G. Moruzzi 1, I-56124 Pisa, Italy; e-mail: [email protected]. Acknowledgements: This work has been partially supported by a Heisenberg Professorship of the German Research Foundation (DFG). Copyright © 2007 by the authors INFSYS RR 1843-07-02 I
منابع مشابه
Top-k Retrieval in Description Logic Programs Under Vagueness for the Semantic Web
Description logics (DLs) and logic programs (LPs) are important representation languages for the Semantic Web. In this paper, we address an emerging problem in such languages, namely, the problem of evaluating ranked top-k queries. Specifically, we show how to compute the top-k answers in a datacomplexity tractable combination of DLs and LPs under vagueness.
متن کاملManaging Uncertainty and Vagueness in Description Logics, Logic Programs and Description Logic Programs
Managing uncertainty and/or vagueness is starting to play an important role in Semantic Web representation languages. Our aim is to overview basic concepts on representing uncertain and vague knowledge in current Semantic Web ontology and rule languages (and their combination).
متن کاملDescription Logic Programs Under Probabilistic Uncertainty and Fuzzy Vagueness
This paper is directed towards an infrastructure for handling both uncertainty and vagueness in the Rules, Logic, and Proof layers of the Semantic Web. More concretely, we present probabilistic fuzzy description logic programs, which combine fuzzy description logics, fuzzy logic programs (with stratified nonmonotonic negation), and probabilistic uncertainty in a uniform framework for the Semant...
متن کاملTightly Integrated Fuzzy Description Logic Programs Under the Answer Set Semantics for the Semantic Web
We present a novel approach to fuzzy dl-programs under the answer set semantics, which is a tight integration of fuzzy disjunctive programs under the answer set semantics with fuzzy description logics. From a different perspective, it is a generalization of tightly integrated disjunctive dl-programs by fuzzy vagueness in both the description logic and the logic program component. We show that t...
متن کاملRanking Services Using Fuzzy HEXPrograms
The need to reason with knowledge expressed in both Logic Programming (LP) and Description Logics (DLs) paradigms on the Semantic Web lead to several integrating formalisms, e.g., Description Logic programs (dl-programs) allow a logic program to retrieve results from and feed results to a DL knowledge base. Two functional extensions of dl-programs are HEX programs and fuzzy dl-programs. The for...
متن کامل