atlas

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

Treewidth-Aware Complexity in ASP: Not all Positive Cycles are Equally Hard

AAAI 2021 · Learning theory and algorithms › Combinatorial and search optimization · approach: SAT and model counting solvers · 9 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 largest SCC size ℓ alongside treewidth k, with λ=min({k,ℓ})HCF ASP consistency · HCF ASPruntime: 2^{\mathcal{O}(k\cdot \log(\lambda))} \cdot \poly(\Card{\text{\normalfont at}(\Pi)})Helped
Reduce HCF ASP to tight ASP using SCC-bounded global level mappingsHCF ASP · HCF ASP to tight ASPtreewidth: from k to \mathcal{O}(k\cdot\log(\ell))Helped
Reduce tight ASP to SAT using a treewidth-aware encodingTight ASP · Tight ASP to SATtreewidth: \mathcal{O}(k)Helped
Replace the HCF-to-tight reduction with any reduction achieving treewidth o(k·log(k))HCF ASP · HCF ASP to tight ASPtreewidth: o(k\cdot\log(k))Hurt

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