## Fuzzy Description Logic Programs under the Answer Set Semantics for the Semantic Web (2006)

Venue: | WEB, SECOND INTERNATIONAL CONFERENCE, RULEML |

Citations: | 24 - 7 self |

### BibTeX

@INPROCEEDINGS{Lukasiewicz06fuzzydescription,

author = {Thomas Lukasiewicz},

title = {Fuzzy Description Logic Programs under the Answer Set Semantics for the Semantic Web },

booktitle = {WEB, SECOND INTERNATIONAL CONFERENCE, RULEML },

year = {2006},

publisher = {IEEE Computer Society}

}

### Years of Citing Articles

### OpenURL

### Abstract

Vagueness and imprecision abound in multimedia information processing and retrieval. In this paper, towards dealing with vagueness and imprecision in the reasoning layers of the Semantic Web, we present an approach to fuzzy description logic programs under the answer set semantics. We generalize normal description logic programs (dl-programs) under the answer set semantics by fuzzy vagueness and imprecision. We define a canonical semantics of positive and stratified fuzzy dl-programs in terms of a unique least model and iterative least models, respectively. We then define the answer set semantics of general fuzzy dlprograms, and show in particular that all answer sets of a fuzzy dl-program are minimal models, and that the answer set semantics of positive and stratified fuzzy dl-programs coincides with their canonical least model and iterative least model semantics, respectively. Furthermore, we also provide a characterization of the canonical semantics of positive and stratified fuzzy dl-programs in terms of a fixpoint and an iterative fixpoint semantics, respectively.

### Citations

900 | The wellfounded semantics for general logic programs
- Gelder, Ross, et al.
- 1991
(Show Context)
Citation Context ...rying. The semantics of dl-programs was defined in [5] and [6] as an extension of the answer set semantics by Gelfond and Lifschitz [8] and the well-founded semantics by Van Gelder, Ross, and Schlipf =-=[33]-=-, respectively, which are the two most widely used semantics for normal logic programs. The description logic knowledge bases in dl-programs are specified in the description logics SHIF(D) and SHOIN (... |

538 | From SHIQ and RDF to OWL: The Making of a Web Ontology Language
- Horrocks, Patel-Schneider, et al.
(Show Context)
Citation Context ...en, Favoritenstr. 9-11, A-1040 Wien, Austria; lukasiewicz@kr.tuwien.ac.at. The Semantic Web consists of several hierarchical layers, where the Ontology layer, in form of the OWL Web Ontology Language =-=[34, 11]-=- (recommended by the W3C), is currently the highest layer of sufficient maturity. OWL consists of three increasingly expressive sublanguages, namely OWL Lite, OWL DL, and OWL Full. OWL Lite and OWL DL... |

350 |
Weaving the Web
- Berners-Lee
- 1999
(Show Context)
Citation Context ...e a characterization of the canonical semantics of positive and stratified fuzzy dl-programs in terms of a fixpoint and an iterative fixpoint semantics, respectively. 1. Introduction The Semantic Web =-=[1, 7]-=- aims at an extension of the current World Wide Web by standards and technologies that help machines to understand the information on the Web so that they can support richer discovery, data integratio... |

332 | S.: Practical reasoning for expressive description logics
- Horrocks, Sattler, et al.
- 1999
(Show Context)
Citation Context ...b) (called equality (resp., inequality) axiom), where a, b ∈ I. A knowledge base L is a finite set of axioms. For decidability, number restrictions in L are restricted to simple abstract roles R ∈ RA =-=[12]-=-. The syntax of SHIF(D) is as the above syntax of SHOIN (D), but without the oneOf constructor and with the atleast and atmost constructors limited to 0 and 1. Example 2.1 An online store (such as ama... |

233 | H.: Combining answer set programming with description logics for the Semantic
- Eiter, Lukasiewicz, et al.
- 2004
(Show Context)
Citation Context ...edge bases. Another type of combination is to build ontologies on top of rules, which means that ontological definitions are supplemented by rules or imported from rules. Towards this goal, the works =-=[5, 6]-=- have proposed description logic programs (or simply dlprograms), which are of the form KB = (L, P ), where L is a knowledge base in a description logic and P is a finite set of description logic rule... |

214 | Reducing OWL Entailment to Description Logic Satisfiability
- Horrocks, Patel-Schneider
(Show Context)
Citation Context ...sists of three increasingly expressive sublanguages, namely OWL Lite, OWL DL, and OWL Full. OWL Lite and OWL DL are essentially very expressive description logics with an RDF syntax [11]. As shown in =-=[9]-=-, ontology entailment in OWL Lite (resp., OWL DL) reduces to knowledge base (un)satisfiability in the description logic SHIF(D) (resp., SHOIN (D)). On top of the Ontology layer, the Rules, Logic, and ... |

170 | Reasoning within fuzzy description logics
- Straccia
- 2001
(Show Context)
Citation Context ...ogical consequence of L, denoted L |= F , iff every model of L satisfies F . 3. Fuzzy SHIF(D) and SHOIN (D) Even though the literature contains several previous approaches to fuzzy description logics =-=[35, 32, 25, 26]-=-, only recently fuzzy description logics for the Semantic Web have been explored. In particular, recent works by Straccia [28, 29] introduce a fuzzy description logic with concrete domains (with reaso... |

160 | Design rationale of RuleML: A markup language for semantic web rules
- Boley, Tabet, et al.
- 2001
(Show Context)
Citation Context ...Proof layers of the Semantic Web will be developed next, which should offer sophisticated representation and reasoning capabilities. As a first effort in this direction, RuleML (Rule Markup Language) =-=[2]-=- is an XMLbased markup language for rules and rule-based systems, whereas the OWL Rules Language [10] is a first proposal for extending OWL by Horn clause rules. A key requirement of the layered archi... |

160 | The Independent Choice Logic for modelling multiple agents under uncertainty
- Poole
- 1997
(Show Context)
Citation Context ...lize dl-programs under the answer set and the well-founded semantics by probabilistic uncertainty. They have been developed as a combination of dl-programs with Poole’s independent choice logic (ICL) =-=[23]-=-. In this paper, we continue this line of research towards more sophisticated representation and reasoning techniques for the Semantic Web. We present fuzzy description logic programs (or simply fuzzy... |

155 | P.F.: A proposal for an OWL rules language
- Horrocks, Patel-Schneider
- 2004
(Show Context)
Citation Context ...tion and reasoning capabilities. As a first effort in this direction, RuleML (Rule Markup Language) [2] is an XMLbased markup language for rules and rule-based systems, whereas the OWL Rules Language =-=[10]-=- is a first proposal for extending OWL by Horn clause rules. A key requirement of the layered architecture of the Semantic Web is to integrate the Rules and the Ontology layer. In particular, it is cr... |

117 | Towards a fuzzy description logic for the semantic web
- Straccia
- 2005
(Show Context)
Citation Context ...tains several previous approaches to fuzzy description logics [35, 32, 25, 26], only recently fuzzy description logics for the Semantic Web have been explored. In particular, recent works by Straccia =-=[28, 29]-=- introduce a fuzzy description logic with concrete domains (with reasoning techniques based on a mixture of completion rules and bounded mixed integer programming) as well as a fuzzy extension of SHOI... |

95 | Quantitative Deduction and its Fixpoint Theory - Emden - 1986 |

92 |
eds.: Spinning the Semantic Web: Bringing the World Wide Web to Its Full Potential
- Fensel, Wahlster, et al.
- 2002
(Show Context)
Citation Context ...e a characterization of the canonical semantics of positive and stratified fuzzy dl-programs in terms of a fixpoint and an iterative fixpoint semantics, respectively. 1. Introduction The Semantic Web =-=[1, 7]-=- aims at an extension of the current World Wide Web by standards and technologies that help machines to understand the information on the Web so that they can support richer discovery, data integratio... |

75 | Hybrid probabilistic programs - Dekhtyar, Subrahmanian - 1997 |

70 | R.: A description logic for vague knowledge
- Tresp, Molitor
- 1998
(Show Context)
Citation Context ...ogical consequence of L, denoted L |= F , iff every model of L satisfies F . 3. Fuzzy SHIF(D) and SHOIN (D) Even though the literature contains several previous approaches to fuzzy description logics =-=[35, 32, 25, 26]-=-, only recently fuzzy description logics for the Semantic Web have been explored. In particular, recent works by Straccia [28, 29] introduce a fuzzy description logic with concrete domains (with reaso... |

63 | Well-founded semantics for description logic programs in the semantic Web
- Eiter, Ianni, et al.
- 2011
(Show Context)
Citation Context ...edge bases. Another type of combination is to build ontologies on top of rules, which means that ontological definitions are supplemented by rules or imported from rules. Towards this goal, the works =-=[5, 6]-=- have proposed description logic programs (or simply dlprograms), which are of the form KB = (L, P ), where L is a knowledge base in a description logic and P is a finite set of description logic rule... |

63 | A semantical framework for supporting subjective and conditional probabilities in deductive databases - Ng, Subrahmanian - 1993 |

59 |
Generalizing term subsumption languages to fuzzy logic
- Yen
- 1991
(Show Context)
Citation Context ...ogical consequence of L, denoted L |= F , iff every model of L satisfies F . 3. Fuzzy SHIF(D) and SHOIN (D) Even though the literature contains several previous approaches to fuzzy description logics =-=[35, 32, 25, 26]-=-, only recently fuzzy description logics for the Semantic Web have been explored. In particular, recent works by Straccia [28, 29] introduce a fuzzy description logic with concrete domains (with reaso... |

56 | A fuzzy description logic
- Straccia
- 1998
(Show Context)
Citation Context |

53 | Probabilistic Logic Programming with Conditional Constraints - Lukasiewicz - 2001 |

50 | Description logics with fuzzy concrete domains
- Straccia
- 2005
(Show Context)
Citation Context ...tains several previous approaches to fuzzy description logics [35, 32, 25, 26], only recently fuzzy description logics for the Semantic Web have been explored. In particular, recent works by Straccia =-=[28, 29]-=- introduce a fuzzy description logic with concrete domains (with reasoning techniques based on a mixture of completion rules and bounded mixed integer programming) as well as a fuzzy extension of SHOI... |

49 | Stable semantics for probabilistic deductive databases - Ng, Subrahmanian - 1994 |

48 | Transforming fuzzy Description Logics into classical description logics - Straccia - 2004 |

42 | Antitonic Logic Programs
- Damásio, Pereira
(Show Context)
Citation Context ...toms by truth values. Note that the technique of substituting default-negated atoms by constants in order to define the Gelfond-Lifschitz transformation in the fuzzy case has already been proposed in =-=[15, 3]-=-. In the sequel, let KB = (L, P ) be a fuzzy dl-program. The fuzzy dl-transform of P relative to L and an interpretation I ⊆ HBP , denoted P I L , is the set of all fuzzy dl-rules obtained from ground... |

40 | Tractable probabilistic description logic programs
- Lukasiewicz
- 2007
(Show Context)
Citation Context ...ctively, which are the two most widely used semantics for normal logic programs. The description logic knowledge bases in dl-programs are specified in the description logics SHIF(D) and SHOIN (D). In =-=[17, 18]-=-, towards sophisticated representation and reasoning techniques that also allow for modeling probabilistic uncertainty in the Rules, Logic, and Proof layers of the Semantic Web, we have presented prob... |

37 | The fuzzy description logic f-SHIN
- Stoilos, Stamou, et al.
- 2005
(Show Context)
Citation Context ...mixture of completion rules and bounded mixed integer programming) as well as a fuzzy extension of SHOIN (D) (without reasoning machinery). Closely related to the latter is the work by Stoilos et al. =-=[24]-=-, which combines the description logic SHIN with fuzzy set theory for the Semantic Web. For our combination of fuzzy description logics with fuzzy normal programs under the answer set semantics, we us... |

36 |
Classical negation in logic programs and deductive databases. New generation computing
- Gelfond, Lifschitz
- 1991
(Show Context)
Citation Context ...al knowledge (gained in the program) can be supplied to L before querying. The semantics of dl-programs was defined in [5] and [6] as an extension of the answer set semantics by Gelfond and Lifschitz =-=[8]-=- and the well-founded semantics by Van Gelder, Ross, and Schlipf [33], respectively, which are the two most widely used semantics for normal logic programs. The description logic knowledge bases in dl... |

25 | Uncertainty in description logic programs
- Straccia
- 2004
(Show Context)
Citation Context ...ics by fuzzy vagueness and imprecision in both the description logic and the logic program component. Even though there has been previous work on positive fuzzy description logic programs by Straccia =-=[30, 31]-=-, to our knowledge, this is the first approach to fuzzy description logic programs with default negation in rule bodies. Furthermore, differently from Straccia, we also allow for a flow of information... |

19 | Fixpoint characterizations for many-valued disjunctive logic programs with probabilistic semantics
- Lukasiewicz
- 2001
(Show Context)
Citation Context ...ide an implementation of fuzzy dlprograms under the answer set semantics, which seems to be possible by a reduction to dl-programs under the answer set semantics (along the lines already described in =-=[16]-=-for many-valued disjunctive logic programs). Finally, another topic for future research is to integrate more expressive fuzzy description logics into fuzzy dl-programs. Acknowledgments. This work has... |

18 | Fuzzy description logic programs
- Straccia
- 2006
(Show Context)
Citation Context ...ics by fuzzy vagueness and imprecision in both the description logic and the logic program component. Even though there has been previous work on positive fuzzy description logic programs by Straccia =-=[30, 31]-=-, to our knowledge, this is the first approach to fuzzy description logic programs with default negation in rule bodies. Furthermore, differently from Straccia, we also allow for a flow of information... |

17 | Many-valued disjunctive logic programs with probabilistic semantics
- Lukasiewicz
- 1999
(Show Context)
Citation Context ...toms by truth values. Note that the technique of substituting default-negated atoms by constants in order to define the Gelfond-Lifschitz transformation in the fuzzy case has already been proposed in =-=[15, 3]-=-. In the sequel, let KB = (L, P ) be a fuzzy dl-program. The fuzzy dl-transform of P relative to L and an interpretation I ⊆ HBP , denoted P I L , is the set of all fuzzy dl-rules obtained from ground... |

14 | Probabilistic and truth-functional many-valued logic programming - Lukasiewicz - 1999 |

8 | Many-valued first-order logics with probabilistic semantics - Lukasiewicz - 1998 |

7 | A Quantitative Extension of Disjunctive Logic Programming - Mateis - 1998 |

4 |
web ontology language overview, 2004. W3C Recommendation (10 February 2004). Available at www.w3.org/TR/2004/REC-owl-features-20040210
- OWL
(Show Context)
Citation Context ...en, Favoritenstr. 9-11, A-1040 Wien, Austria; lukasiewicz@kr.tuwien.ac.at. The Semantic Web consists of several hierarchical layers, where the Ontology layer, in form of the OWL Web Ontology Language =-=[34, 11]-=- (recommended by the W3C), is currently the highest layer of sufficient maturity. OWL consists of three increasingly expressive sublanguages, namely OWL Lite, OWL DL, and OWL Full. OWL Lite and OWL DL... |