AI Paper Atlas

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

Deciding Acceptance in Incomplete Argumentation Frameworks

Andreas Niskanen, Daniel Neugebauer, Matti Järvisalo, Jörg Rothe

AAAI 2020 · Learning theory and algorithms › Combinatorial and search optimization · approach: Logic and answer set programming theory · 15 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (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
replace trivial refinement with strong refinement based on redundant atomic changes (ablation)CEGAR for AD-nonempty PEXSA · ICCMA 2017 set A, general IAFs p=0.2timeouts (of 350): 225/350 -> 104/350Improved
replace trivial refinement with strong refinement (ablation)CEGAR for AD-nonempty PEXSA · ICCMA 2017 set A, general IAFs p=0.2mean runtime on solved instances (s): 39.6 -> 24.3 secondsImproved
increase incompleteness probability p in NP-level SAT encodingsAD-PCA, ST-PCA, AD-nonempty NSA, ST-NSA · ICCMA 2017 set Bmean runtimeNo clear effect
introduce uncertainty (increase p) for second-level CEGAR problemsAD-nonempty PEXSA and ST-PEXSA · ICCMA 2017 set Amean runtimeHurt

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