atlas

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

Solving Advanced Argumentation Problems with Answer-Set Programming

AAAI 2017 · Learning theory and algorithms › Combinatorial and search optimization · approach: Logic and answer set programming theory · 16 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 single-call dynamic ASP encoding (YADF) instead of DIAMOND static encoding for preferred semanticsADF skeptical reasoning under preferred semantics · Gri-30mean runtime (s): 51.48 -> 1.76Helped
use YADF instead of QADF for skeptical preferred reasoningADF reasoning · Gri-30mean runtime (s): 497.4 -> 1.76Helped
use YADF instead of DIAMOND/QADF for credulous admissible reasoning on small gridsADF reasoning · Gri-10mean runtime (s): 0.11 -> 0.66No clear effect
use YADF instead of DIAMOND for credulous admissible reasoning on metro instancesADF reasoning · Metromean runtime (s): 5.7 -> 1.6Helped
use YADF instead of DIAMOND for credulous reasoning on very dense random graphsADF reasoning · dense random graphsruntimeHurt

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