初学者 发表于 2025-3-28 17:02:57
http://reply.papertrans.cn/59/5882/588193/588193_41.pngEngulf 发表于 2025-3-28 19:55:27
Query Answering over Description Logic Ontologieseveloped. We overview here some of the key techniques developed in the last years for query answering over DL ontologies, ranging from rewriting based approaches for lightweight DLs, to tableaux algorithms, and techniques based on automata on infinite trees for very expressive DLs. The associated re争吵 发表于 2025-3-28 23:54:44
Relevant Closure: A New Form of Defeasible Reasoning for Description Logicsthe area of ontology debugging. Both Basic and Minimal Relevant Closure increase the inferential power of Rational Closure, giving back intuitive conclusions that cannot be obtained from Rational Closure. We analyse the properties and present algorithms for both Basic and Minimal Relevant Closure, aLiability 发表于 2025-3-29 03:47:41
LEG Networks for Ranking Functionss can be built for any conditional knowledge base and filled by local OCF that can be found by inductive reasoning. A global OCF is set up from the local ones, and it is shown that the global OCF is admissible with respect to the underlying knowledge base.宽大 发表于 2025-3-29 08:07:56
On the Expressiveness of the Interval Logic of Allen’s Relations Over Finite and Discrete Linear Ordders; then, we provide a complete set of definabilities for the HS modalities corresponding to the Allen’s relations ., ., ., ., and ., as well as the ones corresponding to their inverse relations. The only missing cases are those of the relations . and ..流动才波动 发表于 2025-3-29 13:57:17
Davide Bresolin,Emilio Muñoz-Velasco,Guido Sciavicco江湖骗子 发表于 2025-3-29 16:23:27
http://reply.papertrans.cn/59/5882/588193/588193_47.png男学院 发表于 2025-3-29 22:00:43
Henning Koehler,Uwe Leck,Sebastian Link,Henri Pradeperpetual 发表于 2025-3-30 00:45:20
http://reply.papertrans.cn/59/5882/588193/588193_49.png抚育 发表于 2025-3-30 06:03:47
Tran Cao Son,Enrico Pontelli,Chitta Baral,Gregory Gelfond