Abstract argumentation frameworks with strong and weak constraints
From MaRDI portal
Cites work
- A comparative study of some central notions of \(\mathit{ASPIC}^+\) and \textit{DeLP}
- A comprehensive study of argumentation frameworks with sets of attacking arguments
- A general account of argumentation with preferences
- A Generalization of Dung’s Abstract Framework for Argumentation: Arguing with Sets of Attacking Arguments
- A new approach for preference-based argumentation frameworks
- A reasoning model based on the production of acceptable arguments
- Abstract argumentation with conditional preferences
- An abstract, argumentation-theoretic approach to default reasoning
- Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory
- Coherence in finite argument systems.
- Complexity of semi-stable and stage semantics in argumentation frameworks
- Complexity results and algorithms for extension enforcement in abstract argumentation
- Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks
- Conflict-free and conflict-tolerant semantics for constrained argumentation frameworks
- Credulous acceptance in high-order argumentation frameworks with necessities: an incremental approach
- Epistemic argumentation framework: theory and computation
- Expressive power and complexity of partial models for disjunctive deductive databases
- Expressiveness of SETAFs and support-free ADFs under 3-valued semantics
- Graph theoretical structures in logic programs and default theories
- scientific article; zbMATH DE number 4174344 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 6902516 (Why is no real title available?)
- scientific article; zbMATH DE number 6934384 (Why is no real title available?)
- Incremental computation for structured argumentation over dynamic DeLP knowledge bases
- Logic Programming
- Logics in Artificial Intelligence
- Natural 3-valued logics—characterization and proof theory
- On acceptance conditions in abstract argumentation frameworks
- On measuring inconsistency in definite and indefinite databases with denial constraints
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games
- On the acceptance of loops in argumentation frameworks
- On the computational cost of disjunctive logic programming: Propositional case
- On the equivalence between logic programming semantics and argumentation semantics
- On the semantics of abstract argumentation frameworks: a logic programming approach
- Persuasion in Practical Argument Using Value-based Argumentation Frameworks
- Policy-based inconsistency management in relational databases
- Preference in Abstract Argumentation
- Preference-based argumentation: arguments supporting multiple values
- Preference-based inconsistency-tolerant query answering under existential rules
- Reasoning about preferences in argumentation frameworks
- Rich preference-based argumentation frameworks
- Solving Advanced Argumentation Problems with Answer Set Programming
- Solving set optimization problems by cardinality optimization with an application to argumentation
- The ASP system DLV2
- The expressive powers of stable models for bound and unbound DATALOG queries
- Two new weak constraint qualifications for mathematical programs with equilibrium constraints and applications
- Understanding the abstract dialectical framework
- Unfolding partiality and disjunctions in stable model semantics
- Using arguments for making and explaining decisions
- Weighted argument systems: basic definitions, algorithms, and complexity results
- What does it take to enforce an argument? Minimal change in abstract argumentation
Cited in
(3)
This page was built for publication: Abstract argumentation frameworks with strong and weak constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7028235)
