找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

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

[復制鏈接]
樓主: 帳簿
51#
發(fā)表于 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.
52#
發(fā)表于 2025-3-30 13:17:12 | 只看該作者
53#
發(fā)表于 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.
54#
發(fā)表于 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.
55#
發(fā)表于 2025-3-31 01:42:02 | 只看該作者
56#
發(fā)表于 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.
57#
發(fā)表于 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.
58#
發(fā)表于 2025-3-31 15:13:38 | 只看該作者
59#
發(fā)表于 2025-3-31 17:47:16 | 只看該作者
60#
發(fā)表于 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.
 關于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學 Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點評 投稿經(jīng)驗總結 SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學 Yale Uni. Stanford Uni.
QQ|Archiver|手機版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-15 15:06
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權所有 All rights reserved
快速回復 返回頂部 返回列表
成都市| 江津市| 婺源县| 廊坊市| 漳浦县| 兴隆县| 新余市| 宜宾市| 黄平县| 洛川县| 庆云县| 南岸区| 西平县| 临潭县| 恩施市| 孝昌县| 阿瓦提县| 凉山| 平顶山市| 拜城县| 四子王旗| 奉节县| 清丰县| 乌兰县| 无极县| 肇州县| 海林市| 板桥市| 吉安市| 龙岩市| 建德市| 克山县| 延吉市| 镇宁| 象州县| 老河口市| 嘉峪关市| 蕉岭县| 伊川县| 呼和浩特市| 杂多县|