𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Extending soft sets with description logics

✍ Scribed by Yuncheng Jiang; Yong Tang; Qimai Chen; Ju Wang; Suqin Tang

Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
656 KB
Volume
59
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

✦ Synopsis

Molodtsov initiated the concept of soft set theory, which can be used as a generic mathematical tool for dealing with uncertainty. Description Logics (DLs) are a family of knowledge representation languages which can be used to represent the terminological knowledge of an application domain in a structured and formally well-understood way. The current research progress and the existing problems of soft set theory are analyzed. In this paper we extend soft sets with DLs, i.e., present an extended soft set theory by using the concepts of DLs to act as the parameters of soft sets. We define some operations for the extended soft sets. Moreover, we prove that certain De Morgan's laws hold in the extended soft set theory with respect to these operations.

πŸ“œ SIMILAR VOLUMES

Extending description logics with uncert
Extending description logics with uncertainty reasoning in possibilistic logic
✍ Guilin Qi; Qiu Ji; Jeff Z. Pan; Jianfeng Du πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 290 KB

Possibilistic logic provides a convenient tool for dealing with uncertainty and handling inconsistency. In this paper, we propose possibilistic description logics as an extension of description logics, which are a family of well-known ontology languages. We first give the syntax and semantics of pos

Preferred answer sets for extended logic
Preferred answer sets for extended logic programs
✍ Gerhard Brewka; Thomas Eiter πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 442 KB

In this paper, we address the issue of how Gelfond and Lifschitz's answer set semantics for extended logic programs can be suitably modified to handle prioritized programs. In such programs an ordering on the program rules is used to express preferences. We show how this ordering can be used to defi

Extending the Reach of SAT with Many-Val
Extending the Reach of SAT with Many-Valued Logics
✍ RamΓ³n Bejar; Alba Cabiscol; Cesar FernΓ‘ndez; Felip ManyΓ ; Carla Gomes πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 197 KB

We present Regular-SAT, an extension of Boolean Satisfiability based on a class of many-valued CNF formulas. Regular-SAT shares many properties with Boolean SAT, which allows us to generalize some of the best known SAT results and apply them to Regular-SAT. In addition, Regular-SAT has a number of a