AI Paper Atlas

Research map / Learning theory and algorithms / Matrix and tensor methods

A Recursive Algorithm for Projected Model Counting

AAAI 2019 · Learning theory and algorithms › Matrix and tensor methods · approach: Randomized tensor decomposition algorithms · 17 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
use projMC (recursive disjunctive decomposition) instead of D4P (dSharpP with D4)projected model counting · 260 instances, 600sinstances solved: 140 -> 192Helped
use projMC instead of dSharpPprojected model counting · 260 instances, 600sinstances solved: 115 -> 192Helped
use projMC instead of #claspprojected model counting · 260 instances, 600sinstances solved: 94 -> 192Helped
use projMC instead of d2cprojected model counting · 260 instances, 600sinstances solved: 71 -> 192Helped
use projMC instead of D4P on random Boolean circuit instancesprojected model counting · circuit instancessolving timeMixed
use D4 instead of dSharp as underlying counter in dSharpP-style algorithm (D4P vs dSharpP)dSharpP · 260 instances, 600sinstances solved: 115 -> 140Helped
search for model maximizing clauses satisfied by existentially quantified literals to get fewer disjuncts (ablation)projMC · 260 instancesrunning timeNo clear effect

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy