ISBN 10 : 3659462160 ISBN 13 : 9783659462160
Langue: anglais
Vendeur : Books Puddle, New York, NY, Etats-Unis
EUR 40,78
Autre deviseQuantité disponible : 4 disponible(s)
Ajouter au panierEtat : New.
Edité par LAP Lambert Academic Publishing Mär 2015, 2015
ISBN 10 : 3659462160 ISBN 13 : 9783659462160
Langue: anglais
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
EUR 23,90
Autre deviseQuantité disponible : 2 disponible(s)
Ajouter au panierTaschenbuch. Etat : Neu. Neuware -Belief contraction in description logics in a syntax-independent manner is an important and nontrivial problem for ontology management and DL communities. One approach for belief contractions is to take all minimal sets that imply a formula to be contracted and delete one formula from each est, which is also called kernel contraction. In this book I make an investigation of kernel contraction in the description logics EL. I demonstrate that kernel contraction in EL is rational by proving some of its properties. Different ways to generating kernel contractions are presented. I also introduce some novel approaches such as localization and specificity to decide the preference between different certain kernel contractions by exploiting the structure of an EL knowledge base and I give algorithms for computing them.Books on Demand GmbH, Überseering 33, 22297 Hamburg 56 pp. Englisch.
Edité par LAP Lambert Academic Publishing Mrz 2015, 2015
ISBN 10 : 3659462160 ISBN 13 : 9783659462160
Langue: anglais
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
EUR 23,90
Autre deviseQuantité disponible : 2 disponible(s)
Ajouter au panierTaschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Belief contraction in description logics in a syntax-independent manner is an important and nontrivial problem for ontology management and DL communities. One approach for belief contractions is to take all minimal sets that imply a formula to be contracted and delete one formula from each est, which is also called kernel contraction. In this book I make an investigation of kernel contraction in the description logics EL. I demonstrate that kernel contraction in EL is rational by proving some of its properties. Different ways to generating kernel contractions are presented. I also introduce some novel approaches such as localization and specificity to decide the preference between different certain kernel contractions by exploiting the structure of an EL knowledge base and I give algorithms for computing them. 56 pp. Englisch.
ISBN 10 : 3659462160 ISBN 13 : 9783659462160
Langue: anglais
Vendeur : Majestic Books, Hounslow, Royaume-Uni
EUR 39,79
Autre deviseQuantité disponible : 4 disponible(s)
Ajouter au panierEtat : New. Print on Demand.
ISBN 10 : 3659462160 ISBN 13 : 9783659462160
Langue: anglais
Vendeur : Biblios, Frankfurt am main, HESSE, Allemagne
EUR 41,69
Autre deviseQuantité disponible : 4 disponible(s)
Ajouter au panierEtat : New. PRINT ON DEMAND.
Edité par LAP LAMBERT Academic Publishing, 2015
ISBN 10 : 3659462160 ISBN 13 : 9783659462160
Langue: anglais
Vendeur : moluna, Greven, Allemagne
EUR 22,32
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Liao ZhiweiFirst prize in 2006 China High School Mathematical Olympic.B.S. in Mathematics, Peking University.M.Sc. in Computer Science, Simon Fraser University.Co-Founder of Tubegether.Belief contraction in description logics in .
Edité par LAP Lambert Academic Publishing
ISBN 10 : 3659462160 ISBN 13 : 9783659462160
Langue: anglais
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
EUR 23,90
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierTaschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Belief contraction in description logics in a syntax-independent manner is an important and nontrivial problem for ontology management and DL communities. One approach for belief contractions is to take all minimal sets that imply a formula to be contracted and delete one formula from each est, which is also called kernel contraction. In this book I make an investigation of kernel contraction in the description logics EL. I demonstrate that kernel contraction in EL is rational by proving some of its properties. Different ways to generating kernel contractions are presented. I also introduce some novel approaches such as localization and specificity to decide the preference between different certain kernel contractions by exploiting the structure of an EL knowledge base and I give algorithms for computing them.