Pages that link to "Item:Q2457643"

The following pages link to Dialectic proof procedures for assumption-based, admissible argumentation (Q2457643):

Displaying 21 items.

• Argument graphs and assumption-based argumentation (Q253995) (← links)
• Normal and strong expansion equivalence for argumentation frameworks (Q359982) (← links)
• Toward incremental computation of argumentation semantics: a decomposition-based approach (Q360248) (← links)
• A general framework for sound assumption-based argumentation dialogues (Q460606) (← links)
• Uses and computation of imprecise probabilities from statistical data and expert arguments (Q505254) (← links)
• Instantiating abstract argumentation with classical logic arguments: postulates and properties (Q646494) (← links)
• Algorithms for generating arguments and counterarguments in propositional logic (Q648354) (← links)
• Dynamics of argumentation systems: a division-based method (Q650522) (← links)
• Semantic-based construction of arguments: an answer set programming approach (Q899190) (← links)
• An argument-based approach to reasoning with clinical knowledge (Q990964) (← links)
• Evaluating dialectical structures (Q1025574) (← links)
• Audiences in argumentation frameworks (Q1028897) (← links)
• Argumentation in artificial intelligence (Q1028943) (← links)
• Computing ideal sceptical argumentation (Q1028947) (← links)
• Computational properties of argument systems satisfying graph-theoretic constraints (Q1028949) (← links)
• The computational complexity of ideal semantics (Q1045987) (← links)
• Encoding deductive argumentation in quantified Boolean formulae (Q1045994) (← links)
• Inference procedures and engine for probabilistic argumentation (Q1678421) (← links)
• Fundamental properties of attack relations in structured argumentation with priorities (Q1693566) (← links)
• Labellings for assumption-based and abstract argumentation (Q2406908) (← links)
• Approved Models for Normal Logic Programs (Q3498486) (← links)