On the public citation graph

Extension Enforcement under Grounded Semantics in Abstract Argumentation

https://doi.org/10.34726/1842
0 signed · 30 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-0-387-98197-0_5openalex-snapshot
Complexity of Abstract Argumentation
inferredcites →https://doi.org/10.1007/978-3-319-28460-6_13openalex-snapshot
Persistence and Monotony Properties of Argumentation Semantics
inferredcites →https://doi.org/10.1007/978-3-319-40970-2_34openalex-snapshot
LMHS: A SAT-IP Hybrid MaxSAT Solver
inferredcites →https://doi.org/10.1007/978-3-319-48758-8_25openalex-snapshot
Pakota: A System for Enforcement in Abstract Argumentation
inferredcites →https://doi.org/10.1007/978-3-642-39071-5_13openalex-snapshot
Exploiting the Power of mip Solvers in maxsat
inferredcites →https://doi.org/10.1016/0004-3702(94)00041-xopenalex-snapshot
On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games
inferredcites →https://doi.org/10.1016/j.ijar.2017.11.013openalex-snapshot
An extension-based approach to belief revision in abstract argumentation
inferredcites →https://doi.org/10.1016/s0304-3975(96)00004-7openalex-snapshot
Graph theoretical structures in logic programs and default theories
inferredcites →https://doi.org/10.1017/s0269888911000166openalex-snapshot
An introduction to argumentation semantics
inferredcites →https://doi.org/10.1080/19462166.2010.486479openalex-snapshot
Answer-set programming encodings for argumentation frameworks
inferredcites →https://doi.org/10.1145/876638.876643openalex-snapshot
Counterexample-guided abstraction refinement for symbolic model checking
inferredcites →https://doi.org/10.1613/jair.2965openalex-snapshot
Change in Abstract Argumentation Frameworks: Adding an Argument
inferredcites →https://doi.org/10.1613/jair.5415openalex-snapshot
Complexity Results and Algorithms for Extension Enforcement in Abstract Argumentation
inferredcites →https://doi.org/10.2200/s00457ed1v01y201211aim019openalex-snapshot
Answer Set Solving in Practice
inferredcites →https://doi.org/10.3233/978-1-60750-619-5-75openalex-snapshot
Expanding Argumentation Frameworks: Enforcing and Monotonicity Results
inferredcites →https://doi.org/10.3233/978-1-61499-098-7-127openalex-snapshot
What Does it Take to Enforce an Argument? Minimal Change in abstract Argumentation
inferredcites →https://doi.org/10.3233/sat190091openalex-snapshot
QMaxSAT: A Partial Max-SAT Solver
inferredcites →https://doi.org/10.4230/oasics.iclp.2016.2openalex-snapshot
Theory Solving Made Easy with Clingo 5
inferredcites →https://doi.org/10.65109/kkog4162openalex-snapshot
Dynamics in argumentation with single extensions: attack refinement and the grounded extension

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1016/j.artint.2021.103470openalex-snapshot
Acceptance in incomplete argumentation frameworks
inferred← citeshttps://doi.org/10.1080/11663081.2022.2144830openalex-snapshot
A Bayesian approach to forward and inverse abstract argumentation problems
inferred← citeshttps://doi.org/10.1609/aaai.v34i03.5686openalex-snapshot
Deciding Acceptance in Incomplete Argumentation Frameworks
inferred← citeshttps://doi.org/10.1609/aaai.v35i7.16768openalex-snapshot
Argumentation Frameworks with Strong and Weak Constraints: Semantics and Complexity
inferred← citeshttps://doi.org/10.1609/aaai.v36i5.20497openalex-snapshot
Enforcement Heuristics for Argumentation with Deep Reinforcement Learning
inferred← citeshttps://doi.org/10.1609/aaai.v38i9.28910openalex-snapshot
Complexity of Credulous and Skeptical Acceptance in Epistemic Argumentation Framework
inferred← citeshttps://doi.org/10.1613/jair.1.13603openalex-snapshot
Recursion in Abstract Argumentation is Hard --- On the Complexity of Semantics Based on Weak Admissibility
inferred← citeshttps://doi.org/10.24963/kr.2021/74openalex-snapshot
On the Maximal Number of Complete Extensions in Abstract Argumentation Frameworks
inferred← citeshttps://doi.org/10.24963/kr.2023/9openalex-snapshot
Forgetting Aspects in Assumption-Based Argumentation
inferred← citeshttps://doi.org/10.3233/faia230256openalex-snapshot
Complexity of Verification and Existence Problems in Epistemic Argumentation Framework
inferred← citeshttps://doi.org/10.48550/arxiv.1909.04319openalex-snapshot
A Bayesian Approach to Direct and Inverse Abstract Argumentation Problems
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.