Guffaw
发表于 2025-3-21 18:04:33
书目名称Logics in Artificial Intelligence影响因子(影响力)<br> http://impactfactor.cn/if/?ISSN=BK0588193<br><br> <br><br>书目名称Logics in Artificial Intelligence影响因子(影响力)学科排名<br> http://impactfactor.cn/ifr/?ISSN=BK0588193<br><br> <br><br>书目名称Logics in Artificial Intelligence网络公开度<br> http://impactfactor.cn/at/?ISSN=BK0588193<br><br> <br><br>书目名称Logics in Artificial Intelligence网络公开度学科排名<br> http://impactfactor.cn/atr/?ISSN=BK0588193<br><br> <br><br>书目名称Logics in Artificial Intelligence被引频次<br> http://impactfactor.cn/tc/?ISSN=BK0588193<br><br> <br><br>书目名称Logics in Artificial Intelligence被引频次学科排名<br> http://impactfactor.cn/tcr/?ISSN=BK0588193<br><br> <br><br>书目名称Logics in Artificial Intelligence年度引用<br> http://impactfactor.cn/ii/?ISSN=BK0588193<br><br> <br><br>书目名称Logics in Artificial Intelligence年度引用学科排名<br> http://impactfactor.cn/iir/?ISSN=BK0588193<br><br> <br><br>书目名称Logics in Artificial Intelligence读者反馈<br> http://impactfactor.cn/5y/?ISSN=BK0588193<br><br> <br><br>书目名称Logics in Artificial Intelligence读者反馈学科排名<br> http://impactfactor.cn/5yr/?ISSN=BK0588193<br><br> <br><br>
rheumatology
发表于 2025-3-21 21:35:15
Non-classical Planning with a Classical Planner: The Power of Transformationsving given goals. The main challenges in planning are computational as all models, whether featuring uncertainty and feedback or not, are intractable in the worst case when represented in compact form. Classical planning refers to the simplest form of planning where goals are to be achieved by apply
ARENA
发表于 2025-3-22 01:47:19
http://reply.papertrans.cn/59/5882/588193/588193_3.png
猛然一拉
发表于 2025-3-22 07:52:41
http://reply.papertrans.cn/59/5882/588193/588193_4.png
单调性
发表于 2025-3-22 12:48:30
Tight Complexity Bounds for Reasoning in the Description Logic $mathcal{BE{kern-.1em}L}$depends on an uncertain context. In this paper we introduce a novel structure, called ., that encodes the contextual information required to deduce subsumption relations from a . knowledge base. Using this structure, we show that probabilistic reasoning in . can be reduced in polynomial time to stan
DAMN
发表于 2025-3-22 15:21:16
Relevant Closure: A New Form of Defeasible Reasoning for Description Logics turns out to have a number of desirable properties. Not only it is computationally feasible, but it can also be implemented using existing classical reasoners. One of its drawbacks is that it can be seen as too weak from the inferential point of view. To overcome this limitation we introduce in thi
Enthralling
发表于 2025-3-22 17:59:01
Error-Tolerant Reasoning in the Description Logic $mathcal{E{kern-.1em}L}$a corrected version of the ontology is available. In the meantime, one might still want to derive meaningful knowledge from the ontology, while avoiding the known errors. We study error-tolerant reasoning tasks in the description logic .. While these problems are intractable, we propose methods for
STRIA
发表于 2025-3-23 00:02:34
http://reply.papertrans.cn/59/5882/588193/588193_8.png
deciduous
发表于 2025-3-23 02:48:31
http://reply.papertrans.cn/59/5882/588193/588193_9.png
老巫婆
发表于 2025-3-23 05:52:41
Enumerating Prime Implicants of Propositional Formulae in Conjunctive Normal Formased on an encoding of the input formula as a new one whose models correspond to the set of prime implicants of the original theory. This first PI enumeration approach is then enhanced by an original use of the boolean functions or gates usually involved in many CNF instances encoding real-world pro