The Complexity of Inferences and Explanations in Probabilistic Logic Programming

  title={The Complexity of Inferences and Explanations in Probabilistic Logic Programming},
  author={Fabio Gagliardi Cozman and D. Mau{\'a}},
A popular family of probabilistic logic programming languages combines logic programs with independent probabilistic facts. We study the complexity of marginal inference, most probable explanations, and maximum a posteriori calculations for propositional/relational probabilistic logic programs that are acyclic/definite/stratified/normal/ disjunctive. We show that complexity classes \(\varSigma _k\) and \(\mathsf {PP}^{\varSigma _k}\) (for various values of k) and \(\mathsf {NP}^\mathsf {PP… 

Complexity results for probabilistic answer set programming

Languages for Probabilistic Modeling Over Structured and Relational Domains

In this chapter we survey languages that specify probability distributions using graphs, predicates, quantifiers, fixed-point operators, recursion, and other logical and programming constructs. Many

Modeling Markov Decision Processes with Imprecise Probabilities Using Probabilistic Logic Programming

A novel language is proposed that can capture MDPIPs and Markov Decision Processes with Set-valued Transitions (MDPSTs) and obtain the complexity of one-step inference for the resulting MDP IPs and MDP STs.



Probabilistic Graphical Models Specified by Probabilistic Logic Programs: Semantics and Complexity

Probabilistic logic programs as a specification language for probabilistic models is looked at, showing that they have the same complexity as acyclic probabilism logic programs, and that they can be depicted using chain graphs.

The Well-Founded Semantics of Cyclic Probabilistic Logic Programs : Meaning and Complexity

This paper investigates the properties of cyclic Probabilistic normal logic programs, consisting of rules and a set of independent probabilistic facts, under the well-founded semantics, and derives results concerning the complexity of inference.

Probabilistic Description Logic Programs

Probabilistic reasoning with answer sets

A declarative language, P-log, that combines logical and probabilistic arguments in its reasoning is developed and it is argued that the approach to updates is more appealing than existing approaches.

Inference and learning in probabilistic logic programs using weighted Boolean formulas

The results show that the inference algorithms improve upon the state of the art in probabilistic logic programming, and that it is indeed possible to learn the parameters of a probabilist logic program from interpretations.

On the computational cost of disjunctive logic programming: Propositional case

This paper shows that the consistency check is Σ2p-complete for the disjunctive stable model semantics, the iterated closed world assumption, and the perfect model semantics; analogous results are derived for the answer sets semantics of extendeddisjunctive logic programs.

Complexity and expressive power of logic programming

The main focus is on decidable forms of logic programming, in particular propositional logic programming and datalog, but the also mention general logic programming with function symbols, and the complexity of the unification problem is addressed.

Complexity results for answer set programming with bounded predicate arities and implications

This paper presents a language fragment in which the arities of predicates are bounded by a constant, and analyzes the complexity of various reasoning tasks and computational problems for this fragment, comprising answer set existence, brave and cautious reasoning, and strong equivalence.

The Structure and Complexity of Credal Semantics

It is shown 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), and how this result leads to inference algorithms and to an analysis of the complexity of inferences.