Login / Signup

A Polynomial Algorithm for Merging Lightweight Ontologies in Possibility Theory Under Incommensurability Assumption.

Salem BenferhatZied BouraouiMa Thi ChauSylvain LagrueJulien Rossit
Published in: ICAART (2) (2017)
Keyphrases
  • lightweight
  • computational complexity
  • possibility theory
  • dynamic programming
  • probabilistic model
  • bayesian networks
  • machine learning
  • artificial intelligence
  • conditional independence