atlas

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

Enhancing Lazy Grounding with Lazy Normalization in Answer-Set Programming

AAAI 2019 · Learning theory and algorithms › Combinatorial and search optimization · approach: Logic and answer set programming theory · 13 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
lazy normalization of count aggregates in a lazy-grounding solver instead of ground-and-solve (Clingo)Alpha · SimulationCPU time (s): size 100: 2.6 vs 0.8; size 500: 9.1 vs 110.5Mixed
lazy normalization of sum aggregates vs ClingoAlpha · SummationCPU time (s): 96.8 -> 3.0 at size 300Helped
lazy normalization vs Clingo/Dlv2 on indegree countingAlpha · Dynamic Indegree CountingCPU time (s): 12k: 36.5 vs 271.8 (Clingo), 9.6 (Dlv2)Mixed
lazy normalization vs ground-and-solve on aggregate with n-tuple domainAlpha · Exponential Space Saving, size 22memory: 2.06 GB -> 82 MBHelped
use sorting-network (odd-even) compact count normalization instead of counting grid (ablation)Alpha lazy normalization · count aggregate benchmarksperformanceHelped

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