AI Paper Atlas

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

Complexity Results and Algorithms for Extension Enforcement in Abstract Argumentation

AAAI 2016 · Learning theory and algorithms › Combinatorial and search optimization · approach: Logic and answer set programming theory · 60 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 the paper's CPLEX encoding instead of the Coste-Marquis et al. IP approachnon-strict stable enforcement · Random AF instancesruntimeNo clear effect
Switch solver from CPLEX to OpenWBO MaxSATnon-strict stable enforcement · Random AF instancesruntimeHurt
Switch solver from CPLEX to OpenWBO MaxSATstrict complete enforcement · Random AF instancesruntimeHelped
Use OpenWBO instead of CPLEXextension enforcement · Random AF instances, 900 s timeoutmedian runtime and timeoutsMixed
Apply CEGAR with OpenWBO and complete as base abstractionstrict preferred enforcement (second-level complete) · Random AF instancessolvability and median runtimeHelped

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