Titlebook: Logics in Artificial Intelligence; 14th European Confer Eduardo Fermé,Jo?o Leite Conference proceedings 2014 Springer International Publish

Guffaw

書目名稱Logics in Artificial Intelligence影響因子(影響力)




書目名稱Logics in Artificial Intelligence影響因子(影響力)學科排名




書目名稱Logics in Artificial Intelligence網(wǎng)絡(luò)公開度




書目名稱Logics in Artificial Intelligence網(wǎng)絡(luò)公開度學科排名




書目名稱Logics in Artificial Intelligence被引頻次




書目名稱Logics in Artificial Intelligence被引頻次學科排名




書目名稱Logics in Artificial Intelligence年度引用




書目名稱Logics in Artificial Intelligence年度引用學科排名




書目名稱Logics in Artificial Intelligence讀者反饋




書目名稱Logics in Artificial Intelligence讀者反饋學科排名

rheumatology

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

猛然一拉

單調(diào)性

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

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

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

deciduous

老巫婆

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