TĂtulo: Satisfiability in EL with sets of Probabilistic ABoxes


Palestrante: Marcelo Finger

Resumo:

This work studies a probabilistic  extension of the lightweight Description
Logic EL, called ELPA, that allows for probabilistic assessments on ABoxes. We
concentrate on the problem of verifying the satisfiability of an
ELPA-knowledge base, proposing algorithms for this problem based on recent
advances on probabilistic satisfiability (PSAT).