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

只看該作者 · 發(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

只看該作者 · 發(fā)表于 2025-3-25 13:29:40

只看該作者 · 發(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

只看該作者 · 發(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

只看該作者 · 發(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

只看該作者 · 發(fā)表于 2025-3-26 07:01:45

只看該作者 · 發(fā)表于 2025-3-26 09:02:53

只看該作者 · 發(fā)表于 2025-3-26 14:37:39

只看該作者 · 發(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

		自動登錄	找回密碼
密碼			To register

關于派博傳思			派博傳思旗下網站			友情鏈接
派博傳思介紹	公司地理位置	論文服務流程	影響因子官網	吾愛論文網	大講堂	北京大學	Oxford Uni.	Harvard Uni.
發(fā)展歷史沿革	期刊點評	投稿經驗總結	SCIENCEGARD	IMPACTFACTOR	派博系數	清華大學	Yale Uni.	Stanford Uni.
\|Archiver\|手機版\|小黑屋\| 派博傳思國際 ( 京公網安備110108008328) GMT+8, 2026-1-18 02:32
Copyright © 2001-2015 派博傳思京公網安備110108008328 版權所有 All rights reserved