EXTENDING OWL BY FUZZY DESCRIPTION LOGIC

本文提出了一种扩展OWL的方法,通过引入模糊构造器、公理和约束来表示模糊知识,并利用模糊描述逻辑和约束传播演算直接进行模糊知识推理。

Abstract:

Technology about ontology plays an important role in all kinds of technologies of Semantic Web. OWL, the standard web ontology language is proposed by W3C. However, vocabularies in OWL only represent certain and complete concepts and roles. In order to represent fuzzy knowledge, this paper extends existing OWL language with some new vocabularies by fuzzy constructorsaxioms and constraints. The paper maps semantics of these new vocabularies to fuzzy description logic and directly reasons fuzzy knowledge using constraint propagation calculus. The paper presents a new method of representing and reasoning fuzzy ontology.

Keywords:

OWL; fuzzy logic; fuzzy OWL;

1.         Introduction

With the development of the Semantic Web1, research about ontology is playing a central role as a source of shared and exchanged information over Semantic Web. OWL5, the standard web ontology language proposed by W3C recently, is intended to represent terms and their interrelationships in applications. However, vocabularies in OWL only represent certain and complete knowledge. There are so much uncertain and incomplete knowledge in real world, especially in the World Wide Web, which is huge and can be partially known.

In the last decades, impressive technologies about fuzzy and uncertain knowledge have been developed in literature [3.4.6.7.8]. It is an interesting and appealing idea to extend OWL using these technologies. The literature [4] extends OWL using probabilistic knowledge. In fact, uncertain knowledge or vague concepts is as important as probabilistic knowledge in real world. In the paper, We extend OWL by fuzzy constructorsaxioms and constraints (denoted FOWL). Moreover, we map semantics of new fuzzy terms to fuzzy description logic and directly reason fuzzy knowledge by constraint propagation calculus

In the following section we recall fuzzy description logic and constraint propagation calculus from literature [7]. Section 3 elaborates fuzzy constructorsaxioms and constraints in FOWL. Section 4 gives a reasoning example. Section 5 is summary and further research work..

2.         Fuzzy description logic

MS Word users: please use the paragraph styles contained in this document: Title, Author, Affiliation, Abstract, Keywords, Body Text, Equation, Reference, Figure, and Caption. Try not to change the styles manually.

2.1.         Syntax

Fuzzy description logic can present vague concepts and roles as well as interoperates in these concepts and these roles. From a fuzzy set9 point of view, vague concepts or roles can be seen as fuzzy sets in universe U or universe . A fuzzy set S with respect to a universe U is characterized by a membership function . If AB are fuzzy concepts and R is a atomic fuzzy rolethen  are fuzzy concepts. The membership functions of these concepts satisfy following restrictions: for all  

A fuzzy knowledge base (FK) consists of a set  of fuzzy terminological axioms, and a set  of fuzzy assertions. A fuzzy terminological axiom knowledge base  consists of a set of axioms of the form or . A fuzzy assertion knowledge base  consists of a set of three fuzzy constrains of the form , where ab are objects ( individuals and variables) in domain U; . A fuzzy constraint is an expression having one of the forms and   , where  are objects ( individuals and variables) in domain U; . Though three fuzzy constrains are only involved in fuzzy assertions knowledge base, other forms will be used in reason procedure.

2.2.   Semantics

A fuzzy interpretation is a pair  where is the domain whereas I is an interpretation function mapping different individuals in universe U into different element, a fuzzy concept A into a membership function , a fuzzy role R into a membership function .Moreover, the interpretation function I satisfies the following equations: for all  

A fuzzy interpretation  satisfies a fuzzy terminological axiom (  or ) iff for  or . A fuzzy interpretation   satisfies a fuzzy terminological axiom knowledge base  ( ) iff the fuzzy interpretation satisfies every terminological axiom in . Similarly, a fuzzy interpretation satisfies fuzzy assertions, iff for (A fuzzy interpretation is extended to variables by mapping these variables into elements of the fuzzy interpretation domain). A fuzzy interpretation satisfies a fuzzy assertion knowledge base  ( ) iff the fuzzy interpretation satisfies every assertion in . A fuzzy interpretation  satisfies a fuzzy knowledge base or is a model of a fuzzy knowledge base ( ) iff it satisfies every fuzzy terminological axiom or assertion in FK.

 

2.3.   Reason tasks and constraint propagation calculus

Given a fuzzy knowledge base FK, the most important reason task is deciding satisfiability of FK. If FK is satisfied, for given fuzzy assertion or fuzzy terminological axiom  another important reason task is deciding whether  or  is a fuzzy entailment of the fuzzy knowledge base FK. The fuzzy entailment problem can be reduced to the satisfiability problem.

If fuzzy knowledge base can be transformed into pure fuzzy assertion knowledge base, the satisfiability problem can be resolved using constraints propagation rules. The transformation work from the literature [6] can be extended as follows:

·         Elimination of concept subsumption: each concept subsumption  is replaced with a concept equation , where  is a new primitive concept,  is new fuzzy terminological knowledge base.

·         Expansion of : every defined concept (the lift argument of a concept equation) which occurs in the defining term of another concept equation (the right argument of a concept equation) is substituted by its defining term to acquire . The process is iterated until there remain only undefined concepts in the right arguments of concept equation.

·         Expansion of : every primitive concept occurring in  is substituted by its defining term in . This yields .

The above transformation has the nice property that  iff , where is obtained by replacing every primitive concept occurring in with its defining term in .

All problems can be reduced to determine whether a finite set S of fuzzy constraints is satisfiable or not. The problem is based on a set of constraints propagation rules transforming a set S of fuzzy constraints into “simpler” satisfiability preserving sets  until either all  contain a clash or some is completed and clash-free.

A set of fuzzy constraints S contains a clash iff it contains either one of the constraints in Table 1or S contains a conjugated pair (Under the condition the row-column pair of fuzzy constraints in table 2 is a conjugated pair.).

 Table 1 Clashes             Table 2 Conjugated Pairs            


Concerning the constraints propagation rules, for 5 connective  and 4 relations , there are 20 rules. The rules are as follow:

 If x is a new variable and there is no such that both ( ) are already in the constraint set.

Because rules about  are same as the rules about   ,  they are omitted.

3.         Extending fuzzy terms for OWL

Number section and subsection headings consecutively in Arabic numbers and type them in bold. Use point size 10 for section headings and 10 for subsection headings. Avoid using too many capital letters. Keep section and subsection headings always flushed left. If any further subdivision of a subsection is needed the titles should be 10 point.

3.1    Extending fuzzy constructors and axioms

From the point of fuzzy set14, common concepts are special fuzzy concepts, that is, for all individual in domain U membership function either is 1 or is 0. So class descriptions in OWL can naturally be extended to class descriptions of fuzzy concepts. If  “fdl” (fuzzy description logic) is namespace of fuzzy knowledge, all  class descriptions (intersection, union, complement) and concept axioms (subsumption, equation) can use RDF/XML syntax same as OWL. Moreover, prefix of these terms is “fdl”. Particular formats are in table 3.

Table 3 Fuzzy OWL

Fuzzy

constructor

/ FDL  syntax

Examples for FOWL

fdl:Class

/ AB

<fdl:Class rdf:ID="A"/>

<fdl:Class rdf:ID="B"/>

fdl:intersection

-Of

/

<fdl:Class>

 <fdl:intersectionOf fdf:parseType="Collection">

<fdl:Class rdf:about="#A"/>

<fdl:Class rdf:about="#B"/>

</fdl:intersectionOf>

</fdl:Class>

fdl:unionOf

/

<fdl:Class>

<fdl:unionOf rdf:parseType="Collection">

<fdl:Class rdf:about="#A"/>

<fdl:Class rdf:about="#B"/>

</fdl:unionOf>

</fdl:Class>

fdl:complement-Of

/

<fdl:Class>

<fdl:complementOf>

<fdl:Class rdf:about="#A"/>

</fdl:complementOf>

</fdl:Class>>

fdl:someValues

-From

/

<fdl:Restriction>

<fdl:onProperty rdf:resource="#R" />

<fdl:someValuesFrom rdf:resource="#A" />

</fdl:Restriction>

fdl:allValues

-From

/

<fdl:Restriction>

<fdl:onProperty rdf:resource="#R" />

<fdl:allValuesFrom rdf:resource="#A"/>

</fdl:Restriction

fdl:subClassOf

/

<fdl:Class rdf:ID="A">

  <fdl:subClassOf rdf:resource="#B" />

</fdl:Class>

fdl:equivalent

-Class

/

<fdl:Class rdf:about="#A">

<fdl:equivalentClass rdf:resource="#B"/>

</fdl:Class>

 

3.2    Extending fuzzy constraints

Fuzzy constraints are also important formats in fuzzy knowledge base. There are not matching components of fuzzy constraints in OWL. Fuzzy constraints can be seen as range of individual belonging to fuzzy concepts with respect to the domain. So we may represent fuzzy constraints with range of membership function of these concepts. We define term “fdl: individual” and  “fdl: individuals” representing singular individual and dual individuals respectively. The term has attribute “fdl:name” whose value restricts individual’s name. If the term represents dual individuals, its attribute term come forth twice. We also define term “fdl:membershipOf” which represent degree of individual belonging to the fuzzy concept. Four degree term matching the term are “fdl:moreOrEquivalent”“fdl:lessOrEquivalent”“fdl:moreThan”“ fdl:lessThan”. They represent constraints such as more or equivalent, less or equivalent, more, and less in order. Table 4 shows in detail.

Table 4   Fuzzy constraints in FOWL

Fuzzy

constraints

Examples for FOWL

<fdl: individual fdl:name="a">

  <fdl:membershipOf rdf:resource="#A"/>

  <fdl:moreOrEquivalent fdl:value=n/>

</fdl:individual>

<fdl: individual fdl:name="a">

  <fdl:membershipOf rdf:resource="#A"/>

  <fdl:lessOrEquivalent fdl:value=n/>

</fdl:individual>

<fdl: individuals fdl:name="a" fdl:name=”b”>

 <fdl:membershipOf rdf:resource="#R"/>

  <fdl:moreOrEquivalent fdl:value=n/>

</fdl:individuals>

<fdl: individual fdl:name="a">

  <fdl:membershipOf rdf:resource="#A"/>

  <fdl:moreThan fdl:value=n/>

</fdl:individual>

<fdl: individual fdl:name="a">

  <fdl:membershipOf rdf:resource="#A"/>

  <fdl:lessThan fdl:value=n/>

</fdl:individual>

<fdl: individuals fdl:name="a" fdl:name=”b”>

  <fdl:membershipOf rdf:resource="#R"/>

  <fdl:lessOrEquivalent fdl:value=n/>

</fdl:individuals>

<fdl: individuals fdl:name="a" fdl:name=”b”>

  <fdl:membershipOf rdf:resource="#R"/>

  <fdl:moreThan fdl:value=n/>

</fdl:individuals>

<fdl: individuals fdl:name="a" fdl:name=”b”>

  <fdl:membershipOf rdf:resource="#R"/>

  <fdl:lessThan fdl:value=n/>

</fdl:individuals>

 

 

4.         An example

Example 1: Suppose we have two images i1 and i2. Their contents are driving cars in the street. An underlying image analysis tool recognizes, among all the recognized objects, there is a Ferrari in image i1, while there is a Porsche in image i2. Furthermore, a semantic image indexing tool established that, image i1 is about a Ferrari to some degree 0.6, whereas image i2 is about a Porsche to some degree 0.8. The FOWL snippet is as figure 2. We want to know if image i1 is about a car to some degree 0.6. This is a typical problem of deciding if the assertion is fuzzy entailment of the fuzzy OWL. The question can be represented as figure 3.

Figure 1 FOWL snippet

Figure 2 Question

Reason process is as follow:

1.Elimination of concept subsumption

2. Expansion of terminological axiom knowledge baseThe less format of the question merges into conversing assertion knowledge base as figure 4

4.          Finish reasoning task with the constraints propagation rules. Detailed process represented by fuzzy description logic is in the appendix 1. There is a clash in the above FOWL, so the question is fuzzy entailment of the FOWL.

5.         Summary and future work

This paper extends OWL language by fuzzy constructors axioms and constraints. Moreover, the paper maps semantics of new vocabularies to fuzzy description logic and directly reasons fuzzy knowledge using constraint propagation calculus.

We are actively working on resolving how to implement parser and reasoning machine for FOWL. The parser can parse fuzzy knowledge base represented by FOWL and the reasoning machine can automatically finish related reason tasks of fuzzy ontology.

 

Acknowledgements

The work is (Partially) supported by the NSFC major research program: "Basic Theory and Core Techniques of Non-Canonical Knowledge" (60496322) and Open Foundation of Beijing Municipal Key Laboratory of Multimedia and Intelligent Software Technology.

References

[1]       T. Berners-Lee, J. Hendler, O. Lassila, “The Semantic Web,” Scientific Am., vol. 284, no. 5, pp. 34–43, 2001.

[2]       Z. Ding, Y. Peng, “A Probabilistic Extension To Ontology Language OWL,” Proc. Of The 37th Hawaii International Conference on System Sciences, 2004.

[3]       R. Giugno, T. Lukasiewicz,P-SHOQ(D): A Probabilistic Extension of SHOQ(D) for Probabilistic Ontologies in The Semantic Web,” Technical Report INFSYS RR-1843-02-06, Institut f¨ur Informationssysteme, Technische Universit¨at Wien, April 2002.

[4]       I. Horrocks, P. Patel-Schneider, F. Harmelen, “From SHIQ and RDF to OWL: the making of a Web Ontology language,” Journal of Web Semantics, 1(1):7--26, 2003.

[5]       U.Straccia, “A Fuzzy Description Logic,” Proc. Of 15th National Conference on Artificial Intelligence, Madison ,Wisconsin, 1998.

[6]       U. Straccia, “Reasoning within Fuzzy Description Logics,” Artif.Intell.Res, 14:137-166,2001.

[7]       C.B Tresp, R.Molitor, “A Description Logic for Vague Knowledge,” Proc. Of  ECAI-98, pp 361-365,1998.

[8]       L. Zadeh, Fuzzy sets Information and Control.vol. 8.pp.338-353.1965

【重要提示】本资源设置为0积分下载,若非0积分请勿轻易下载 亲爱的CSDN用户: 首先感谢你点进这个资源页面。我需要提前说明一个重要情况: 本资源原本已设置为“0积分下载”,即作者希望完全免费共享。但CSDN平台有时会根据文件的下载热度、文件大小、用户权限等因素,自动将部分资源的积分调整为非0数值(如1积分、2积分、5积分等)。这是平台系统的自动行为,而非作者本人的设定。 因此,如果你当前看到该资源的下载所需积分不是0(例如显示为1、2、3……),请谨慎决定是否下载。 如果你按照非0积分支付并下载后发现资源内容不符合预期、链接失效,或者实际上该资源本应是免费的,作者无法为此承担积分损失或退还操作。强烈建议:仅在页面显示为0积分时进行下载。 另外,本资源描述中并未直接提供具体的下载地址或外部链接,因为它本身是一个通过CSDN官方上传通道提交的文件/内容包。如果你看到描述中没有外部网盘地址,这是正常的——资源文件应通过CSDN内置的“下载”按钮获取。若因平台积分显示异常导致你支付了积分,请优先联系CSDN客服咨询积分退还政策,作者没有权限修改平台自动设定的积分值。 感谢你的理解与支持。技术分享本应开放,但受限于平台规则,特此提醒如上。祝学习进步!
内容概要:本文系统介绍了基于最小势能原理(即能量法)的物理信息神经网络(PINNs)在求解固体力学二维问题中的理论框架与应用实践,并提供了完整的PyTorch代码实现案例。该方法通过将物理系统的总势能泛函嵌入神经网络的损失函数中,利用深度学习框架直接求解满足控制方程和边界条件的位移场近似解,避免了传统数值方法对网格划分的依赖。文章重点剖析了基于变分原理的能量形式如何替代强形式偏微分方程构建损失项,提升了求解的稳定性与泛化能力。同时,研究对比了不同PINNs架构与训练策略在处理复杂几何形状、非均匀材料属性及非线性力学行为时的精度、收敛性与计算效率,验证了其在处理经典弹性力学问题(如平面应力/应变问题)中的有效性与潜力。配套代码便于读者复现结果并拓展至更广泛的工程应用场景。; 适合人群:具备一定深度学习基础和固体力学知识的研究生、科研人员及工程技术从业者,特别适用于从事计算力学、智能仿真、物理驱动建模、结构分析等方向的研究者。; 使用场景及目标:①掌握基于能量法的PINNs建模范式,理解其相较于传统有限元法的优势与局限;②研究物理信息神经网络在无网格求解复杂边界与非线性问题中的能力;③对比不同神经网络结构对求解精度与收敛速度的影响,推动PINNs在工程实际中的落地应用。; 阅读建议:建议读者结合所提供的PyTorch代码逐模块分析网络构建、能量泛函定义、边界条件施加及训练流程设计,深入理解物理约束与机器学习模型的融合机制,并鼓励在自定义问题中调整网络参数、采样策略与损失权重以优化性能。
【重要提示】本资源设置为0积分下载,若非0积分请勿轻易下载 亲爱的CSDN用户: 首先感谢你点进这个资源页面。我需要提前说明一个重要情况: 本资源原本已设置为“0积分下载”,即作者希望完全免费共享。但CSDN平台有时会根据文件的下载热度、文件大小、用户权限等因素,自动将部分资源的积分调整为非0数值(如1积分、2积分、5积分等)。这是平台系统的自动行为,而非作者本人的设定。 因此,如果你当前看到该资源的下载所需积分不是0(例如显示为1、2、3……),请谨慎决定是否下载。 如果你按照非0积分支付并下载后发现资源内容不符合预期、链接失效,或者实际上该资源本应是免费的,作者无法为此承担积分损失或退还操作。强烈建议:仅在页面显示为0积分时进行下载。 另外,本资源描述中并未直接提供具体的下载地址或外部链接,因为它本身是一个通过CSDN官方上传通道提交的文件/内容包。如果你看到描述中没有外部网盘地址,这是正常的——资源文件应通过CSDN内置的“下载”按钮获取。若因平台积分显示异常导致你支付了积分,请优先联系CSDN客服咨询积分退还政策,作者没有权限修改平台自动设定的积分值。 感谢你的理解与支持。技术分享本应开放,但受限于平台规则,特此提醒如上。祝学习进步!
打开链接下载源码: https://pan.quark.cn/s/a4b39357ea24 UG(Unigraphics)作为一种在机械工程设计与制造领域内被广泛应用的计算机辅助设计与制造(CAD/CAM)软件,其功能非常全面。在UG CAM模块中,后处理步骤占据着核心地位,其作用在于将UG系统生成的刀具路径转化为特定机床能够识别的NC(数控)代码。这一过程具有高度的定制性,目的是确保生成的NC代码与特定机床控制系统的语言规范和功能特性实现精确对接。标题所提及的“UG .车床后处理”具体指向的是UG CAM系统中针对车床加工需求的后处理流程。车床主要承担旋转工件的切削任务,能够对轴类、盘类零件的内外圆柱表面、圆锥表面、螺纹以及沟槽等复杂形状进行加工。后处理的核心任务是将UG设计的3D模型和刀具路径转化为实际车床能够执行的详细指令,这些指令涵盖了进给速度、主轴转速、刀具更换机制以及冷却液控制等多个方面。描述中标注的“FANUC和GSK980TD通用”表明该后处理程序适用于两种主流的数控系统,即FANUC系统和GSK980TD系统。FANUC作为全球知名的数控系统供应商,其产品被广泛应用于各类机床设备;GSK980TD则是由中国广州数控设备有限公司研发的一款普及型数控系统,常在中小型加工中心和车床上部署使用。标签“UG车床后处理”进一步明确了讨论焦点,即探讨如何通过定制和使用UG的后处理器来满足车床的NC编程需求。压缩包中的文件列表如下: 1. GSK980TDa.def:这个文件属于后处理定义文件,其中包含了UG后处理器配置的详细参数,例如机床参数、运动类型以及代码格式等。用户可以通过编辑此文件来调整后处理输出的NC代码,使其符合GSK980TD数控系统的使用要求。 ...
代码下载地址: https://pan.quark.cn/s/a4b39357ea24 是读写权限 不是读取存储权限 视频错了 快速开始(适合 Fork) 点击右上角 Fork 本仓库到你的 账号。 打开你的仓库,进入 Actions 页面,点击 Enable workflows(启用 Actions)。 无需其他配置, 默认的 _TOKEN 权限即可推送更新。 你可以手动点击 Run workflow,也可以等待每天定时自动检查。 注意:确保你的仓库默认分支为 main,否则推送时可能失败。 如果觉得这个项目对你有帮助,欢迎顺手点个 Star 支持一下! 功能介绍 每天自动检查 bia-pain-bache/BPB-Worker-Panel 仓库的最新 Release 支持选择更新正式版或预发布版本:通过手动触发或 文件配置 1是正式版 0是测试版本。 自动下载最新版本的 worker.js 重命名为 \_worker.js 同步更新本地 version.txt 自动提交并推送到本仓库 如果 文件不存在,将自动创建并默认设置为更新正式版。 更新成功后,自动复用或创建 Issue 进行通知。 工作流程 Actions 会每日 00:00(UTC 时间)自动运行: 检查 文件:如果文件不存在,会自动创建并写入 (表示正式版)。 根据 或手动输入确定更新类型(正式版或预发布版)。 获取上游仓库的最新 Release 版本号(根据所选类型)。 比较本地 version.txt 的记录。 若版本不同,则自动下载并替换 \_worker.js。 更新 version.txt。 自动提交并推送到主分支(main)。 如果 文件是自动创建的,也会一并提交到仓库。 如果更新成功并...
代码下载链接: https://pan.quark.cn/s/1584eba52518 在使用TensorFlow 2.x版本进行深度学习的过程中,有时可能会遭遇无法调用GPU的情况。本文主要研究了在TensorFlow 2.x(此处为2.2版本)中遇到GPU调用失败的一个具体解决途径,该问题可能源于库文件缺失或路径配置存在错误。 当执行`tf.test.is_gpu_available()`以检查GPU可用性时,返回`False`表明TensorFlow无法识别或访问GPU。在本例中,错误信息指出找不到`libcudnn.so.7`文件,这是CuDNN库的一个关键组成部分,用于加速深度学习运算。CuDNN是由NVIDIA开发的一个深度学习库,与CUDA协同工作,旨在优化TensorFlow在GPU上的性能表现。 通常,CuDNN应与CUDA版本保持一致。在这种情况下,服务器上安装的是CUDA 10.1,理论上与TensorFlow 2.2相容。然而,由于`libcudnn.so.7`文件缺失,导致了问题的出现。潜在的原因可能是CuDNN未正确安装或文件路径未被系统正确识别。 为解决这个问题,可以尝试以下步骤: 1. 首先核实CUDA和CuDNN是否已正确安装。在服务器的`/usr/local/cuda/lib64`目录下查找`libcudnn.so.7`文件。如果无法找到,说明CuDNN可能未正确安装或文件已丢失。 2. 下载与CUDA版本相匹配的CuDNN。由于在命令行下无法直接下载,可以在本地计算机上下载Linux版本的CuDNN `.tar.gz` 文件,然后通过SCP命令将其传输到服务器。 3. 在服务器上解压缩CuDNN文件,将解压后的`cuda`文...
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值