atlas

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

Argumentation Frameworks with Strong and Weak Constraints: Semantics and Complexity

AAAI 2021 · Learning theory and algorithms › Combinatorial and search optimization · approach: Logic and answer set programming theory · 14 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
Add weak constraints and maximal-set selectionCAF · Credulous and skeptical acceptance under complete, stable, preferred, and semi-stable semanticscomplexity: typically increases the complexity of one level in the polynomial hierarchyMixed
Add strong constraintsAF · Credulous and skeptical acceptance under most semanticscomplexity: remains the same as for AFs in most casesNo clear effect
Restrict weak constraints to a linear orderWAF · Credulous and skeptical acceptancecomplexity: complexity generally decreases, though it is higher than that of CAFsHelped
Restrict constraints to denialsCAF · Preferred semantics, credulous acceptancecomplexity: ΠP₂-c -> NP-cHelped
Add weak denial constraintsNCAF · Credulous and skeptical acceptance under maximal-set semanticscomplexity: increases the complexity of one level in the polynomial hierarchyHurt

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