A Credal Least Undefined Stable Semantics for Probabilistic Logic Programs and Probabilistic Argumentation

Abstract

We present an approach to probabilistic logic programming and probabilistic argumentation that combines elements of the L-stable semantics and the credal semantics. We derive the complexity of inferences, propose an extended version of argumentation graphs with a semantics that maps to the L- stable semantics, and introduce a definition for the probability of an argument.