The structure and complexity of credal semantics

Fabio G. Cozman, Denis D. Mauá

Research output: Contribution to conferenceConference Paper

4 Scopus citations

Abstract

© 2016, CEUR-WS. All rights reserved. A flexible semantics has been proposed by Lukasiewicz for probabilistic logic programs where we have a normal logic program augmented with a set of independent probabilistic facts. That semantics, which we call credal semantics, is the set of all probability measures (over stable models) that are consistent with a total choice of probabilistic facts. When each total choice produces a definite program, credal semantics is identical to Sato's distribution semantics. However, credal semantics is also defined for programs with cycles and negations. We show that the credal semantics always defines a set containing the probability measures that dominate an infinite monotone Choquet capacity (also known as a belief function). We also show how this result leads to inference algorithms and to an analysis of the complexity of inferences.
Original languageAmerican English
Pages3-14
Number of pages12
StatePublished - 1 Jan 2016
Externally publishedYes
EventCEUR Workshop Proceedings -
Duration: 1 Jan 2016 → …

Conference

ConferenceCEUR Workshop Proceedings
Period1/01/16 → …

Fingerprint Dive into the research topics of 'The structure and complexity of credal semantics'. Together they form a unique fingerprint.

Cite this