• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 2
  • Tagged with
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

A Modified Completeness Theorem of KAT and Decidability of Term Reducibility / KATの完全性定理と項の還元可能性の決定可能性

Uramoto, Takeo 24 March 2014 (has links)
京都大学 / 0048 / 新制・課程博士 / 博士(理学) / 甲第18041号 / 理博第3919号 / 新制||理||1566(附属図書館) / 30899 / 京都大学大学院理学研究科数学・数理解析専攻 / (主査)准教授 西村 進, 教授 加藤 毅, 教授 長谷川 真人 / 学位規則第4条第1項該当 / Doctor of Science / Kyoto University / DGAM
2

A Tableau Algorithm for SROIQ under Infinitely Valued Gödel Semantics

Borgwardt, Stefan, Peñaloza, Rafael 20 June 2022 (has links)
Fuzzy description logics (FDLs) are knowledge representation formalisms capable of dealing with imprecise knowledge by allowing intermediate membership degrees in the interpretation of concepts and roles. One option for dealing with these intermediate degrees is to use the so-called Gödel semantics. Despite its apparent simplicity, developing reasoning techniques for expressive FDLs under this semantics is a hard task. We present a tableau algorithm for deciding consistency of a SROIQ ontology under Gödel semantics. This is the first algorithm that can handle the full expressivity of SROIQ as well as the full Gödel semantics.

Page generated in 0.1076 seconds