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

初学者

Engulf

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

争吵

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, a

Liability

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.

宽大

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

流动才波动

Davide Bresolin,Emilio Muñoz-Velasco,Guido Sciavicco

江湖骗子

男学院

Henning Koehler,Uwe Leck,Sebastian Link,Henri Prade

perpetual

抚育

Tran Cao Son,Enrico Pontelli,Chitta Baral,Gregory Gelfond