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

一再

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




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




書目名稱Automated Reasoning網(wǎng)絡(luò)公開度




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




書目名稱Automated Reasoning被引頻次




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




書目名稱Automated Reasoning年度引用




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




書目名稱Automated Reasoning讀者反饋




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

話

尋找

BUST

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

mendacity

Lignans

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...

Gnrh670

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

obtuse

射手座

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

Control-Group