atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

ApproxASP – a Scalable Approximate Answer Set Counter

AAAI 2022 · Learning theory and algorithms › Combinatorial and search optimization · approach: Structure and complexity of constraint reasoning · 12 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 ApproxASP for approximate counting instead of clingo enumerationDisjunctive programs · Disjunctive programsinstances solved: 177 -> 185Helped
Use ApproxASP rather than ApproxMC after translating normal programs to SATNormal programs · Normal programsinstances solved: 1325 -> 1323No clear effect
Use the ApproxASP XOR solver with Gauss-Jordan elimination instead of xorroASP programs with XOR constraints · ASP+XOR programsruntimeHelped
Use ApproxASP approximate counts rather than exact countsASP programs · Selected instances with exact countsobserved tolerance: maximum value of εobs = 0.25; arithmetic mean of εobs = 0.037; theoretical guarantee is 0.8Helped

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