原站英文机器转录 + 本地中文机器初译(未完成逐句听审) 原作者及许可见 attribution.txt;中文由九天新增,不代表原作者认可。 00:00:00.270 EN: Today, I plan to do a few things. First of all, I would like to ask if you have any questions on the part of the Chapter 7 All Semantics and Reasoning that, to my understanding, Søren had started last week, until about slide 30, when the Tableau algorithm starts. 中文初译: 今天,我计划做一些事情。首先,我想问你们是否对第七章中的所有语义和理由有任何疑问,据我所知,索伦是上星期开始的,直到第30页左右,即波浪算法开始的时候。 00:00:30.670 EN: So, since this is a relatively complicated material, and certainly relative to this lecture, a little bit more involved and complicated to digest. 中文初译: 所以,由于这是一个相对复杂的材料, 并且肯定与这次演讲有关, 稍微多一点参与和复杂来消化。 00:00:45.510 EN: Then other materials, like RAF or SPARQL, they are, I think, easier. I would like to first ask if there are any questions, and perhaps I can even run through the material very quickly, unless it has been clear for everybody, in which case we can skip to slide 30 right away. That's one thing. 中文初译: 然后,其他材料,如RAF或SPARQL,我认为,它们比较容易。我想首先问是否有问题,也许我甚至可以很快地浏览这些材料,除非大家都很清楚,这样我们就可以跳过,立即滑30。这是一回事。 00:01:12.610 EN: Then I would focus more on the latter part, so the last 10 or so slides, which are about the Tableau algorithm and how this works. 中文初译: 然后,我将更侧重于后半部分,也就是最后10张左右的幻灯片,这些幻灯片是关于波浪算法和它如何运作的。 00:01:24.410 EN: I will try to explain this. It has been a while since I have learned this myself, indeed about 15 years. And since then, I haven't really touched this material, at least not in depth. 中文初译: 我会试着解释一下。我很久没有自己学到这个了,实际上15年了。从那时以来,我没有真正接触过这个材料,至少没有深度。 00:01:38.230 EN: So, it has been quite a challenge for me to recall all this as well. So, I hope I deliver this material in an understandable manner. 中文初译: 因此,我回顾所有这一切也是一大挑战。 所以,我希望我以可以理解的方式提供这一材料。 00:01:50.210 EN: To try to do so, I'm also planning to draw and sketch some Tableaus live here. So, let's see how that works in a Google Sheet or so, so that you can perhaps follow how this all works, and it becomes perhaps more understandable. 中文初译: 为了尝试这样做,我还计划在这里画画一些排列表。所以,让我们看看谷歌工作表如何运作,这样你也许可以了解这一切是如何运作的, 也许这更容易理解。 00:02:12.380 EN: And then I have a few demos also. I actually managed to dig out an old tool that I wrote. It's a JavaScript implementation of an ALC Tableau Reasoner, which I wrote for in 2007. 中文初译: 然后,我还做了一些演示。我实际上找到了一个我写的旧工具。这是JavaScript在2007年为ALC Callau理学家撰写的论文。 00:02:34.950 EN: And you barely remember, but at that time, we had Firefox 2.0.0.3. So, I managed to dig out that code again, and I put it now on GitHub. 中文初译: 你几乎记不起来,但当时我们拿到了Firefox 2.0.0.3。所以,我设法又找到了密码, 现在把它放在GitHub上。 00:02:49.290 EN: And yeah, it's available online. You can play around if you want to see how the Tableau works. And then I also have a more practical example in Protege where I show you briefly an ontology, very simple ontology, and how you can use reasoning services in practice, and how they explain all the inconsistencies and so on. 中文初译: 是的,它可以在网上找到。如果你想看看排列图是如何工作的,你可以到处玩。然后我还有一个更实用的例子, Protege, 我在这里向大家简单展示一个本体论,非常简单的本体论, 还有你如何在实践中使用推理服务, 以及它们如何解释不一致等等。 00:03:19.750 EN: So, we'll touch upon that also. I hope this helps to make this material a bit less dry, because I think if it's only on slides, it's a little bit not so easy to follow and digest. 中文初译: 所以,我们也会讨论这个问题。我希望这能帮助 使这些材料少一点干燥, 因为我认为如果它只是放在幻灯片上, 它有点不太容易追踪和消化。 00:03:36.490 EN: Good. So, we are at 17, so I suppose we can start. So, the first question, as I said, is are there any questions from the material that you heard last week? 中文初译: 很好,我们17岁了,所以我想我们可以开始。那么,正如我所说,第一个问题, 上星期你听到的材料里有没有问题? 00:03:53.530 EN: So, this is largely introduction to all semantics, description logics. Ben, since this is quite tough material, I would like to ask if there are any questions. You can write in the chat as usual, or I'm monitoring also the chat, or otherwise just speak up. 中文初译: 因此,这基本上是所有语义学、描述逻辑的介绍。本,由于这是非常困难的材料,我想问一下是否有问题。你可以像往常一样在聊天中写字,或者我也会监控聊天,或者只是大声说出来。 00:04:19.580 EN: We are 17 people, so I think it's fine to just raise your hand or also just speak up. Oh, Marcus, yeah, you are right that in the last lecture, it was a bit difficult to understand. 中文初译: 我们是17个人,所以我认为只要举起你的手或者大声说出来是好的。 哦,马库斯,没错,你说得对,在上次的演讲中,这有点难以理解。 00:04:35.800 EN: It would be good if you can just give us like a really short overview. Maybe we can learn from it. Yes. Yeah, I can quickly run through the slides if that's useful. 中文初译: 如果你能像一个非常简短的概述那样向我们介绍一下,那将是件好事。也许我们可以从中学习。是的。如果有用的话,我可以快速浏览幻灯片。 00:04:49.560 EN: I won't spend too much time on this, but I can quickly do that just to remind everybody about the content of last week. 中文初译: 我不会花太多时间做这件事, 但我可以很快地这样做, 仅仅提醒大家上星期的内容。 00:04:59.940 EN: Good, so these were large introduction lectures. I think also this is just setting the stage. It's not very important. 中文初译: 很好,所以这些是大型的介绍讲座。我认为这也只是为舞台准备而已。这不重要。 00:05:10.220 EN: Our semantics and our deal in particular are grounded in description logics, and that's essentially what gives the theoretic base for our deal. 中文初译: 我们的语义学 特别是我们的交易 都基于描述逻辑 这基本上就是我们交易的理论基础 00:05:27.880 EN: And then I think Søren described really what descriptions or logics are. These are fragments of first order logic, and you probably have heard of this. 中文初译: 然后我想索伦描述了真正的描述或逻辑。这些是第一级逻辑的片段,你们可能听说过这一点。 00:05:38.400 EN: The nice thing about these description logics is that they are generally decidable and less expressive than first order logic, and therefore also decidable, but still expressive enough to allow the description of relatively complex knowledge in various domains. 中文初译: 这些描述逻辑的好之处在于,这些逻辑一般是可变的,比第一顺序逻辑的表达力要低,因此也是可变的,但是仍然足以说明各个领域相对复杂的知识。 00:06:00.700 EN: So that's why they have a nice trade-off between computational complexity and the ability to express also complex domain knowledge. 中文初译: 因此,在计算的复杂性 和表达复杂领域知识的能力之间, 他们有一个良好的权衡。 00:06:18.120 EN: There are various components in description logic. So you have heard of concepts, atomic concepts, like students. 中文初译: 描述逻辑中有各种各样的组成部分。所以你听说过概念,原子概念,像学生一样。 00:06:26.680 EN: They are not further described, books and so on. There are roles. These are the relationships between individuals, like born in, so a person is born in a city, works for, a person works for some organization. 中文初译: 这些是个人之间的关系,比如出生在城市里,为某个组织工作。 00:06:45.820 EN: And then you have individual names. These are then concrete things, concrete entities like a concrete person, a concrete car, a concrete house, a concrete organization like TIB. 中文初译: 然后你们有个人的名字。这些是具体的东西, 混凝土实体,如混凝土人,水泥车,混凝土房子, 像TIB这样的具体组织。 00:07:00.920 EN: And these entities here, so concepts, relations or roles, properties, they are called a little bit synonymous in various, using various terms like properties, also concepts and classes. 中文初译: 这些实体在这里, 所以概念,关系或角色, 属性, 它们被称作一个小的同义词, 在各种方面, 使用不同的术语, 比如属性, 以及概念和类别。 00:07:19.280 EN: Sometimes you're hearing in the context of old and the language itself, people tend to speak about classes versus when you talk about description logics in this context, often the word concept is used. 中文初译: 有时你听到的是古老的语言本身, 人们倾向于谈论班级, 而当你谈论描述逻辑时, 常常使用这个词的概念。 00:07:35.160 EN: Same thing for role, don't confuse yourself too much. So when we talk about description logics, we often speak of roles, but then in OWL, they are generally then properties. 中文初译: 角色是一样的, 不要混淆自己太多。 所以当我们谈论描述逻辑时, 我们经常谈论角色, 但是在“ OWL ” 中, 它们通常就是属性。 00:07:48.840 EN: So that can be a little confusing too, but it's synonymous here. So a knowledge base is formed by these concepts, these individuals and these roles. 中文初译: 所以这也可能有点混乱, 但在这里它就是同义词。所以知识库是由这些概念、 个人和角色组成的。 00:08:02.820 EN: And we separate in particular two parts in a knowledge base, that's once the T-box and an A-box. So the T-box is contains all the, let's say schema knowledge and the concepts, the roles, the definitions of the concepts and the definition of roles. 中文初译: 我们把知识库中的两部分特别分开, 也就是“T-box”和“A-box”。所以“T-box”包含了所有的,让我们说,“Schema”知识和概念、角色、概念定义以及“角色”的定义。 00:08:21.560 EN: So these are axioms that make up the T-box and the A-box contains assertions, so individuals, information about individuals. 中文初译: 所以这些是构成T-box和A-box的轴心, 包含关于个人的信息。 00:08:34.740 EN: So what type these individuals are and also what, how are they related? Yeah, so then he introduced ALC as one of the most simple language here in description logics. 中文初译: 那么,这些人是哪种类型,又是什么,他们与什么关系?是的,然后他将ALC作为这里描述逻辑中最简单的语言之一。 00:08:52.360 EN: And yeah, so there are basic things like named concepts, so atomic concepts, then you have the concept of all individuals, that's the T here. 中文初译: 是的,所以有一些基本的东西 比如命名的概念, 原子的概念, 然后你有所有个人的概念, 这就是T。 00:09:07.180 EN: I actually know the name for that, but it's, do I have some annotate or, yeah, so I don't know if you see my browser here, my cursor here, maybe I can, oops. 中文初译: 我其实知道这个名字,但是,这是,我是不是有一些注解 或者,是的,所以我不知道你是否看到 我的浏览器在这里,我的光标在这里,也许我可以,ops。 00:09:27.170 EN: So this thing here is the concept that contains all individuals. And this thing here is the concept that contains no individuals as instance, so it's an empty concept. If C and D are concept and R is a role, then the following are also concepts, so the negation of a concept and remember that C can be an atomic concept or a complex concept. 中文初译: 因此,这里的这个概念包含所有个人。这里的这个概念不包含任何个人, 所以它是一个空洞的概念。如果C和D是概念,R是一个角色, 那么下面也是概念, 否定一个概念, 记住C可以是一个原子概念或者一个复杂的概念。 00:09:57.990 EN: So the negation of a concept is a concept or complement also. The intersection or conjunction of two concept is another concept, is also a concept. 中文初译: 因此,否定一个概念也是一个概念或补充。 两个概念的交叉或结合是另一个概念,也是一个概念。 00:10:10.530 EN: The union of two concepts, either again, atomic or complex is also a concept. And then you have these more tricky things the existential restrictions and the value restriction or the universal restrictions is also called. 中文初译: 两个概念的结合,无论是原子还是复杂的概念,都是一个概念。 然后你有了这些更棘手的东西: 生存限制和价值限制或者普遍限制也被称为。 00:10:32.050 EN: These are essentially stating, these are concepts of containing all individuals that have a relation R with an instance that is a class of the concept C. 中文初译: 这些基本说明是,这些概念包含所有与C概念一类的例子有R关系的个人。 00:10:46.630 EN: And again, the concept C can be a complex concept or an atomic concept. This thing, good. Then there are some examples, I think this is then quite understandable. 中文初译: 同样,C概念也可以是一个复杂的概念或原子概念。这个东西很好。然后有一些例子,我想这样可以理解。 00:11:05.690 EN: So persons with children, these are is a complex concept here of all people, persons that also have a child and you can basically understand quite easily the rest. 中文初译: 因此,有孩子的人, 这些都是一个复杂的概念 这里的所有人, 也有一个孩子的人, 你基本上可以很容易地理解其余的。 00:11:21.230 EN: So professor or students, that's a union. And these essentially are examples that use the constructs that we just introduced. 中文初译: 所以教授或学生,这是一个联盟。这些基本上是例子 使用我们刚刚介绍的构思。 00:11:31.410 EN: So the T-box is then the part of a knowledge base that includes the schema knowledge, so to say, and is formed of axioms. 中文初译: 所以T框就是知识库的一部分, 包括了化学学知识, 也就是说, 并且是由正弦组成的。 00:11:44.770 EN: These are called general concept inclusion axioms. So in this form, so C is a sub-concept of D. And again, they can be complex concepts as we will see some example. 中文初译: 这些被称为广义的概念包容轴。因此,以这种形式,C是D的子概念。同样,它们也可以是复杂的概念,因为我们可以看到一些例子。 00:12:02.410 EN: And then it's useful to remember that the equality between these two concepts C and D can also is essentially an abbreviation of these two axioms that C is a sub-concept of D and D is a sub-concept of C. 中文初译: 然后,记住这两个概念C和D之间的平等 基本上也可以是这两个轴的缩略语, C是D的子概念, D是C的子概念。 00:12:17.850 EN: So these are equivalent in semantics. So instead of whenever you have an equivalence between two concepts, you can also rewrite them as being sub-concept in this form. 中文初译: 所以这些在语义学上是等同的。因此,如果你没有在两种概念之间找到等同之处,你也可以把它们改写为这种形式的子概念。 00:12:32.930 EN: So this means is essentially that all individuals of the class C are also individuals of the class D, but at the same time that all individuals of the class D are also individuals of the class C. 中文初译: 这意味着C类的所有个人也是D类的个人, 同时D类的所有个人也是C类的个人。 00:12:50.190 EN: And therefore you end up having an equivalence between these two classes. So all individuals of C are also individuals of D and vice versa. 中文初译: 因此,你最终在这两个班级之间取得了等同。所以所有C级的人也是D级的人,反之亦然。 00:13:01.540 EN: And then we have the A-box. The A-box are assertions and here we have individuals and we state things we know about individuals. 中文初译: 然后我们有了A框。A盒是断言, 我们在这里有个人, 并陈述我们所知道的关于个人的事物。 00:13:10.240 EN: So A is an individual, so that's a concrete entity like a concrete person or a concrete car, a concrete tree. That is in your yard or the house that you're living in or the thermometer attached to the wall in your house. 中文初译: 所以A是一个个体,所以这是一个混凝土实体 就像一个混凝土的人或水泥汽车, 水泥树。那是在你家院子里,或者你住的房子里, 或者你房子里的墙上的温度计。 00:13:28.600 EN: These are concrete entities and these are then individuals, they're not concepts but they are instances of some concept. 中文初译: 这些是具体实体,然后是个人,它们不是概念,但只是某种概念的例子。 00:13:35.200 EN: So your house is of course an instance of a house, maybe a detached house or a row house or maybe it's an apartment in a building. 中文初译: 所以,你的房子当然是一个例子 房子,也许一个独立的房子 或一排房 或者它可能是一个公寓 在大楼里。 00:13:46.800 EN: A tree has a certain type, there are whole taxonomies of trees, a pine for instance, is a kind of tree. And then you have roles, so role assertions. 中文初译: 树有某种类型,树有各种分类,例如松树,是一种树。然后你有角色,所以角色的主张。 00:14:00.660 EN: So these are property assertions between two individuals. So stating that between the individual A and the individual B, there is a role R. 中文初译: 这就是两个个人之间的财产主张。也就是说,在个人A与个人B之间,有一个角色R。 00:14:11.280 EN: Good, it's now to semantics. This essentially boils down to having a domain. So these are all the individuals and sets of individuals representing classes, concepts and also roles. 中文初译: 这基本上归结为拥有一个域。所以这些都是个人和一系列个人, 代表阶级、概念和角色。 00:14:30.480 EN: And then an interpretation is essentially a mapping between the domain of all individuals and the concepts. So the concrete individual in the domain. So you have a statement that every individual A is a domain element of this domain. 中文初译: 然后,一个解释 基本上是在个人领域和概念之间的映射。因此这个领域的具体个体。所以你有一个声明, 每个个体 A 是这个领域的域元素。 00:14:53.360 EN: And then every concept name is a subset of domain elements. So this should be clear, but essentially a domain, a concept name is a set of individuals. 中文初译: 然后每一个概念名称都是一个域名元素的子集。所以这应该是明确的,但本质上是一个域, 概念名称是一组个人。 00:15:05.400 EN: So basically all individuals that are elements or members of this concept. And therefore it's a subset of the domain because the domain includes all the individuals that you're talking about. 中文初译: 所以基本上所有的个人 都属于这个概念的元素或成员。 因此,它是这个域的一个子集, 因为这个域包括了 你所说的所有个人。 00:15:24.200 EN: So a concept name is always a subset of this domain containing all the individuals that are elements of this concept. 中文初译: 因此,概念名称总是这个领域的子集, 包含所有属于这一概念要素的个人。 00:15:35.700 EN: And the same about roles is essentially, again, a set where you have the cross product between the domain and itself. 中文初译: 角色的相同之处 基本上,同样,是一组 在域与域之间有交叉产品的地方。 00:15:45.140 EN: So these are all the individuals of the domain can be linked via role to all the individuals of the same domain. 中文初译: 因此,这些都是域内的所有个人都可以通过角色与同一域内的所有个人联系起来。 00:15:57.000 EN: And therefore you have pairs here of individuals that are related by a role R. Yeah, so you can extend this to complex concepts. 中文初译: 因此,你在这里有两对 与角色R有关的人。 是的,所以你可以把它推广到复杂的概念中。 00:16:12.320 EN: This is perhaps also clear, except maybe these last ones that are a little bit more cryptic. So this means that there is an individual of the domain, X, so that there exists another individual Y that is of type C, so that between the individuals X and Y, there is a relationship R. 中文初译: 这或许也是显而易见的,除了最后那些更隐秘一点的。 因此这意味着这个域里有一个个人,X, 所以还有一个属于C类的个人Y, 所以在X和Y之间, 有一个关系R。 00:16:42.880 EN: So that's what this means. And this one is there is an individual X of the domain so that for all relationships between X and Y, so all relationships between X and Y are of type R. 中文初译: 所以这就是这个意思。 这个是域中有一个单个的X, 这样对于X和Y之间的所有关系, 所以X和Y之间的关系都是R型的。 00:17:07.160 EN: So all relationships between R, relationships between X and Y entail that Y is of type C. Hopefully this was correct and clear. 中文初译: 所以所有R的关系,X和Y之间的关系 都意味着Y是C型的。希望这是正确而明确的。 00:17:24.380 EN: Good. Then, yes, this is also pretty clear, I think, and easier to understand, and then we can skip this. This is an example, more complete example where you have a T-box with axioms. 中文初译: 很好。那么,是的,我认为,这也相当清楚,而且更容易理解, 然后我们可以跳过这个例子。这是一个更完整的示例, 一个例子, 就是你有一个带有轴心的Tbox。 00:17:44.220 EN: So a man is equivalent, an equivalent class to this complex class. So it entails all the individuals that are not women and people. 中文初译: 因此,一个男人是等同的, 和这个复杂的阶级一样的阶级。所以它涉及到所有不是女人和人的人。 00:17:59.240 EN: All women are subclasses of, is a subconcept of person, and all models are equivalent class to women that have at least one child. 中文初译: 所有妇女都是子阶级,是个人的一个子概念,所有模式都与至少有一个子女的妇女等同。 00:18:12.240 EN: And then you have an A-box here which has some instance, some assertions, so concrete people now. Stefan is a man, Monica is not a man. 中文初译: 然后,你有一个A框 在这里有一些例子, 一些说法, 所以具体的人现在。Stefan是个男人, Monica不是男人。 00:18:24.400 EN: Note that there is no concept not a man, but you can infer it from here. So if you negate this concept man, you would also negate this complex concept here, meaning that it becomes a woman or not a person. 中文初译: 请注意,没有概念不是男人,但你可以从这里推断出来。因此,如果你否定这个概念,你也会否定这个复杂的概念,也就是说,它变成一个女人或不是一个人。 00:18:48.170 EN: Good, and the rest, I think, is pretty clear. This is also just a mapping of these operators to OWL. I think this is also pretty clear. 中文初译: 我认为其他的都很清楚。这也只是这些操作员对“OWL”的映射而已。我想这也相当清楚。 00:19:00.830 EN: And then you have a number of additional features for roles. So there are inverse roles. So you have a role and potentially also its inverse role. 中文初译: 然后,你对角色还有其他一些特性。因此,有一些反作用。所以你有一个作用, 也可能是它的反作用。 00:19:12.130 EN: And I think this is also quite clear. You have role hierarchies. So you can, in addition to creating hierarchies of concepts, you can also create hierarchies of roles. 中文初译: 我认为这也非常清楚。你有角色等级制。所以除了建立概念等级制之外,你还可以建立角色等级制。 00:19:26.130 EN: Role transitivity also is a feature of this language and the role functionality. These I think are pretty clear. 中文初译: 角色过渡性也是这种语言和角色功能的一个特点。我认为这些相当清楚。 00:19:36.950 EN: I think cause of this is fairly obvious. So let me skip a little bit ahead in the interest of time also. Yeah, these are cardinalities. 中文初译: 我认为原因相当明显。因此,为了时间的利益,我先跳一下。是的,这些是最重要的。 00:19:50.110 EN: So I think also this is perhaps quite clear. Nominals are classes of individuals. I think also this is fairly clear. 中文初译: 因此,我也认为这或许相当清楚。名词是个人分类的。我认为这也相当清楚。 00:20:02.150 EN: And then you talked about logical reasoning, the various types of reasoning. Here in description logics, we do the first deductive reasoning. 中文初译: 然后你又谈到逻辑推理, 各种推理。在这里描述逻辑, 我们做第一个推理推理。 00:20:13.650 EN: So you start with assertions. And you infer implicit knowledge. And inductive reasoning and abductive reasoning are other types of reasoning. 中文初译: 所以,你从断言开始。你推断暗含知识。 感性推理和绑架性推理是其它类型的推理。 00:20:28.050 EN: And I think machine learning are good examples of inductive reasoning. So you start from example observations and you learn a general rule. 中文初译: 我认为机器学习是感性推理的好例子。所以你从举例观察开始, 学习一条通则。 00:20:40.940 EN: Good. Then you had some logical reasoning and description logics. And here we start with the interpretation. So you have an interpretation, a T-box, and an A-box that together give a knowledge base. 中文初译: 很好,然后你有一些逻辑推理和描述逻辑。我们从解释开始。所以你有一个解释,一个T框和一个A盒,共同提供知识基础。 00:21:00.260 EN: And the interpretation is a model for the T-box if the interpretation entails every axiom of the T-box. The same thing for the A-box. 中文初译: 解释是T框的模型,如果解释包含 T框的每一个正弦。A盒也是如此。 00:21:15.020 EN: The interpretation is a model for the A-box if the interpretation entails. So this is, or this sign means entails or holds for every axiom in the A-box. 中文初译: 解释是A-box的模型, 如果解释需要的话。 所以这是, 或者这个符号意味着 A- box 中每个轴都包含或保持 。 00:21:31.940 EN: And the interpretation is a model for the knowledge base. And this is then pretty obvious if the interpretation entails the T-box, meaning that every axiom, that interpretation entails every axiom. 中文初译: 解释是知识基础的模型。如果解释包含T-box,那么这一点就很明显了, 这意味着每个轴,这种解释包含每一个轴。 00:21:47.500 EN: And also the interpretation entails the A-box, meaning that the interpretation entails every axiom of the A-box. 中文初译: 解释还包含A框, 意思是解释包含A盒的每一项原义。 00:22:01.380 EN: Good. This is also, I think, fairly obvious. Then you talked about various reasoning services. So we can test the satisfiability of a concept, so whether a concept is satisfiable in a knowledge base. 中文初译: 很好,我认为这也相当明显。然后你谈到了各种推理服务。这样我们可以测试一个概念的相对性, 从而判断一个概念是否在知识库中具有相对性。 00:22:23.040 EN: And then subsumption, don't get confused here about the font size here. These are not somehow, subsumption is not a sub-service of concept satisfiability. 中文初译: 然后进行子假设, 不要在这里混淆字体大小。 这些不是某种意义上的, 子假设不是概念可控性的子服务 。 00:22:35.820 EN: These are all reasoning services in their own right. So you have concept satisfiability of subsumption as another reasoning service. 中文初译: 这些都是推理服务本身就属于它们。所以你有子假设作为另一种推理服务的概念相对性。 00:22:47.140 EN: This is checking whether a concept C is subsumed by another concept D. Satisfiability is the service that checks whether a whole knowledge base is consistent. 中文初译: 这是检查C概念是否包含在另一个D概念中。 满足性是检验整个知识库是否一致的服务。 00:23:06.020 EN: Then again here, the font issue, we have instance checking. You can also check whether a particular individual is an instance of a class. 中文初译: 在此再次, 字体问题, 我们有实例检查。 您也可以检查某个个人是否属于一个类的例子 。 00:23:17.780 EN: So whether this assertion is satisfied with respect to the knowledge base. Retrieval is more about querying. So you can also check and find all the individuals A in this case that belong to a certain concept with respect again to the knowledge base. 中文初译: 所以对于知识库来说,这个说法是否令人满意。 检索更多的是查询。 这样您也可以检查并找到所有 A 个人, A 属于与知识库有关的某个概念。 00:23:38.240 EN: And realization is essentially finding all classes of a particular individual with respect to the knowledge base. 中文初译: 实现基本上就是在知识基础方面找到一个特定个人的所有类别。 00:23:51.100 EN: So these are various reasoning services and these are of course the services that essentially a reasoner would implement or can implement. 中文初译: 因此,这些是各种推理服务,当然,这些服务基本上是一个理性者将执行或能够执行的服务。 00:24:01.820 EN: Not all reasoners I think implement all services but these are services that reasoners would then try to implement. 中文初译: 我认为并非所有的理性者都提供所有服务,但这些是理性者然后会试图执行的服务。 00:24:13.120 EN: And essentially the nice thing is that you can boil down all these reasoning services to concept satisfiability by essentially rewriting the problem as suggested here for subsumption. 中文初译: 基本上,好的一件事是 你可以把所有这些推理服务 归结为概念可控性 通过基本上重写问题 00:24:30.640 EN: So if you want to test the subsumption whether concept C is subsumed by the concept D, you can simply rewrite this subsumption axiom into this complex concept which has the same semantics and then test the satisfiability of these concepts to see whether the class C is subsumed by the class D. 中文初译: 所以,如果你想测试子假设概念C是否包含在D的概念中, 你可以简单地将这个子吸附轴重写为复杂的概念, 这个概念具有相同的语义学, 然后检验这些概念的相对性, 以确定C类是否包含在D类中。 00:24:58.820 EN: And the same for instance checking, you can test whether the negation of the instance check as shown here and test whether the resulting knowledge base, so this is the knowledge base union, this the negation of the assertion that A is an instance of the class C. 中文初译: 同样的例子检查, 您可以测试是否否定此处显示的例检查, 并测试由此得出的知识基础, 所以这就是知识基础结合, 这是否定A是C级实例的说法。 00:25:24.360 EN: And then you test whether this knowledge base is as a result of this union is unsatisfiable and if that's true then you can infer that or you know that the instance, that the individual A is an instance of class C with respect to this knowledge base. 中文初译: 然后你测试这个知识库是否是 这个联盟的结果 如果这是事实 你可以推断,或者你知道这个例子, 个体A是C级的例子 相对于这个知识库来说。 00:25:49.440 EN: So that's a nice property of this all because it simplifies implementation if you can reduce these services to basically concept satisfiability. 中文初译: 所以这是所有这一切的一个好属性 因为它简化了执行 如果你能将这些服务 降低到基本的概念可控性 00:26:03.020 EN: So that was a quick review of the material from last week. So now I would move to the new material and I think I don't see anything in the chat so unless there are any questions I would then move to the tableau algorithm. 中文初译: 所以,这是对上个星期的材料的快速回顾。现在我想转到新的材料上, 我想我在聊天中看不到任何东西, 除非有任何问题, 否则我会转到排列法算法上。 00:26:28.060 EN: And the tableau algorithm is essentially a procedure, an algorithmic procedure to test the satisfiability of a concept. 中文初译: 而排列法算法基本上是一种程序,一种算法程序 来测试一个概念的可比较性。 00:26:37.580 EN: So that's an approach how you implement reasoning and these reasoning services for RDL in software. And that's of course very useful because ultimately you don't want to do this manually. 中文初译: 所以这就是一种方法, 你如何在软件中为 RDL 执行推理和这些推理服务。 这当然非常有用, 因为最终你不想手工操作。 00:26:55.580 EN: I don't want to check in applications, you don't want to check this manually, this will never scale. So we develop software or the community developed software to do this in an automated manner. 中文初译: 我不想检查应用程序,你不想人工检查这个,这永远不会扩大规模。所以我们开发软件或社区开发的软件 来自动进行。 00:27:08.620 EN: And this is where the tableau algorithm comes into the picture. So essentially the tableau algorithm consists of three steps. 中文初译: 这就是排列式算法进入图片的地方。所以基本上,排列式算法由三个步骤组成。 00:27:20.980 EN: The one, the first step is to transform any given concept into this called negation normal form, the NNF. And we will see what that means. 中文初译: 第一,第一步是将任何特定的概念 变成一个叫作否定的正常形式 NNF。我们会明白这意味着什么。 00:27:31.940 EN: So that's the first step. So we essentially check, well, the very first step I guess is to check whether an expression is valid. 中文初译: 所以这是第一步。所以我们基本上检查, 嗯,我猜第一步是检查表达式是否有效。 00:27:40.780 EN: So the knowledge base is syntactically valid but that's assumed here. So the second step or the first step here is essentially to check whether all the concepts including concepts, complex concepts of course are in so-called negation normal form. 中文初译: 因此,知识基础在实践上是有效的,但这里假设了这一点。因此,第二步或第一步基本上是要检查所有概念,包括概念、复杂概念是否都以所谓的否定的正常形式存在。 00:27:58.420 EN: If that's the case, we move to the next step. If that's not the case, we can transform any concept that is not in negation normal form into negation normal form. 中文初译: 如果是这样的话,我们就进入下一步。如果不是这样,我们可以把任何非否定正常形式的概念变成否定正常形式。 00:28:12.400 EN: And that's done for the whole knowledge base. We move to the second step here. These are the application of competition rules. 中文初译: 整个知识库都是如此。我们进入了第二步,这就是竞争规则的应用。 00:28:24.820 EN: And we will see what those are. And we can apply essentially these competition rules to the axioms in the knowledge base in arbitrary order as long as possible. 中文初译: 我们将看到这些是什么。我们基本上可以把这些竞争规则 运用到知识库的轴心上, 尽可能长地任意排列。 00:28:39.480 EN: And we will see what that concretely means at the few examples. And this is then the sort of essential last step if the concept is satisfiable. 中文初译: 我们将在几个例子中看到这具体意味着什么。如果这个概念是可争辩的,那么这就是关键的最后一步。 00:28:53.540 EN: And we will see what that means for a knowledge base. Test essentially all axioms in a knowledge base. We can start with one concept test. 中文初译: 我们将会看到这对知识库意味着什么。 在一个知识库中测试所有轴心。 我们可以从一个概念测试开始。 00:29:05.740 EN: And if the concept is satisfiable, if and only if you can create a so-called clash-free tableau, meaning that there is no competition rule that can be any more applied. 中文初译: 如果这个概念是可嘲讽的, 如果你能创建一个所谓的无冲突桌, 意味着没有竞争规则可以进一步应用。 00:29:23.720 EN: And there is no clash. And we will see what the clash concretely means then. So these are the three steps. So keep this in mind. 中文初译: 没有冲突,我们将观察冲突的具体含义。这三步就是这三步。你要记住这一点。 00:29:34.920 EN: Transform first in negation normal form. Then apply these completion rules to the knowledge base that you want to test for, for instance, satisfiability. 中文初译: 先是否定正常形式的变换。 然后将这些完成规则应用到您想要测试的知识库中, 比如, 是否可作对 。 00:29:52.880 EN: Or consistency. And then if you can, essentially, you have clash-free tableau, it means that the test that you check you're doing is satisfiable. 中文初译: 或一致性。然后,如果你可以,基本上, 你有无冲突桌, 这意味着,你检查的测试 你正在做的是可鄙的。 00:30:15.460 EN: And if you cannot create a clash-free tableau, then the satisfiability check fails. Okay. Then we have this example. It's the same T-box and A-box as before. 中文初译: 如果您无法创建无冲突桌框, 那么对可设防性检查就会失败。 好的。 然后我们有了这个例子。 和以前一样的 T-box 和 A-box 。 00:30:32.420 EN: So we have men and women and mothers and also instances. And then in addition here, if you have now a concrete interpretation for these concepts and roles. 中文初译: 因此,我们有男人、女人和母亲,还有例子。此外,这里,如果你现在对这些概念和作用有具体的解释的话。 00:30:44.360 EN: So again, interpretations are essentially a set of individuals and pairs in the case of roles. The interpretation of the concept man is a set of individuals that are instances of men. So in this case, Stefan. 中文初译: 同样,解释基本上就是角色的一组个人和对等。 概念人的诠释是一系列男人的事例。在这种情况下,Stefan。 00:30:59.720 EN: The interpretation of the concept woman is the set of individuals that are indeed women. And in this case, that's Jessica and Monica. 中文初译: 女性概念的诠释是一群真正是妇女的个人。在这种情况下,就是Jessica和Monica。 00:31:10.360 EN: I remember that Monica is an instance of not man. And this is equivalent to the class woman or not person. And then you have people. So people are both either men or women here. 中文初译: 我记得莫妮卡不是男人的一个例子。这相当于阶级女性或非人。然后,你有了人。所以这里的人既是男人也是女人。 00:31:30.360 EN: And then has child. You can see here that the set of has child, this is a role, is of course pairs of individuals. So this is a set of pairs here. 中文初译: 然后有了孩子。在这里,你可以看到 一组有孩子,这是一个角色, 当然是一对个体。所以这是一组一对。 00:31:44.100 EN: And of course, the pairs of individuals that have a role has child between them. So Monica has child, Stefan and Stefan has child, Jessica. 中文初译: 当然,有角色的两对个人之间有孩子。所以莫妮卡有孩子,斯特凡和斯特凡有孩子,杰西卡。 00:32:00.560 EN: And you can look at this and you can see that the interpretation here holds for the T-box and the A-box. And so this interpretation is a valid model for this knowledge base. 中文初译: 你可以看这个,你可以看到这里的判读 支持T-box和A-box。所以这种判读是 这个知识库的一个有效的模型。 00:32:23.080 EN: So next we have the first step of the tableau algorithm. So we said that this is the ensuring that all concepts are in negation normal form. 中文初译: 接下来我们有了排列算法的第一步。 所以我们说,这是确保所有概念都以否定的正常形式出现。 00:32:37.730 EN: And what this means is essentially ensure that all occurrences of negation, so whenever there's a negation in front of a concept, could be a complex concept, are in front of atomic concepts. 中文初译: 这意味着基本上确保了所有否定的发生, 所以当一个概念面前出现否定时, 可能是一个复杂的概念, 在原子概念面前。 00:32:53.190 EN: So what you do is essentially shift negations down into the atomic concepts in complex concepts. And there are a number of rules, and I think these are quite simple, that you can follow. So the negation normal form of a concept of, in this case, an atomic concept is the concept itself. 中文初译: 所以,你所做的基本上就是把否定转变为复杂的概念中的原子概念。有一些规则,我认为这些是很简单的,你可以遵循。因此,在目前情况下,一个原子概念概念的正常形式就是这个概念本身。 00:33:21.650 EN: If C is atomic, the negation normal form of the negation or the complement of a concept is the complement of the concept if the concept is atomic. 中文初译: 如果C是原子,否定的正常形式或对概念的补充就是对概念的补充,如果这个概念是原子。 00:33:34.190 EN: And this is important here because you can see in the next ones that this is not assumed anymore, so this can also be a complex concept. 中文初译: 这一点在这里很重要,因为你可以看到在接下来的几句话中, 我们不再假设这一点了, 所以这也可以是一个复杂的概念。 00:33:44.410 EN: So if you have the negation normal form of a double negation of a concept, and here it could be a concept that is complex or an atomic concept, this double negation, of course, just goes away, you can cancel it, and this is the negation normal form of the concept. 中文初译: 所以,如果你有否定一个概念的正常形式, 双重否定一个概念, 而它可能是一个复杂或原子概念的概念, 当然,这种双重否定可以取消, 这是这个概念的通常否定形式。 00:34:05.690 EN: And if this is an atomic concept, then it will be the concept itself. The intersection, you simply split this, so you do the negation normal form of the concept C or the negation normal form of the concept D, and then you apply the negation normal form to C and the negation normal form to D iteratively. 中文初译: 如果这是一个原子概念, 那么它就是这个概念本身。 交叉点, 你简单地将它分割开来, 所以做一个否定C概念的正常形式 或者否定D概念的正常形式, 然后对C应用否定正常的形式, 对D反复地使用否定正常的形式。 00:34:35.250 EN: And this could be an atomic concept, in this case it's just C or D, if both are atomic, or otherwise you apply again the rules iteratively to C and to D. 中文初译: 这可能是一个原子概念, 在这种情况下,它只是C或D, 如果两者都是原子, 或者你再次对C和D反复适用规则。 00:34:49.350 EN: The same thing for the intersection, so you essentially split this and you do the negation normal form to C and the negation normal form to D, same thing, atomic or complex needs to be considered. 中文初译: 同样的东西对十字路口, 所以你基本上分割了这个, 你做否定的正常形式到C 和否定的正常形式到D, 同样的事情,原子或复杂体需要考虑。 00:35:05.970 EN: This is perhaps a little bit more interesting here, so we have now a negation in front of a concept, and what we need to do, the negation normal form of this complex concept that is negated, what we do is move this negation essentially inside the concept, so this negation normal form, we negate its elements, 中文初译: 这也许更有趣一些,所以我们现在面对一个概念有了一个否定,我们需要做的是,否定这个被否定的复杂概念的正常形式,我们所做的是将这种否定基本上纳入这一概念之中,所以这种否定的正常形式,我们否定其要素, 00:35:36.970 EN: its components, so it's the negation normal form of C, and then you have to switch from OR to AND or from AND to OR when you move the negation inside the complex concept, but then you negate the components of the concept concept. 中文初译: 它的成分,所以它是否定的正常的 C形式, 然后你必须转换 从 or 到 和 或 从 和 到 或 当你移动 否定 在复杂的概念内, 00:36:00.130 EN: The same thing for the negation of an intersection of two concepts, and again this can be complex or atomic, and therefore you have to apply the rules accordingly. 中文初译: 否定两个概念交叉的同样做法,这也可能是复杂的或原子的,因此你必须相应地适用规则。 00:36:14.660 EN: This is also pretty trivial, I think, what we do with universal and existential restrictions. More interesting is when you have negation again, you move the negation again into the concept, here the filler, the so-called filler of the role, and you also switch the existential restriction, the universal restriction to an existential restriction 中文初译: 我认为,这也是相当无关紧要的事情。 我认为,我们对于普遍性和存在限制所做的也是相当微不足道的。 更有趣的是,当你再次否定时,你又把否定性再移入这个概念中,这里就是填补者,所谓的角色填充者,你还改变了存在限制, 普遍限制到存在限制 00:36:45.280 EN: when you move the negation into the concept, and the same thing for existential restrictions. So you move the negation into the concept C, but at the same time you have to also translate the existential relation, this existential restriction to a universal restriction. 中文初译: 当您将否定变为概念时, 以及对于存在限制的相同内容。 所以您将否定变为 C 的概念, 但与此同时, 您也必须将存在关系, 这种存在限制 转化为一个普遍的限制。 00:37:08.600 EN: So these are fairly simple rules, and you can simply apply them in algorithmically very easily to all the concepts that you have in your knowledge base. 中文初译: 因此,这些规则很简单, 你可以简单地用逻辑来 很容易地运用于 你的知识库中的所有概念。 00:37:23.280 EN: And with this, I hope that it's clear that eventually you will get to have only concepts in the negation normal form, and this is essentially then the competition of the first step in the tableau algorithm. 中文初译: 有了这个,我希望它很明显,最终你将 得到只有概念 在否定的正常形式中, 而这实质上就是 与排列算法第一步的竞争。 00:37:40.840 EN: So here is an example, transform the concept. We have here a complex concept with a bunch of negations, and we can simply do this algorithmically by applying these rules that we just saw. 中文初译: 举例来说,改变这个概念。我们这里有一个复杂的概念 带有一系列否定, 我们可以通过应用我们刚刚看到的这些规则来进行这种逻辑学的操作。 00:37:54.060 EN: So we do the negation normal form of the whole thing, meaning that we start in the next step moving this negation into the components or elements of the concept, complex concept, so basically into the parentheses. 中文初译: 所以,我们做否定整个事情的正常形式, 意思是,我们从下一步开始将这种否定变成概念的组成部分或要素, 复杂的概念, 基本上进入括号。 00:38:09.700 EN: So we have here a double negation as a first step, and then remember that when we do this, we have to translate in this case the intersection into a union, and also here we move this – I hope you can see my cursor here – this negation also, of course, to the second part of the concept concept, so the second, let's say the right-hand side of the concept, 中文初译: 因此,我们在这里有一个双重否定作为第一步, 然后记住,当我们这样做的时候, 我们必须把交叉点转换成一个联盟, 并且在这里我们移动这个--我希望你可以看到我的指针在这里—— 当然,这种否定也到了概念概念的第二部分, 所以第二个,让我们说这个概念的右侧, 00:38:43.920 EN: and this becomes a double negation. So then we go iteratively apply these rules further. This essentially eliminates this double negation, is eliminated in the next step, as well as this double negation is eliminated as a result – oops, we get this new negation normal form. 中文初译: 这变成了一种双重否定。 因此,我们反复地进一步运用这些规则。 这从根本上消除了这种双重否定,在接下来的一步中被消除,而这种双重否定也因此被消除 — — 哦,我们得到了新的否定形式。 00:39:09.680 EN: Well, not yet, but it's the next step. And then this one disappears because this is an atomic concept, so the negation normal form of an atomic concept is the concept itself, and this one we still have a complex concept, so we apply the negation normal form to the left-hand side and the right-hand side. 中文初译: 还没有,但它是下一步。然后这个东西就消失了, 因为它是一个原子概念, 所以否定一个原子概念的正常形式就是这个概念本身, 这个我们还有一个复杂的概念, 所以我们把否定的正常形式应用到左手和右手一边。 00:39:34.320 EN: There is no negation here that is moved into the complex concept as we had here, so nothing really happens with the union here. 中文初译: 这里没有否定的观念 和我们一样被引入到复杂的概念中, 所以这里的工会不会真的发生什么事情。 00:39:51.180 EN: C is already finished, and as a last step here, these are now atomic concept A and not B, and they are both atomic concepts, so we can simply translate the negation normal form is the atomic concept themselves. 中文初译: C已经完成,作为这里的最后一步,现在这些是原子概念A而不是B,它们都是原子概念,因此我们可以简单地将否定的正常形式变为原子概念本身。 00:40:07.500 EN: So you end up having this expression here, this complex concept is in negation normal form, is translated to this form, and that's relatively, I think, easy and also easy to see how you can implement this in an algorithmic procedure. 中文初译: 所以最后你在这里有了这个表达方式, 这个复杂的概念是否定的, 通常的形式,被翻译成这种形式。 我认为,这是相对容易的, 也很容易看到 你如何在算法程序中执行它。 00:40:31.100 EN: Good. Then the next step after negation normal form, so you have your knowledge base and all concepts in negation normal form now, and then you apply the actual tableau algorithm, so the core part, let's say, and where you prove that this knowledge base is satisfiable or a concept is satisfiable. 中文初译: 很好。然后在否定正常形式之后的下一步, 所以你现在有了自己的知识基础和所有概念 以否定正常的形式, 然后你应用了实际的排列算法, 所以核心部分,让我们说, 并且在哪里你证明这个知识基础是可鄙的或者一个概念是可鄙的。 00:41:01.980 EN: Well, basically all reasoning services that we saw. And for this, you have a construct that is a graph, a labeled-oriented graph, consisting of a set of nodes, the vertices, and these vertices in the graph, they are labeled with this LX of concepts. 中文初译: 基本上,我们所看到的所有推理服务。为此,你有一个图解,一个标签导向的图表, 由一组节点、顶点和图中的这些顶点组成, 它们被标为这个概念的LX。 00:41:28.640 EN: This is a set of concepts that are the label of the node X, in the set of vertices of this graph. Then you have, in addition, also a set E of edges. 中文初译: 这是一组概念, 是本图的顶点组中 结点 X 的标签。 然后您还会加上一组 E 边缘 。 00:41:50.900 EN: Of course, the graph, labeled-oriented graph, has always nodes and directed edges here, and these are, as you can imagine, pairs between nodes, and these are nodes in the graph, so don't confuse this with individuals in any way here. 中文初译: 当然,图中标注方向的图, 总是有节点和定向边缘, 正如你想象的那样, 这些是节点之间的对, 这些是图表中的节点, 所以不要把这个与这里的个人混淆了。 00:42:09.900 EN: These are now nodes in a graph. And yes, also these edges, they are labeled with a set L and the pair XY, so the edge connecting the vertex X to the vertex Y of roles. 中文初译: 这些是图表中的节点。 是的, 也是这些边缘, 它们被标为一个设置的 L 和 XY 配对, 所以将顶点 X 连接到角色的顶点 Y 的边缘 。 00:42:38.210 EN: I perhaps have then an example where they can draw how this looks like. So a completion graph, G, now contains a clash. 中文初译: 我也许可以举个例子,让他们能画出这个样子。因此,完成图G现在含有冲突。 00:42:48.030 EN: Remember, when you have a clash, then you can sort of remove this path in the graph. We will see this, how this works. 中文初译: 记住,当您发生冲突时, 您可以在图形中移除这条路径。 我们会看到这个, 这个是如何运作的 。 00:43:03.550 EN: If the label of a particular vertex, the vertex here in the graph, has a set of concepts that include a concept and its negation, so an atomic concept A and the negation of the atomic concept A. 中文初译: 如果一个特定顶点的标签,即图中的顶点,有一套概念,其中包括一个概念及其否定性,也就是原子概念A和对原子概念A的否定。 00:43:26.650 EN: In this case, if you have any L, any set of concepts that are sort of the labels of a vertex of a node in this graph, then you have a clash. 中文初译: 在此情况下, 如果您有任何 L, 任何一套概念, 都类似于此图中节点顶点的标签, 那么您就会发生冲突 。 00:43:45.050 EN: Remember this. Or if you end up having the empty concept or the negation of the concept that includes all individuals, which is the same thing. In this case, you have a clash. 中文初译: 记住这一点。 或者,如果你最终有了空洞的概念或者否定包含所有个人的概念,这是同样的事情。在这种情况下,你有一个冲突。 00:44:01.370 EN: And remember that this needs to be atomic. There cannot be a complex concept here because, of course, if you have still a concept, if A would be a complex concept, then you can apply the completion rules still further and you're not done in developing your tableau. 中文初译: 记住这需要原子。这里不可能有一个复杂的概念, 因为,当然,如果你还有一个概念, 如果A会是一个复杂的概念, 那么你就可以进一步适用完成规则, 而您在开发你的桌面时还没有完成。 00:44:23.510 EN: So this clash can only be between atomic concepts. And it's complete. So this graph is complete if no completion rule can be applied on it. 中文初译: 所以这种冲突只能发生在原子概念之间, 并且它是完整的。 因此如果无法对它应用完成规则, 这个图表是完整的 。 00:44:37.120 EN: So if there is at least one, let's say, branch through the graph from the top to the bottom, then there is no more completion rule that you can apply to the concept in the leaf node. 中文初译: 所以,如果至少有一个,比如说,从上到下通过图形的分支, 那么没有更多的完成规则可以适用于叶节点中的概念。 00:44:56.700 EN: Then you are essentially done. And you have found a model that is an interpretation of this knowledge base. So you have tested the satisfiability of your knowledge base or a concept in the knowledge base. 中文初译: 然后,你基本上完成了。你找到了一个模型 来解释这个知识库。所以你测试了 你的知识库的可比较性 或者知识库中的概念。 00:45:21.220 EN: So let me briefly show you how this looks like when you draw it. So what we said is that you have vertices. So you have a graph, right? The graph has nodes. 中文初译: 让我简要地向你们展示一下画的时候这个样子。我们说的是,你有顶峰。所以你有一个图表,对吗?图表有节点。 00:45:36.300 EN: And these nodes have a name. Oops. Okay. So I label these nodes X. My computer is very slow here. This works. And then you have each node has this label that is a set of concepts. 中文初译: 这些节点有一个名称 。 哎呀。 好的。 我标签了这些节点 X。 我的电脑在这里非常慢。 这起作用了。 然后每个节点都有这个标签, 它是一个概念组 。 00:46:03.380 EN: Oops. So what we do here is this looks like this. So here can be as elements of the set, we have a set of concept. 中文初译: 我们在这里做的就是这个样子。这里可以作为一组元素, 我们有一个概念。 00:46:13.580 EN: And there can be complex concept or atomic concepts. So this is a node in the graph plus its label. And the label is a set of concepts. 中文初译: 可能存在复杂的概念或原子概念。所以这是图表中的节点加上它的标签。标签是一套概念。 00:46:31.310 EN: Then in this graph you have also directed edges to another node. And we label this, we call this node Y now. And of course also this node has again a label. And this is LY here. 中文初译: 然后在这个图中,你还把边缘指向另一个节点。我们贴上这个标签,我们现在叫这个节点Y。 当然,这个节点还有一个标签。这是LY。 00:46:56.740 EN: And the label is essentially the set of concepts for this node that you generate during the execution of the tableau algorithm. 中文初译: 标签实质上是您在执行排列法算法时生成的 这个节点的一套概念。 00:47:11.240 EN: You would see how you generate concepts here, but here we have different concepts that apply. So this is set of concepts. 中文初译: 你会看到这里是如何产生概念的, 但在这里我们有不同的概念可以应用。所以这是一套概念。 00:47:18.600 EN: And on top you have also an edge, a directed edge. And also the edge has a label. This is the concepts. These are the set of roles. So you have pairs of roles, 中文初译: 上面还有边缘,有定向边缘。 边缘也有标签。 这就是概念。这就是角色的组合。所以你们有两种角色, 00:47:52.720 EN: pairs of individuals connecting these roles. Good. And then you have a clash. If you have, for instance, a node label, so LY for instance, that has atomic concepts, an atomic concept and its negation. 中文初译: 连接这些角色的一对个人。很好。然后你遇到了冲突。例如,如果你有一个节点标签,比如说LY,它有原子概念、原子概念及其否定。 00:48:24.200 EN: Let's say A also and also, and so I write this like this here, otherwise I have to find special character and not A. 中文初译: 也这么说吧,所以我在这里写这个, 否则我必须找到个性,而不是A。 00:48:37.440 EN: And remember A needs to be atomic. A is atomic. So in this case you would have a clash. Or of course if you end up having the empty concept or the negation of the concept of all individuals, then you also have a clash. 中文初译: 记住,A必须是原子。A是原子。在这种情况下,你会发生冲突。或者如果你最终有了空洞的概念或否定所有个人的概念,那么你也会发生冲突。 00:49:00.530 EN: So I hope this graphic view is perhaps a little bit easier to understand, but keep in mind this sort of this graph. 中文初译: 我希望这个图形视图或许更容易理解, 但请记住这种图表。 00:49:14.110 EN: Then I talked about applying completion rules for testing the concept satisfiability. And this is a little bit cryptic here, but it's not too difficult. 中文初译: 然后我谈到应用完成规则来测试概念相对性。这里有点神秘,但并不难。 00:49:27.590 EN: So we have essentially four rules here for the various language constructs. So the intersection rule, the union rule, the existential restriction rule, and the universal or value restriction rule. 中文初译: 因此,我们这里有四条关于各种语言结构的规则。因此,交叉规则、工会规则、生存限制规则以及普遍或价值限制规则。 00:49:44.290 EN: So whenever you have an intersection of two concepts, and these can be complex concepts that are an element of a label of some vertice, so you have the node, so vertex and node is the same thing. 中文初译: 所以只要你有一个两个概念的交叉点, 这些可能是复杂的概念, 这些概念是一些脊椎标签的一个元素, 所以你就有了节点, 所以脊椎和节点是一样的。 00:49:58.610 EN: And so you have a node in the graph called V. We called it X before. And you have the label that is a set of concepts that you have generated in the executing the tableau algorithm for this particular node. 中文初译: 因此,图中有一个节点叫做 V. 我们以前称之为 X. 并且你有一个标签, 这是一套概念, 这是您在对这个特定节点执行排列法时生成的。 00:50:19.590 EN: So whenever you have an intersection of two concepts, what you do is simply extend the label of this node. So the set of concepts of this node with the concept C and D. 中文初译: 所以只要你有两个概念的交叉点, 你要做的就是扩展这个节点的标签。 这个节点的一组概念与 C 和 D 的概念。 00:50:38.350 EN: So again, this can be complex concepts. So essentially, you drop the intersection and you add the left-hand side and the right-hand side of this concept individually to the set of concepts for the label of the vertex V. 中文初译: 所以,这又可能是一个复杂的概念。所以基本上,你把十字路口掉下来, 把左手侧和右手边 单独添加到顶点V标签的一组概念中。 00:50:58.810 EN: This thing here is just saying that you do this only when C and D are not already in the set LV. So if C and D are individually already in this set of the label of the node V, then you don't have to do anything. 中文初译: 这件事只是说,C和D在尚未进入设定 LV时才会这样做。所以如果C和D已经单独出现在节点V的标签中,那么你什么都不用做。 00:51:23.370 EN: You're not adding any new information because C and D are already there. So you can test whether they are already in the set, and if they are already in the set, you're not doing anything. 中文初译: 您没有添加任何新信息, 因为 C 和 D 已经存在。 所以您可以测试它们是否已经在集中, 如果它们已经在集中, 您什么也没有做 。 00:51:33.910 EN: So that's it. So you can basically disregard all of this. It's a little bit of side information. You can, of course, also do it. 中文初译: 就是这样。所以你可以基本上不理会这一切。它只是一些侧面信息。当然,你也可以这样做。 00:51:42.050 EN: Nothing happens. It's a set. You just add the same element again. So in principle, you can also – in an algorithm, you can also do it. 中文初译: 什么都没有发生。这是一套组合。你只要再加一个相同的元素。所以原则上,你可以在算法中也这样做。 00:51:51.090 EN: Nothing happens. So this is just additional information. So you can focus on this part here in the beginning. It makes it a bit easier. 中文初译: 什么都没有发生。所以这只是补充信息。这样你就可以在开头集中关注这部分,这样就更容易了。 00:52:06.330 EN: The union is very similar. Again, also here. So if you have a union of two concepts in a label of a node V, then you simply choose one of the concepts. 中文初译: 工会非常相似, 同样在这里。 所以如果你在节点V的标签上有两个概念的结合, 那么您只需选择其中的一个概念。 00:52:23.150 EN: So either the left-hand side or the right-hand side of this complex concept, and you add that chosen concept to the set that is the label of the vertex V, of the node V in the graph. 中文初译: 所以要么是这个复杂概念的左手侧, 要么是右手侧, 然后在一组图中将选择的概念添加到图中结点V的顶点V的标签上。 00:52:43.450 EN: So see, here you have this X, and you choose one of these two, C or D, and you add the one you choose. This is where the algorithm is non-deterministic because you can choose one or the other. 中文初译: 所以,在这里您有了这个 X, 你选择了其中的一个, C 或 D, 然后添加一个。 这就是算法是非决定性的, 因为你可以选择一个或者另一个。 00:52:58.370 EN: So when you execute this algorithmically, you don't know which one the algorithm will choose. So that's where in the execution of the tableau algorithm, you end up having non-deterministic. 中文初译: 所以当你用算法执行这个算法时, 你并不知道算法会选择哪个。所以在使用排列法算法的时候, 你最终会出现非决定性的状态。 00:53:11.870 EN: So you don't know which sort of tree the algorithm will end up generating, assuming you have some union rules that you apply. 中文初译: 所以你不知道算法最终会产生哪种树 假设你有一些工会规则 00:53:26.780 EN: Good. Then the other two are a little bit more involved. So you have the existential restriction rule. So assuming we have a concept that has an existential restriction in the label of the node V, and if there is no R successor V', so what does that mean? 中文初译: 很好。 那么另外两个则略为多一些参与。 所以你有了存在限制规则。 所以假设我们有一个概念, 在节点V的标签上有存在限制, 如果没有R的继承者V', 那意味着什么? 00:53:55.920 EN: The R successor V' is a node in the graph called V' that is connected to V via a role R. Okay, so remember what I showed you before. 中文初译: R的继承者V是图中的节点 叫做V,它通过角色R连接到V 00:54:17.060 EN: Maybe I can switch here to this one quickly. We have here Y is a, and I didn't label this now, is an R successor of X. 中文初译: 或许我可以很快地从这里切换到这个。我们这里的Y是A, 我没有贴上这个标签,现在是X的R继承者。 00:54:35.680 EN: So R successor. Y is an R successor of X. So if there is no edge between X and Y, this is what this means, you create that edge, and you create a new vertex V', so that will be my Y in the previous visualization, and you label this new node in the graph with the class C, 中文初译: R 继承者。 Y 是 X 的 R 继承者。 所以, 如果 X 和 Y 没有边缘, 这就是这个意思, 你创建了那个边缘, 然后创建一个新的顶点 V', 这样在以前的视觉化中, 这将是我的Y, 然后你将图表中的这个新节点与 C 类标注, 00:55:11.010 EN: and that's the filler in your concept with the existential restriction. And, of course, you add then the new node to the set of nodes and the new role between V and V' or X and Y to the set of roles. 中文初译: 这就是你概念中的“存在限制”的填充者。当然,然后,在一组节点中添加新的节点, 在一组角色中加入V和V'或X和Y之间的新角色。 00:55:35.670 EN: This is what this means. So this is where, with these existential rules, where the graph sort of expands. So you create here new nodes with the union and intersection rules. 中文初译: 这就是这个意思。这就是这些存在规则, 图表种类的扩展。 所以你在这里创建了新的节点, 加上联盟和交叉规则。 00:55:49.430 EN: You don't really create new roles, you just extend the labels of existing roles, sorry, nodes. With the existential and universal restriction rules, here you extend the graph. 中文初译: 您并不真的创建新角色, 您只是扩展了现有角色的标签, 抱歉, 节点。 根据存在和通用的限制规则, 您在这里扩展了图表 。 00:56:05.630 EN: You see that we create new vertices. Actually, only with the existential rule, you create new vertices. The universal rule assumes that there is already an R successor V' of the node V or the Y as an R successor of node X in my example. 中文初译: 你可以看到,我们创造了新的顶点。实际上,只有存在规则,你才创造了新的顶点。 普遍规则假设已经有一个节点V或Y的R继承者,作为节点X的R继承者。 00:56:33.050 EN: And in this case, you add again the concept C, that's the filler here, here the filler of the complex concept. No, that's not a complex concept here. The concept – that is the – my brain doesn't work – the universal restriction with filler C. 中文初译: 在这种情况下,你又加上了C概念,这就是这里的填充者。在这里,就是复杂概念的填充者。 不,这不是一个复杂的概念。 这个概念 — — 也就是我的大脑不起作用 — — 是填充者C的普遍限制。 00:57:06.280 EN: In this case, you extend then the label of the new node, the node V', so the R successor of the node V with the class C. 中文初译: 在此情况下,您可以扩展新节点的标签, 即节点V', 所以是节点V与C级的R继承者。 00:57:24.090 EN: So the idea is here the same as with the existential restriction, except that it assumes that these are already an edge between V and V', so the V' being the R successor of V. 中文初译: 所以这里的想法与存在限制一样, 只是假设这些已经是V和V之间的边缘, V是V的R继承者。 00:57:45.350 EN: But the result of it is the same, so you add the concept C to the label of the vertex V'. And this needs to be applied a little bit to examples, I think. 中文初译: 但结果是一样的,所以你把C的概念加到顶点V'的标签上。我想这需要稍微应用到例子中去。 00:58:06.120 EN: How am I doing in time? Okay, bad as usual. Good. So let me draw maybe still a few examples to show how this works. 中文初译: 好,我还是像往常一样坏 很好,所以让我再举几个例子 来说明这是怎么回事 00:58:20.540 EN: In practice. So let's assume we have – so let's start with the intersection rule. So you have – oops, this one – so you have a node in the Tableau completion graph that has a concept – 中文初译: 在实践中。所以让我们假设我们已经有了 — — 让我们从交叉规则开始吧。因此,你有了 — — 哦,这个 — — 所以在排列图的完成图中有一个节点,它有一个概念 — — 00:58:55.440 EN: sorry, a label with a set of concepts, and here in particular we have a concept complex concept C and D. So here we can apply the intersection rule, and what we do is simply sort of extend this label and this set of concepts here. 中文初译: 对不起,一个带有一套概念的标签, 特别是这里,我们有一个复杂的概念C和D。 因此我们可以在这里应用交叉规则, 我们要做的就是扩大这个标签和这组概念。 00:59:20.380 EN: So the original one stands, but we extend this with the concept C and D, so the left-hand and the right-hand side of the complex concept that we had in the beginning. 中文初译: 因此,原来的概念是站立的,但我们用C和D概念来扩展这个概念, 也就是我们最初的复杂概念的左手和右手。 00:59:36.340 EN: That's the application of the intersection rule. Now, very simple. We can also do this for the union, and remember in the union case you essentially have to non-determinately choose whether you're selecting now the left-hand side or the right-hand side. 中文初译: 这就是交叉规则的应用。 现在,非常简单。我们也可以为工会这样做, 并且记住在工会案中, 你基本上必须不加限定地选择是选择左手还是右手。 01:00:03.380 EN: So you can either choose C or you can choose D. And of course, in a tableau completion, you would then choose one randomly first and then you choose the other one. 中文初译: 所以您可以选择 C 或者你可以选择 D。 当然, 在排列线完成后, 您将随机地首先选择一个, 然后选择另一个 。 01:00:19.280 EN: If you, for instance, have a clash, when you develop this sort of path in the tree, you might end up having a clash, so then you reject this path. 中文初译: 例如,如果你发生冲突, 当你在树上发展出这种路径时, 你可能会最终发生冲突, 所以你拒绝这条路径。 01:00:33.440 EN: And then you still have, you can still select D, the right-hand side of the original union concept, and then you can develop this path in the tree and that might end up without a clash and then you have a model that satisfies the concept. 中文初译: 然后你还有,你仍然可以选择D, 原工会概念的右手边, 然后你可以在树上发展这条路径, 最终可能没有冲突, 然后你有一个满足这个概念的模式。 01:00:55.520 EN: Good. This is also, I think, very easy. Then we have the case of the existential restriction rule. So you have something like some, and sorry, I'm writing this with some here because it's a little bit easier, but this is the existential restriction. 中文初译: 很好,我认为这也很容易。然后我们有了存在限制规则的例子。所以你有一些类似的东西,对不起,我在这里用一些人写这个是因为这比较容易,但是这是存在限制。 01:01:15.880 EN: So you have something like this in your, to test the satisfiability or develop the tableau. So what you do here is you create a new node, right? 中文初译: 所以,你有一些类似的东西 在你的, 测试对等性或开发排列板。所以你在这里做的是 创建一个新的节点,对不对? 01:01:30.070 EN: So you extend this graph with a new node Y, and this is now the Y is the R successor of X. So we have here, oops, so they are connected via this R role, and I'll write this just like this here. 中文初译: 所以,你用一个新的节点Y扩展这个图, 现在这是Y是 X 的R 继承者。 因此我们在这里看到, OOOs, 所以他们通过这个 R 角色连接起来, 我会写这个, 就像这里一样。 01:01:57.690 EN: So this means that Y is the R successor of X, and what we do is we add here to the label of Y the concept C. That's it, graphically. 中文初译: 这意味着Y是X的R继承者, 我们要做的就是在这里添加到Y的标签C概念。就是这样,图形化地。 01:02:18.330 EN: So we have a new node in this case, and we label this node with the filler, the concept of the filler of the role R. 中文初译: 因此我们在这个案例中有了一个新的节点, 我们把这个节点标上填充者, 即角色R的填充者的概念。 01:02:32.870 EN: And the universal restriction now assumes that there is already an R successor of X, but let's assume we do something like this. We can leave the, we can leave this one here, C, but we change this for exists, RD. 中文初译: 普遍限制现在假定X已经有一个R的继承者, 但是让我们假设我们这样做。我们可以把这个留在这里, C, 但我们改变它的存在, RD。 01:02:59.310 EN: And what we do here is if we encounter such a concept here, and we would develop the tableau, we assume that it is an R successor Y, and we simply extend its label with, in this case, concept D. 中文初译: 我们在这里要做的是 如果我们在这里遇到这样一个概念, 我们会发展这个表, 我们假设这是一个R的Y继承者, 我们只是把它的标签扩大为D的概念。 01:03:22.870 EN: Good. I hope this also gave you, first of all, I hope it was correct, and second, I hope it gave you a little bit of graphical insight for how this works. 中文初译: 很好,我希望这也给了你 首先,我希望它是正确的 第二,我希望它能给你一点 图形的洞察力 01:03:36.390 EN: So there are a number of examples here also. Example 1, we can check whether a certain concept is satisfiable. This is already in negation normal form, so all, there is no negation that you can move into the elements of the concept concept, complex concept, so we can directly apply the algorithm. 中文初译: 这里也有一些例子。例1, 我们可以检查某个概念是否值得推卸。 这已经是否定的正常形式, 所以所有, 不存在否定, 你可以进入概念概念的要素, 复杂的概念, 所以我们可以直接应用算法 。 01:04:01.230 EN: We start with this expression here. We apply the union rule, and what this means is we have two possibilities. Remember, the node that this means choice here, we can either add to the label of the node X here, either the left-hand side of the concept or the right-hand side. 中文初译: 我们从这里的表达方式开始。我们应用联盟规则, 这意味着我们有两个可能性。 记住, 这里表示选择的节点, 我们可以在这里添加到节点 X 的标签上, 要么是概念的左手边, 要么是右手边。 01:04:28.050 EN: In this case, the algorithm chose the left-hand side, so A and not A, in which case we can apply then the rule, the intersection rule, for this is not an atomic concept here, so we can further apply rules, in this case, the intersection rule, and the intersection rule means we just take the left-hand side and the right-hand side, and we extend the set, the label of the node X, 中文初译: 在这种情况下,算法选择了左手侧, 所以A而不是A, 在这样的情况下,我们可以适用规则, 交叉规则, 因为这里不是原子概念, 所以我们可以进一步应用规则, 在这个情况下,交叉规则, 而交叉规则意味着我们只选择左手侧和右手边, 我们扩展整套, 节点X的标签, 01:04:56.610 EN: so the set of concepts, with individually the left-hand, right-hand concepts, so we end up having A and not A, and these are now atomic, and this is a clash because you have an atomic concept A and its negation, which ends up being a clash, so discard this branch, if you want, in the tree of the tableau, but remember, there was a union here, 中文初译: 所以这一系列的概念, 分别的左手,右手概念, 因此我们最终有了A而不是A, 而现在这些是原子, 这是一场冲突,因为你有一个原子概念 A 及其否定, 01:05:27.690 EN: so you have also another option, so we can also apply here, go back, backtracking the tree to the very top and include B as a concept, and then we can see that this, you cannot apply any more rules, so these are our, so yeah, we already developed this concept, this is, C is a concept, complex concept here, but you have applied, 中文初译: 所以,你还有另一个选择, 所以我们也可以在这里应用, 回去, 回到树的顶部, 把B作为一个概念包含进去, 然后我们可以看到,你不能适用更多的规则, 所以这是我们的,所以是的, 我们已经开发了这个概念, 这就是,C是一个概念,这里是一个复杂的概念, 但是你们已经应用了, 01:05:56.750 EN: you have already developed in the tableau this concept, so you don't develop it further, and B is atomic, so that's where the algorithm stops because there is no clash, and therefore, this complex concept is satisfiable, and there is a model here, you essentially take the vertices, the nodes, and their, let's say, identification X, as a sort of an individual of this domain, 中文初译: 你在排列板上已经发展了这个概念, 所以你不进一步开发它, B是原子, 所以算法就是因为没有冲突而停止的, 因此,这个复杂的概念是可比较的, 并且这里有一个模型, 你基本上把脊椎,节点, 以及他们的,比如, 识别X, 当作这个领域的个体, 01:06:28.070 EN: so this is an interpretation that satisfies this complex concept, so the domain consists of this vertex here, and the concept A, the interpretation of concept A is empty because we had a clash, but the interpretation of the concept B contains, again, the X as an individual, and remember this is perfectly fine 中文初译: 因此,这是一个符合这个复杂概念的解释, 所以域由这里的这个顶点组成, 而A概念, A概念的解释是空的, 因为我们有冲突, 01:07:03.150 EN: because we had a union between A and not B and B. This is another example, maybe a little bit more complicated one, but we can quickly run through it, so, again, it's in negation normal form, so you have no negation that you can move into the, in the complex concepts, 中文初译: 因为我们在A而不是B和B之间有结合。这是另一个例子,也许更复杂一些, 但我们可以快速地通过它, 所以,再次,它是否定的正常形式, 所以你没有否定,你可以进入, 在复杂的概念中, 01:07:31.990 EN: even this one is already inside, so we can apply directly the rules. Here you have intersection of three concepts, A, R, B, and so some R, B, and sorry, is it some, or exists, all. 中文初译: 即使是这个也已经在里面了,所以我们可以直接应用规则。这里你有三个概念的交叉点:A,R,B, 所以有些R,B,对不起,是其中的一部分,还是全部存在。 01:07:56.250 EN: I think I made a mistake before with this is some and this is all R, not B, and we simply take this concept, so the regional one, and we expand this label of this node with the sort of the more atomic, they are not atomic yet, but with the elements of this concept, complex concept individually, A, some R, B, and all R, not B, 中文初译: 我认为我之前犯了一个错误, 这都是R, 不是B, 我们只是把这个概念, 所以区域的概念, 我们扩大这个节点的标签 以更原子的形式, 它们不是原子, 01:08:31.610 EN: and then we can apply the existential restriction rule to this, so we expand the graph with Y as an R successor of X, and we label this node Y here with the concept B, so the filler, and yeah, and we have an R as being a role of the set of the edge connecting X to Y, and then 中文初译: 然后我们可以对它应用存在限制规则, 所以我们可以将图表以Y扩展为X的R后继者, 我们在这里用B的概念标上这个节点Y, 所以填充器, 是的,我们有一个R是连接 X到Y的边缘的一个角色, 然后我们把这个节点标在了 B 概念上, 因此填充器,然后是,我们有一个 R 作为连接 X 到Y 的边缘的一部分, 然后 01:09:14.180 EN: as a next step, we can apply the existential restriction rule here, because we haven't developed this concept yet, right? 中文初译: 作为下一步,我们可以在这里适用生存限制规则, 因为我们还没有发展这个概念,对吧? 01:09:26.420 EN: And this assumes that there is already a R successor of X, so Y is an R successor of X, and we have that already, we have that edge, so what we do is we simply extend the label of Y with the filler of the concept filler of this concept that's not B, so we had already the label of node Y, right, with concept B, 中文初译: 这个假设已经有一个X的R后继者, 所以Y是X的R后继者, 而我们已经有了,我们有了那个边际, 所以我们要做的就是仅仅扩展Y的标签, 01:09:59.560 EN: and now we add not B, and as you can see now, we are essentially done, but we also end up with a clash, because B and not B are atomic, and therefore this concept here is unsatisfiable and there is no model. 中文初译: 现在,我们加起来不是B, 正如你现在所看到的, 我们基本上完成了, 但我们也结束了一场冲突, 因为B而不是B是原子, 因此这个概念在这里是不满意的, 并且没有模式。 01:10:20.600 EN: Good. Yeah, I think I need to hurry a little bit up. So, essentially, so what this says that what we did now is on individual concept expressions, right? 中文初译: 很好,我想我需要快点 所以,基本上,这上面说 我们现在所做的是 个人概念表达方式,对吧? 01:10:35.660 EN: We developed the tableau simply on individual concepts, but you can, of course, apply tableau also to entire T-boxes, and remember that T-boxes are an entire set of axioms, and you can essentially translate this general, what was it, general CGI's, general concept inclusion axioms into a concept, 中文初译: 我们仅仅根据个别概念发展了排列法, 但你当然也可以将排列法也应用到整个 T 框中, 并且记住T 盒是一套完整的定理, 你可以基本上把这个概论,什么是,一般的 CGI, 一般性的概念包含等同 变成一个概念, 01:11:08.580 EN: so we have seen this already, I think, that you can translate C subsumes D into this axiom, and then you would develop not C or D as a translation of the subsumption axiom C and not D, and remember that the equivalence, you can simply translate it into these two subsumptions, 中文初译: 所以,我们已经看到了这一点,我认为, 你可以将C子集D 转换成这个轴, 然后你不会开发C或D 作为子吸收轴C的翻译,而不是D, 并且记住,当量,你可以简单地把它转化成这两个子集, 01:11:38.400 EN: so also the equivalence axiom between two concepts can be reduced to the same equivalent concept here, and then you would translate a T-box into essentially the intersection of all the, yeah, how do you call this, translated CGI's. So, I think maybe you can pause offline a little bit on this one. 中文初译: 所以两个概念之间的等同轴 也可以减到相同的等同概念, 然后你将一个T框 转换为所有, 是的,你怎么称呼它, 翻译成CGI的交叉点。所以,我想你也许可以暂时停一下这个。 01:12:10.060 EN: So, the point is that you can translate all subsumption axioms into this kind of subsumption axiom where you have not C and D, and essentially this is then a concept, and you build the intersection of all these concepts is equivalent to your original T-box that consists of a set of subsumption or indeed equivalent axioms between classes, 中文初译: 所以,关键是,你可以将所有子吸附轴转换成 这种没有C和D的子吸附轴, 基本上这是一个概念, 你构建所有这些概念的交叉点 相当于你原来的T框, 它由一组子吸附或类间等同的轴组成, 01:12:41.540 EN: and then you can simply apply these rules that we just saw. So, you do this individually for each of the elements, potential complex concepts, of course, in this gigantic complex concept that is the intersection of each individual concept that make up your T-box. 中文初译: 然后你就可以简单地应用我们刚刚看到的这些规则。所以,你对每一个元素, 潜在的复杂概念,当然, 在这个巨大的复杂概念中, 单独地做这些, 这是构成你的T-box的每个单个概念的交叉点。 01:13:07.560 EN: So, essentially you apply the same rules that we just walked through to also the T-box for all the axioms in the T-box. 中文初译: 所以,基本上你适用同样的规则 我们刚刚走过 也到T框 T -box 对于所有xioms 在Tbox。 01:13:26.000 EN: Yes, and this is an example here for the T-box. We have subsumption axiom here. A subsumes the concept of existential restriction R to filler B with filler B, and you test the satisfiability of this concept A, and essentially you test whether A is satisfiable with respect to this T-box. 中文初译: 是的,这是Tbox的例子。我们这里有 subumption axiom。一个子集了存在限制概念 R 用填充器B填充器B, 你测试这个A概念的可比较性, 基本上你测试A是否与这个Tbox有关。 01:14:00.500 EN: So, we add A to the initial vertex in the completion graph, and then we develop the algorithm, the completion rules for this T-box. 中文初译: 因此,在完成图中的初始顶点中加入A, 然后我们开发算法, 这个Tbox的完成规则。 01:14:21.640 EN: So, what we said, we basically translate this GCI to a concept. So, we have not A or existential restriction R to a filler A, and then we apply the rules. This is now an easy as we have before. 中文初译: 所以,我们所说的,基本上,我们把这个GI转换成一个概念。因此,我们没有A或存在限制R对填充器A的限制,然后我们适用规则。现在这和以前一样容易了。 01:14:43.280 EN: We can apply the intersection, the union rule, sorry, here first. So, we add with this choice, we end up with a clash because we have A and not A. 中文初译: 我们可以使用十字路口, 工会规则,对不起,先在这里。所以我们加上这个选择, 我们最终会发生冲突,因为我们有A而不是A。 01:14:57.900 EN: So, we have this other choice here that we can add to the label of the node X, and then we can apply the existential restriction rule, meaning that we extend the graph with Y as in R successor of X, and we add the concept A that is the filler to the label of the vertex, the node X. 中文初译: 因此,我们这里有另外一个选择, 我们可以添加到节点 X 的标签上, 然后我们可以应用存在限制规则, 意思是我们用Y扩展图, 就像X 的R 后继者一样, 我们把A 的概念加到顶点的标签上, 即节点 X 。 01:15:26.020 EN: Now, we can apply this iteratively because you end up with Y with the same set of concepts as you started with the node X. 中文初译: 现在,我们可以迭接地应用这个功能 因为你最后与Y 有着与你以节点X开始的相同的概念。 01:15:37.780 EN: And, yeah, you can basically apply the same thing again, and you can see easily that this would never terminate. 中文初译: 而且,是的,你基本上可以 应用同样的东西 再次, 你可以看到很容易 这永远不会终止。 01:15:44.820 EN: So, what there is is a concept of blocking, an approach of blocking. And what blocking does essentially is if you have, let's say, a V or a node that is a successor directly, direct successor of an ancestor node, and the set of concept in the successor node is a subset of the concept in the ancestor node, 中文初译: 所以,有一个封堵的概念,一种封堵的方法。 基本上,封堵的原理是,如果你有一个V或者一个节点, 直接继承祖先节点, 而后继节点中的一套概念是祖先节点中这一概念的一个子集, 01:16:18.100 EN: then you can block the… the algorithm blocks this, the development of the algorithm, of the tableau for this node and stops there. 中文初译: 然后你就可以阻止... 算法阻挡这个节点 算法的发展, 这个节点的排列线的算法的发展 并停止在那里。 01:16:33.420 EN: So, otherwise, you have cycles, and you end up having infinite models. Yeah, this is the example here. So, if you develop this further, it's the same T-box here that we start off. 中文初译: 换句话说,你有循环周期,最终有无限的模型。是的,这就是这里的例子。如果你进一步发展这个, 它和我们开始的Tbox是一样的。 01:16:50.220 EN: You would have, again, the same set of concept in the label of the Y as in R successor of X, and Y is a direct… So, X is an ancestor of… actually, direct ancestors of Y. So, Y is directly blocked because the set of concepts is the same in this case. 中文初译: 在Y的标签上,你会有和X的R继承人一样的概念。 Y是直接的... 01:17:20.740 EN: And that's why… So, this tableau here would be blocked and terminated, and you end up having a model, and therefore, the concept A is satisfiable with a valid model and a terminated algorithm. 中文初译: 所以,这里的桌子会被封锁和终止, 你最终会有一个模型, 因此,A的概念 与一个有效的模型和一个终止的算法是可鄙的。 01:17:44.520 EN: Now, this one is an interesting slide because I'm not quite sure why, but… So, it starts off with the same kind of T-box, just that the concepts and roles are labeled differently. 中文初译: 这个幻灯片很有趣,因为我不知道为什么,但是... 01:18:01.120 EN: And it adds another axiom here by adding a first guard, a subclass of guard. And it signs that this is an infinite model, so it never terminates. 中文初译: 它在这里又增加了另一个轴心, 增加一个第一名警卫, 一个下级警卫。它表明这是一个无限的模型, 所以它永远不会终止。 01:18:18.220 EN: And I haven't quite figured out why that's the case, but my explanation – and it might be wrong – is that first guard, it ends up being not a directly blocked situation between a node and its ancestor, which was the case here. 中文初译: 我不知道为什么会这样, 但我的解释 — 可能是错误的 — 是第一名警卫, 最终不是直接堵塞节点与祖先之间的局面, 这里就是这种情况。 01:18:41.040 EN: But first guard is not directly blocked, and therefore, the blocking mechanism doesn't apply, and you end up having an infinite model where essentially each guard yields the next guard in the model. 中文初译: 但第一警卫没有直接被封锁, 因此,封锁机制并不适用, 最后你有一个无限的模型, 基本上每个警卫在模型中 产生下一个警卫。 01:19:00.200 EN: But by introducing this additional axiom here, you have a situation where they are not – the tableau is not directly blocked. 中文初译: 但是,通过在这里引入这一额外的轴心,你有一种情况是它们不是—— 台风没有被直接阻塞。 01:19:14.360 EN: But I'm actually not quite sure, and if you want, you can discuss this also next week still with Sura. So, I'm probably way over time already, so this is just a hint here. 中文初译: 但我实际上不太确定,如果你愿意的话, 你可以在下周和苏拉讨论这个问题。所以,我可能已经过了一段时间了, 所以这只是个提示而已。 01:19:30.920 EN: You have a URL that you can look at, and this is an application here where you can test the complexity of different description logic. 中文初译: 您有一个可以查看的 URL, 这是在这里的一个应用程序, 您可以测试不同描述逻辑的复杂性 。 01:19:41.460 EN: So, you can compose your language, so to say, by selecting the functionalities, the constructors, and then you can explore what computational complexity for the value services this language would have. 中文初译: 所以,你可以拼写你的语言,比如说, 通过选择功能, 构建器, 然后可以探索这些语言的价值服务 的计算复杂性。 01:19:59.280 EN: This is quite a nice tool that was developed at Manchester University. So, you can take a look at this if you want to see a little bit, understand a little bit the computational complexity. 中文初译: 这是曼彻斯特大学开发的一个很好的工具。所以,如果你想看一眼,你可以看一下这个, 稍微了解一下计算的复杂性。 01:20:14.240 EN: And yes, summary. I can, I think, skip this. It's basically a larger repetition, and then we have a number of tasks, as usual. 中文初译: 是的,摘要。我想我可以跳过这个。基本上这是一个更大的重复, 然后我们像往常一样有一系列的任务。 01:20:27.860 EN: So, I would still want to highlight two things. I was a bit slow. One is, and I can copy this into the chat, you can take a look at this also offline. 中文初译: 所以,我还是想强调两件事。我当时有点慢。一是,我可以把它复制到聊天中, 你可以看看这个离线的。 01:20:44.020 EN: So, what you can do here, this is the simple JavaScript now. Yes. So, what you can do here is compose expressions. 中文初译: 所以,你在这里可以做的是简单的 JavaScript 现在。是的。所以,你可以在这里做的就是 拼写表达式。 01:20:54.660 EN: So, let's say, sorry, it's very crude. So, you can build expressions like this, and then you can check the satisfiability of these concepts, and it shows you a tableau development here. 中文初译: 这么说吧,对不起,这是非常粗糙的。所以你可以这样构建表达式, 然后你可以检查这些概念的可比较性, 它展示了这里的平板图发展。 01:21:15.040 EN: So, this expression is valid, and the concept is unsatisfiable, as we saw. You have two atomic concepts here and not A, and it shows you in a very crude manner. 中文初译: 因此,这个表达方式是有道理的,正如我们所看到的,这个概念是不令人满意的。你在这里有两个原子概念,而不是A,它以非常粗糙的方式向你们展示。 01:21:28.720 EN: I wish I would have done this a little bit in a graphical manner. Maybe we can have a student extending this so that you would see, actually, the nodes as we developed in this lecture. 中文初译: 我希望我能够用图形化的方式做一点。也许我们可以让学生延长这个时间,以便你们看到我们在这次演讲中发展出来的节点。 01:21:40.620 EN: But then, eventually, you have this situation where you have A and not A, and this A0 is here, what the label of, or the identifier of the node. 中文初译: 但是,最终,你有了这样的情况: 你拥有A而不是A, 而这个A0在这里,什么标签, 或节点的标识。 01:21:52.160 EN: So, X and Y or V, V prime in our lecture. And you can do this for various examples. So, this one, for instance, you can check the satisfiability, and this expression is valid, and it's, of course, satisfiable, and it shows you a model and also the tableau development. 中文初译: 所以, X 和 Y 或 V, 在我们的演讲中, V 优等。 您可以用多种例子来做这个例子。 因此, 比如说, 这个例子, 你可以检查是否可作对, 这个表达方式是有效的, 当然它也是可作对的, 它展示了一个模型, 同时也展示了表情的发展过程。 01:22:13.680 EN: So, see, you have here A or not A, and you have these two options, non-deterministically and choice, and yeah. So, you can play around with this. 中文初译: 所以,你看,你在这里有A或不是A, 你有两个选项, 非决定性的和选择的, 是的。所以你可以玩这个游戏。 01:22:29.160 EN: There are also a little bit more complicated things, like this one. You can see the model here and also the development of the tableau algorithm again. 中文初译: 还有更复杂的事情, 比如这个。 您可以在这里看到模型, 并且再次开发排列法算法 。 01:22:44.030 EN: And I think I also have some T-box things. This is a GCI, a General Concept Inclusion, and yeah, it's the same thing. 中文初译: 我也有一些Tbox的东西。这是一个GCI,一个通用概念包容, 是的,这是同样的事情。 01:22:57.840 EN: You can translate this into negation normal form and then apply the T rule for the T-box. You translate this axiom so that you can develop the tableau. 中文初译: 您可以将它转换为否定的正常形式, 然后对 Tbox 应用 T 规则。 您可以翻译此正则, 这样您就可以开发排列符 。 01:23:14.480 EN: So, you can play around it. I don't give any guarantee that it's bug-free. It's a long time, 15 years ago, that I developed this tool, and I never actually used it, so it was an exercise. 中文初译: 所以,你可以绕着它玩。我不给任何保证 它是无虫的。那是很长一段时间,15年前, 我开发了这个工具,我从来没有实际使用过它,所以这是一个练习。 01:23:30.700 EN: Good. If you have still a few minutes, I would still want to briefly touch upon the third part of this lecture, and this is a more practical view on how this, you know, you can use all this in practice. 中文初译: 很好,如果你还有几分钟时间,我还是想简要地谈谈这次演讲的第三部分,这是对如何在实践中使用所有这些方法更实际的看法。 01:23:49.320 EN: And you probably have seen Protege already. I'm not sure. You can quickly let me know in the chat. So, Protege is a tool to develop owl ontologies to create and maintain and edit owl ontologies. 中文初译: 你可能已经看过"普罗特奇"了。我不确定。你可以在聊天中尽快告诉我。所以,普罗特奇是开发猫头鹰内科的工具, 用来创建、维持和编辑猫头鹰内科。 01:24:06.400 EN: And I have here a simple owl ontology with a number of classes here, environmental system processes and material entities. 中文初译: 我这里有一个简单的猫头鹰本体论, 这里有许多课程, 环境系统过程和物质实体。 01:24:17.420 EN: So, environmental system processes. We have two subclasses, atmospheric processes, and then we have atmospheric lightning as a particular atmospheric process and lightning strike as an atmospheric lightning. 中文初译: 所以,环境系统过程。我们有两个子类,大气过程, 然后我们有大气闪电作为特定的大气过程, 闪电作为大气闪电。 01:24:35.400 EN: We have also some material entities here, a concrete cloud or the planetary surface. There could be a forest, for instance, or plasma, which is the result of a lightning strike. 中文初译: 我们这里还有一些物质实体,一个混凝土云或行星表面。例如,可能有一个森林或等离子体,这是闪电袭击的结果。 01:24:49.880 EN: And then you can describe these concepts. Let me focus on this one or maybe on this one also. So, lightning strike, now we can describe here in a formal way, meaning machine readable way, the semantics of the meaning of lightning strikes using essentially the constructs that we just discussed. 中文初译: 然后你可以描述这些概念。让我也关注一下这个或者这个。所以,闪电打击, 现在我们可以用一个正式的方式来描述这里, 意思是机器可以读懂的方式, 使用我们刚才讨论的基本结构来描述闪电打击的意义的语义。 01:25:15.120 EN: So, this is a concept. This is overall a complex concept. So, lightning strike is a subclass of atmospheric lightning, which is this direct subclass, but also a subclass of all concepts that have a participant with either a planetary surface or a material entity like a tree 中文初译: 因此,这是一个概念。这是一个整体复杂的概念。因此,闪电打击是一个大气闪电的子类, 即直接的子类, 但也是一个包含所有概念的子类, 其参与者要么是行星表面,要么是像树一样的物质实体 01:25:44.920 EN: or maybe a tree that is adjacent to the planetary surface. So, basically a tree that is on the planetary surface. 中文初译: 或者说一棵与行星表面相邻的树。所以,基本上就是一棵位于行星表面的树。 01:25:56.240 EN: So, the lightning strike could essentially involve either the surface, if the strike was directly on the ground, or some material entity like a house or a tree or hopefully not an umbrella with a person that is adjacent on the surface. 中文初译: 因此,闪电打击基本上可能涉及地表,如果撞击直接在地面上,或者一些物质实体,如房屋或树,或者希望不是有靠近地面的人的伞。 01:26:17.940 EN: So, this should reflect a little bit what we discussed in the lecture now today with A and not B and existential restriction and so on. 中文初译: 因此,这应该稍微反映一下我们今天在今天的演讲中与A而不是B讨论的问题,以及存在限制等等。 01:26:27.300 EN: So, perhaps it's just an owl using the owl language of representing these constructs and these complex concepts and subclasses using the owl language. 中文初译: 所以,也许它只是一只猫头鹰 使用猫头鹰语言来代表这些构思 以及这些复杂的概念和子类 使用猫头鹰语言。 01:26:45.640 EN: Yes, and then we have concrete instances like a concrete lightning strike, which has an output. Plasma has a participant, a tree. 中文初译: 是的,然后我们有具体的例子,比如实实在在的闪电打击,它有一个输出。等离子瘤有一个参与者,一棵树。 01:26:56.700 EN: So, this is now a material entity that is adjacent to some forest floor and the forest floor is a planetary surface and has also participant, a cloud. 中文初译: 因此,现在这个物质实体 与一些森林底相邻, 森林底是一个行星表面, 也有一个参与者,一个云。 01:27:11.700 EN: So, the lightning strike essentially begins in a cloud and then strikes some material entity, the tree on the forest floor. Good. 中文初译: 所以,闪电袭击基本上是从云中开始的 然后撞击到一些物质实体, 森林地板上的树。很好。 01:27:23.940 EN: And that's just a description of our domain using these ontology constructs. What we also state here is that an environmental system process is disjoint with material entities. 中文初译: 这只是用这些本体构造来描述我们的领域。我们在这里也指出, 环境系统进程与物质实体脱节了。 01:27:41.200 EN: So, an individual can either be an instance of some environmental system process or it can be an instance of a material entity, but it cannot be both an instance of material entity and an instance of a process. 中文初译: 因此,个人既可以是某种环境系统进程的例子,也可以是物质实体的例子,但不能既是物质实体的例子,也不能是一个过程的例子。 01:27:58.540 EN: That's what this disjoint entity means. Now, we're now going further into the ontology and the description of these concepts. 中文初译: 这就是这个脱节实体的意义。我们现在要深入探讨 肿瘤学和这些概念的描述。 01:28:08.020 EN: What I would like to show you briefly to conclude here is how you can use visioners in Protege in order to test whether your knowledge base, remember this is a knowledge base now because you have axioms. 中文初译: 我想在这里简短地向大家介绍一下,这里要总结的是,你如何能够在Protege中使用视觉者来测试你的知识库,记住这是一个知识库,因为你有正弦。 01:28:27.220 EN: So, for instance, that atmospheric process is a subclass of environmental system process. That's an axiom in your teabox. But then you also have assertions. 中文初译: 比如说,大气过程是环境系统过程的子类。这是你茶盒中的正弦。但是你也有断言。 01:28:38.340 EN: So, you have a complete individual lightning strike, the one that happened yesterday. And these are now assertions. 中文初译: 所以,你有一个完整的个别的闪电打击, 昨天发生的那一次。现在这些是断言。 01:28:46.940 EN: So, you have a lightning strike individual that is an instance of the concept lightning strike and has relations to other individuals, in particular an output plasma and the participant tree and the participant cloud. 中文初译: 所以,你有一个闪电击手 是一个闪电打击概念的例子 并且与其他个人有关系, 特别是输出等离子体和参与者树 以及参与者云。 01:29:02.220 EN: So, we have in this knowledge base both a teabox with axioms and an a-box with assertions. And we can test the satisfiability of this knowledge base. 中文初译: 因此,在这个知识库中,我们既有一个含有轴心的茶盒,又有一个带有断言的茶盒。我们可以测试这个知识库的可比较性。 01:29:18.520 EN: Now, essentially applying what we discussed today, right, we can translate the whole teabox into this conjunction of concepts, apply tableau and test also the satisfiability of each individual that we have with respect to the teabox in the knowledge base. 中文初译: 现在,基本上应用我们今天讨论的内容,对了, 我们可以把整个茶盒 转换成这个概念的组合, 应用茶桌, 并且测试每个人对于我们的知识库中的茶壶的可嘲讽性。 01:29:43.560 EN: And eventually, the reasoner does this all automatically and eventually tells you whether this knowledge base is satisfiability, so has a valid interpretation and model or not. 中文初译: 最终,理智者会自动地做这一切 最后会告诉你 这个知识基础是否是可信赖的 所以是否有有效的解释和模型 01:29:55.480 EN: And you can simply – there are a number of reasoners out there. I'm using generally Hermit. It's a fairly comprehensive reasoner in contrast to others, like ELK only, I think, implements OWL, the fragment RL, so the profile. 中文初译: 你可以简单地说——外面有很多理性者。我一般使用隐士。它比其他人更全面,比如ELK,我想它只执行“OWL”的碎片RL, 也就是配置图。 01:30:16.500 EN: So, it doesn't include all the language constructs that you have in OWL-DL. But Hermit is fairly comprehensive. 中文初译: 所以,它并不包括所有的语言结构, 你在“OWL”-DL中拥有的。但是 Hermit是相当全面的。 01:30:28.420 EN: I think it's – I'm not sure if it's a full implementation of DL or not. But, yeah, you can use any of these. You might just run into some messages that some of the expressions are not supported by some reasons. 中文初译: 我认为是- 我不确定它是否完全实施了 DL 。 但是, 是的, 你可以使用其中任何一种方式。 你可能遇到一些信息, 有些表达方式没有某些理由支持。 01:30:47.820 EN: So, let's use Hermit and then you can start this reasoner and you can see here now that the reason is active and you can – that nothing happens. 中文初译: 所以,让我们使用 Hermit 然后你可以开始这个理性的, 你可以在这里看到 理由是活跃的,你可以—— 什么也没有发生。 01:31:00.640 EN: So, this – there was no message here. This knowledge base here is satisfied. It's consistent. So, there is a model interpretation of – that satisfies this knowledge base. 中文初译: 因此,这里没有信息。这里的知识基础是满意的。这是一致的。因此,有一个模型解释 — — 满足了这个知识基础。 01:31:19.320 EN: But now we can introduce some inconsistency and for the – for simplicity, I'm simply exploiting this jointness between material entity and environmental system process. 中文初译: 但现在我们可以引入一些不一致之处, 为了简洁起见,我只是想利用物质实体和环境系统进程之间的这种共通性。 01:31:33.680 EN: So, what I'm going to do is I'm simply stating that this concrete cloud here that we have today over the sky, in and over, is not just type cloud, so a material entity, but also I'm now stating that this is also an instance of a material process, let's say an atmospheric process. 中文初译: 所以,我要做的就是 我只是说 今天我们这里的这个混凝土云 在天空中 时不时地 不仅仅是打云 所以是一个物质实体 01:31:56.960 EN: You could argue, well, a cloud being some kind of atmospheric process, which would be more like the cloud formation perhaps would be an atmospheric process, but the resulting cloud is a material entity. 中文初译: 你可以争辩说,云是某种大气过程, 更像是云的形成可能是一个大气过程, 但由此产生的云是一个物质实体。 01:32:10.380 EN: Anyway, I'm introducing here this obvious inconsistency because you remember that there is a disjoint action between the material entities and the atmospheric process. 中文初译: 总之,我在这里介绍这个明显的不一致之处 因为你记得物质实体和大气过程之间 有一种脱节的行动 01:32:24.040 EN: So, what I'm going to do now to show you this is run the – synchronize the reasoner. You can also stop and start it again. 中文初译: 所以,我现在要向大家展示的是, 同步理智。你也可以停下来重新开始。 01:32:33.380 EN: And you can see now that the reasoner says there is an inconsistency here. This knowledge base is now not consistent anymore because I introduce this additional assertion here that leads to an inconsistency because of the disjointness action, that no individual can be an instance at the same time of a material entity and of a process. 中文初译: 现在你可以看到,理智者说这里存在不一致。这个知识基础现在不再一致了,因为我在这里提出这一补充主张,导致不一致,因为不团结行动,任何个人都不能同时成为物质实体和进程的例子。 01:33:00.950 EN: And the interesting thing is, as an additional service of reasoners, is that you can algorithmically explain where this inconsistency is. 中文初译: 有趣的是,作为理性者的一种额外服务, 你可以用算法来解释这种不一致之处。 01:33:14.690 EN: And you can see the algorithm now gives you an explanation. So, it highlights those axioms and assertions that lead to the inconsistency. 中文初译: 你可以看到算法现在给了你一个解释。所以,它突出了导致不一致的轴心和断言。 01:33:27.130 EN: So, you have here the assertions – sorry, the axioms that atmospheric process is a subclass of elemental system process. 中文初译: 所以,你在这里有这样的说法-抱歉, 大气过程是元素系统过程的子分类。 01:33:37.050 EN: You have an other subclass axiom that cloud is a subclass of material entity. So, essentially these are the two concepts that we used in the assertion of the cloud. 中文初译: 你还有另一个子类轴, 云是物质实体的子类。 因此,基本上这两个概念 是我们用来确定云的两个概念。 01:33:54.230 EN: And it's important to know that these are subclasses on one end of material entity and the other atmospheric processes and a subclass of environmental system process. 中文初译: 重要的是要知道,这些是物质实体一端的子类 和其他大气过程 以及环境系统过程的子类。 01:34:06.370 EN: And it tells you here that these two concepts, the more abstract concept of the ones that we are actually using in the assertion, are disjoint. 中文初译: 它告诉大家,这两个概念, 更抽象的概念, 是我们在主张中实际使用的概念, 是脱节的。 01:34:18.890 EN: This is this axiom here. So, this class and this class are disjoint, meaning that also all the subclasses, of course, are disjoint. 中文初译: 这就是这个轴心。所以,这门课和这门课是脱节的, 这意味着所有的子类当然也是脱节的。 01:34:27.750 EN: So, you cannot have an instance of cloud being at the same time also an instance of atmospheric process. And then, in addition, we have, of course, our concrete cloud. 中文初译: 所以,你不能有云 同时也是大气过程的例子。此外,我们当然也有混凝土的云。 01:34:40.930 EN: It says that a cloud is a type cloud and a cloud is a type atmospheric process. And this is where then eventually you have this inconsistency that this individual here can indeed not be at the same time an instance of atmospheric process and of cloud because these classes are disjoint. 中文初译: 它说云是一种类型的云,而云是一种类型的大气过程。 最终你会有这样的不一致之处: 这个个体不能同时出现大气层的过程和云, 因为这些种类是脱节的。 01:35:08.950 EN: Yeah, so this is a very quick demo for how to use these reasoners. So, algorithmic or implementations of Tableau and with a more practical context than what we saw in the lecture with these more theoretical expressions. 中文初译: 是的,所以这是一个非常快速的演示 用于如何使用这些理性。因此,算法或执行表单, 并且比我们在演讲中看到的更实际的背景 更加理论化的表达方式。 01:35:37.330 EN: Here you have a concrete domain with a concrete tool where you – or a number of tools, protege and reasoners, that you can use these services also in practice. 中文初译: 这里有一个具体的域, 包含一个具体的工具, 您也可以在实际中使用这些服务。 或者一些工具, Protege和理智者。 01:35:50.390 EN: This is to basically show you that this is not just theory, but there has been a lot of development in the last – well, the foundations are very old here. 中文初译: 基本上,这是要向大家表明,这不仅仅是理论,而在过去的一段时间里发展了很多 — — 这里的基础已经很老了。 01:36:01.530 EN: They're coming from the 70s or even earlier maybe. But then the more recent technologies here with OWL and the semantic web technologies, they are a little bit younger, let's say at least 20 years. 中文初译: 他们来自70年代,甚至更早的70年代。但是, 最新的技术是“OWL”和语义网络技术, 它们年轻了一点,至少20年。 01:36:15.930 EN: And you can see that there has been a lot of development to kind of implement all this theory that was developed earlier into concrete tools that can be used to implement semantic web applications and also reasoning in semantic web applications. 中文初译: 你可以看到,已经有许多发展 来实施所有这些理论。 这些理论是早先发展成的具体工具, 可以用来应用语义网络应用程序 以及语义网络应用程序的推理。