找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Automated Reasoning; 6th International Jo Bernhard Gramlich,Dale Miller,Uli Sattler Conference proceedings 2012 Springer-Verlag Berlin Heid

[复制链接]
楼主: 帐簿
发表于 2025-3-30 08:36:23 | 显示全部楼层
The Human Factor and Strategic Integrationpropose to use UEL as a tool to detect redundancies in such ontologies by computing unifiers of two formal concepts suspected of expressing the same concept of the application domain. UEL can be used as a plug-in of the popular ontology editor Protégé, or as a standalone unification application.
发表于 2025-3-30 13:17:12 | 显示全部楼层
发表于 2025-3-30 19:08:34 | 显示全部楼层
https://doi.org/10.1057/9780230523746ly, finding neither a proof nor a disproof of a given subgoal..In this paper we characterize a family of truth-preserving abstractions from intuitionistic first-order logic to the monadic fragment of classical first-order logic. Because they are truthful, these abstractions can be used to disprove sequents in intuitionistic first-order logic.
发表于 2025-3-30 23:49:42 | 显示全部楼层
Three-Stage Commitment Buildingion conditions are generated using a novel calculus for computing the strongest postcondition of statements manipulating the heap, such as dynamic allocation and field-assignment. Further, we introduce a new decidable tableaux-based method and its prototype implementation to automatically check these verification conditions.
发表于 2025-3-31 01:42:02 | 显示全部楼层
发表于 2025-3-31 06:08:56 | 显示全部楼层
UEL: Unification Solver for the Description Logic , – System Descriptionpropose to use UEL as a tool to detect redundancies in such ontologies by computing unifiers of two formal concepts suspected of expressing the same concept of the application domain. UEL can be used as a plug-in of the popular ontology editor Protégé, or as a standalone unification application.
发表于 2025-3-31 10:40:26 | 显示全部楼层
How Fuzzy Is My Fuzzy Description Logic?-norms and an expressive fuzzy DL for which ontology consistency is linearly reducible to crisp reasoning, and thus has its same complexity. Surprisingly, in these same logics crisp models are insufficient for deciding fuzzy subsumption.
发表于 2025-3-31 15:13:38 | 显示全部楼层
发表于 2025-3-31 17:47:16 | 显示全部楼层
发表于 2025-4-1 01:01:25 | 显示全部楼层
SAT Encoding of Unification in , w.r.t. Cycle-Restricted Ontologieson the one hand, we add general concept inclusion axioms, and on the other hand, we add role hierarchies (.) and transitive roles (..). For the translation to be complete, however, the ontology needs to satisfy a certain cycle restriction. The SAT translation depends on a new rewriting-based characterization of subsumption w.r.t. .-ontologies.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-21 00:12
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表