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

大雨

Possibilistic Boolean Games: Strategic Reasoning under Incomplete Informationsures from possibility theory to semantically define (solution concepts to) Boolean games with incomplete information. Then we present a syntactic characterization of these semantics, which can readily be implemented, and we characterize the computational complexity.

UNT

Error-Tolerant Reasoning in the Description Logic $mathcal{E{kern-.1em}L}$improving the reasoning times by precompiling information about the known errors and using proof-theoretic techniques for computing justifications. A prototypical implementation shows that our approach is feasible for large ontologies used in practice.

收養(yǎng)

Logical Foundations of Possibilistic Keystic keys can be visualized as possibilistic Armstrong relations, and how they can be discovered from given possibilistic relations. It is also shown how possibilistic keys can be used to clean dirty data by revising the belief in possibility degrees of tuples.

cancer