Pseudo Polynomial-Time Top-k Algorithms for d-DNNF Circuits

by   Pierre Bourhis, et al.

We are interested in computing k most preferred models of a given d-DNNF circuit C, where the preference relation is based on an algebraic structure called a monotone, totally ordered, semigroup (K, ⊗, <). In our setting, every literal in C has a value in K and the value of an assignment is an element of K obtained by aggregating using ⊗ the values of the corresponding literals. We present an algorithm that computes k models of C among those having the largest values w.r.t. <, and show that this algorithm runs in time polynomial in k and in the size of C. We also present a pseudo polynomial-time algorithm for deriving the top-k values that can be reached, provided that an additional (but not very demanding) requirement on the semigroup is satisfied. Under the same assumption, we present a pseudo polynomial-time algorithm that transforms C into a d-DNNF circuit C' satisfied exactly by the models of C having a value among the top-k ones. Finally, focusing on the semigroup (ℕ, +, <), we compare on a large number of instances the performances of our compilation-based algorithm for computing k top solutions with those of an algorithm tackling the same problem, but based on a partial weighted MaxSAT solver.




Computing Pareto-Optimal and Almost Envy-Free Allocations of Indivisible Goods

We study the problem of fair and efficient allocation of a set of indivi...

Computing a Data Dividend

Quality data is a fundamental contributor to success in statistics and m...

Pseudo-Polynomial Time Algorithm for Computing Moments of Polynomials in Free Semicircular Elements

We consider about calculating Mth moments of a given polynomial in free ...

Cyclotomic Identity Testing and Applications

We consider the cyclotomic identity testing (CIT) problem: given a polyn...

A Polynomial-Time Algorithm for Optimization of Quadratic Pseudo-Boolean Functions

We develop a polynomial-time algorithm to minimize pseudo-Boolean functi...

Quasi-polynomial Time Approximation of Output Probabilities of Constant-depth, Geometrically-local Quantum Circuits

We present a classical algorithm that, for any 3D geometrically-local, c...

Computing homotopy classes for diagrams

We present an algorithm that, given finite simplicial sets X, A, Y with ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.