Semi-stable semantics
From MaRDI portal
Recommendations
- An Algorithm for Computing Semi-stable Semantics
- Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks
- Abducible Semantics and Argumentation
- Complexity of semi-stable and stage semantics in argumentation frameworks
- Range-based argumentation semantics as two-valued models
Cited in
(45)- Semi-equilibrium models for paracoherent answer set programs
- Conflict-tolerant semantics for argumentation frameworks
- A postulate-driven study of logical argumentation
- Admissibility in Probabilistic Argumentation
- Normality, non-contamination and logical depth in classical natural deduction
- Design and results of the second international competition on computational models of argumentation
- A dialectical formalisation of preferred subtheories reasoning under resource bounds
- Simple contrapositive assumption-based argumentation. II: Reasoning with preferences
- A QBF-based formalization of abstract argumentation semantics
- An Algorithm for Computing Semi-stable Semantics
- Paracoherent answer set semantics meets argumentation frameworks
- ICCMA 2023: 5th international competition on computational models of argumentation
- Probabilistic abstract argumentation frameworks, a possible world view
- Characterizations of the stable semantics by partial evaluation
- A generalized proof-theoretic approach to logical argumentation based on hypersequents
- Simple contrapositive assumption-based argumentation frameworks
- Restricted semantics for default reasoning
- Simple contrapositive assumption-based argumentation frameworks with preferences: partial orders and collective attacks
- Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks
- Abstract argumentation and answer set programming: two faces of Nelson's logic
- Logical argumentation by dynamic proof systems
- Approximating problems in abstract argumentation with graph convolutional networks
- A claim-centric perspective on abstract argumentation semantics: claim-defeat, principles, and expressiveness
- A general approach to extension-based semantics in abstract argumentation
- Looking-ahead in backtracking algorithms for abstract argumentation
- Minimal hypotheses: extension-based semantics to argumentation
- Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory
- On rejected arguments and implicit conflicts: the hidden power of argumentation semantics
- On the complexity of probabilistic abstract argumentation frameworks
- Range-based argumentation semantics as two-valued models
- Abstract argument games via modal logic
- Characteristics of multiple viewpoints in abstract argumentation
- On a paraconsistentization functor in the category of consequence structures
- Improved answer-set programming encodings for abstract argumentation
- Ensuring reference independence and cautious monotony in abstract argumentation
- Normal and strong expansion equivalence for argumentation frameworks
- Structured argumentation dynamics. Undermining attacks in default justification logic
- Attack principles in sequent-based argumentation theory
- Necessary and sufficient conditions of the enforcement problem for various argumentation semantics
- Stability of weak second-order semantics
- Revisiting Semilattice Semantics
- An extension-based approach to belief revision in abstract argumentation
- Graded labellings for abstract argumentation
- Classical logic, argument and dialectic
- Weak argumentation semantics and unsafe odd cycles: results and a conjecture
This page was built for publication: Semi-stable semantics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3165758)
