找回密碼
 To register

QQ登錄

只需一步,快速開始

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

打印 上一主題 下一主題

Titlebook: Web Reasoning and Rule Systems; 6th International Co Markus Kr?tzsch,Umberto Straccia Conference proceedings 2012 Springer-Verlag Berlin He

[復制鏈接]
樓主: solidity
21#
發(fā)表于 2025-3-25 07:17:10 | 只看該作者
22#
發(fā)表于 2025-3-25 10:34:43 | 只看該作者
Semantic Matchmaking and Ranking: Beyond Deduction in Retrieval Scenarioshe process of computing such ordered list also taking into account the semantics of resources description and of the query, provided with reference to a logic theory (an ontology, a set of rules, etc.) [3]. A matchmaking step is fundamental in a number of retrieval scenarios spanning from (Web) serv
23#
發(fā)表于 2025-3-25 13:29:40 | 只看該作者
24#
發(fā)表于 2025-3-25 16:08:40 | 只看該作者
A Tableau Algorithm for Fuzzy Description Logics over Residuated De Morgan Latticesin the description logic . with semantics based on a complete residuated De Morgan lattice. The problems are undecidable in the general case, but can be decided by a tableau algorithm when restricted to finite lattices. For some sublogics of ., we provide upper complexity bounds that match the compl
25#
發(fā)表于 2025-3-25 21:15:38 | 只看該作者
A Tableau Algorithm for Fuzzy Description Logics over Residuated De Morgan Latticesin the description logic . with semantics based on a complete residuated De Morgan lattice. The problems are undecidable in the general case, but can be decided by a tableau algorithm when restricted to finite lattices. For some sublogics of ., we provide upper complexity bounds that match the compl
26#
發(fā)表于 2025-3-26 01:51:20 | 只看該作者
Ontology-Based Governance of Data-Aware Processesntologies. In particular, we consider processes executed over a relational database which issue calls to external services to acquire new information and update the data.We equip these processes with an OBDA system, in which an ontology modeling the domain of interest is connected through declarativ
27#
發(fā)表于 2025-3-26 07:01:45 | 只看該作者
28#
發(fā)表于 2025-3-26 09:02:53 | 只看該作者
29#
發(fā)表于 2025-3-26 14:37:39 | 只看該作者
30#
發(fā)表于 2025-3-26 20:24:14 | 只看該作者
Semantic Independence in DL-Programsinterest. When computing answer sets of a DL-program, special DL-atoms, which provide query interface to an ontology, are evaluated under a possibly changing input that gives a context for the evaluation. Many different such contexts may exist and evaluating a DL-atom may be costly even for one cont
 關于派博傳思  派博傳思旗下網站  友情鏈接
派博傳思介紹 公司地理位置 論文服務流程 影響因子官網 吾愛論文網 大講堂 北京大學 Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點評 投稿經驗總結 SCIENCEGARD IMPACTFACTOR 派博系數 清華大學 Yale Uni. Stanford Uni.
QQ|Archiver|手機版|小黑屋| 派博傳思國際 ( 京公網安備110108008328) GMT+8, 2026-1-18 02:32
Copyright © 2001-2015 派博傳思   京公網安備110108008328 版權所有 All rights reserved
快速回復 返回頂部 返回列表
平原县| 陆丰市| 康定县| 红原县| 班玛县| 杭锦后旗| 富裕县| 攀枝花市| 安陆市| 如东县| 台中县| 麻江县| 桓仁| 龙里县| 普陀区| 台东市| 襄城县| 友谊县| 隆化县| 红河县| 昌图县| 东明县| 贵定县| 香格里拉县| 旬邑县| 木兰县| 五河县| 孝昌县| 沂南县| 吴忠市| 乡宁县| 和龙市| 尉氏县| 丰县| 巨鹿县| 惠水县| 永新县| 成安县| 镇巴县| 金阳县| 安陆市|