Stable Model Counting and Its Application in Probabilistic Logic Programming

11/20/2014
by   Rehan Abdul Aziz, et al.
0

Model counting is the problem of computing the number of models that satisfy a given propositional theory. It has recently been applied to solving inference tasks in probabilistic logic programming, where the goal is to compute the probability of given queries being true provided a set of mutually independent random variables, a model (a logic program) and some evidence. The core of solving this inference task involves translating the logic program to a propositional theory and using a model counter. In this paper, we show that for some problems that involve inductive definitions like reachability in a graph, the translation of logic programs to SAT can be expensive for the purpose of solving inference tasks. For such problems, direct implementation of stable model semantics allows for more efficient solving. We present two implementation techniques, based on unfounded set detection, that extend a propositional model counter to a stable model counter. Our experiments show that for particular problems, our approach can outperform a state-of-the-art probabilistic logic programming solver by several orders of magnitude in terms of running time and space requirements, and can solve instances of significantly larger sizes on which the current solver runs out of time or memory.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/31/2017

On the Semantics and Complexity of Probabilistic Logic Programs

We examine the meaning and the complexity of probabilistic logic program...
research
09/18/1998

Stable models and an alternative logic programming paradigm

In this paper we reexamine the place and role of stable model semantics ...
research
05/16/2022

Efficient Knowledge Compilation Beyond Weighted Model Counting

Quantitative extensions of logic programming often require the solution ...
research
03/22/2019

A Model Counter's Guide to Probabilistic Systems

In this paper, we systematize the modeling of probabilistic systems for ...
research
08/08/2021

Planning for an Efficient Implementation of Hypothetical Bousi Prolog

This paper explores the integration of hypothetical reasoning into an ef...
research
12/22/2021

Lifting Symmetry Breaking Constraints with Inductive Logic Programming

Efficient omission of symmetric solution candidates is essential for com...
research
10/07/2018

A Minesweeper Solver Using Logic Inference, CSP and Sampling

Minesweeper as a puzzle video game and is proved that it is an NPC probl...

Please sign up or login with your details

Forgot password? Click here to reset