Titlebook: Automated Reasoning; First International Rajeev Goré,Alexander Leitsch,Tobias Nipkow Conference proceedings 2001 Springer-Verlag Berlin He

只看該作者 · 發(fā)表于 2025-3-21 18:50:10

書(shū)目名稱Automated Reasoning影響因子(影響力)

書(shū)目名稱Automated Reasoning影響因子(影響力)學(xué)科排名

書(shū)目名稱Automated Reasoning網(wǎng)絡(luò)公開(kāi)度

書(shū)目名稱Automated Reasoning網(wǎng)絡(luò)公開(kāi)度學(xué)科排名

書(shū)目名稱Automated Reasoning被引頻次

書(shū)目名稱Automated Reasoning被引頻次學(xué)科排名

書(shū)目名稱Automated Reasoning年度引用

書(shū)目名稱Automated Reasoning年度引用學(xué)科排名

書(shū)目名稱Automated Reasoning讀者反饋

書(shū)目名稱Automated Reasoning讀者反饋學(xué)科排名

只看該作者 · 發(fā)表于 2025-3-21 21:49:18

只看該作者 · 發(fā)表于 2025-3-22 01:22:33

只看該作者 · 發(fā)表于 2025-3-22 04:42:02

The Description Logic ,,, Extended with Concrete Domains: A Practically Motivated Approachestrictions, role hierarchies, transitively closed roles, generalized concept inclusions, and concrete domains. As in other languages based on concrete domains (e.g. . a so-called existential predicate restriction is provided. However, compared to . only features and no feature chains are allowed in

只看該作者 · 發(fā)表于 2025-3-22 11:26:54

只看該作者 · 發(fā)表于 2025-3-22 16:25:30

Exploiting Pseudo Models for TBox and ABox Reasoning in Expressive Description Logicsnd ABox reasoning for the description logics ALCNH.. and ALC(D). The advances are demonstrated by an empirical analysis using the description logic system RACE that implmenets TBox and ABox reasoning for ALCNH...

只看該作者 · 發(fā)表于 2025-3-22 19:47:13

The Hybrid μ-Calculusevising a new, highly expressive ExpTime logic. The decision procedure is based on tree automata, and makes explicit the problems caused by nominals and how to overcome them. Roughly speaking, we show how to reason in a logic lacking the tree model property using techniques for logics with the tree

只看該作者 · 發(fā)表于 2025-3-23 00:16:42

只看該作者 · 發(fā)表于 2025-3-23 02:21:46

Tableaux for Temporal Description Logic with Constant DomainsPTL (with the temporal operators ‘next-time’ and ‘until’) in order to design a terminating sound and complete tableau- based satisfiability-checking algorithm for the temporal description logic PTL. of [.] interpreted in models with constant domains. We use the method of quasimodels [.,.] to represe

只看該作者 · 發(fā)表于 2025-3-23 07:36:03

		自動(dòng)登錄	找回密碼
密碼			To register

關(guān)于派博傳思			派博傳思旗下網(wǎng)站			友情鏈接
派博傳思介紹	公司地理位置	論文服務(wù)流程	影響因子官網(wǎng)	吾愛(ài)論文網(wǎng)	大講堂	北京大學(xué)	Oxford Uni.	Harvard Uni.
發(fā)展歷史沿革	期刊點(diǎn)評(píng)	投稿經(jīng)驗(yàn)總結(jié)	SCIENCEGARD	IMPACTFACTOR	派博系數(shù)	清華大學(xué)	Yale Uni.	Stanford Uni.
\|Archiver\|手機(jī)版\|小黑屋\| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-16 21:07
Copyright © 2001-2015 派博傳思京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved