Pages that link to "Item:Q4444965"
From MaRDI portal
The following pages link to Properties and Complexity of Some Formal Inter-agent Dialogues (Q4444965):
Displayed 22 items.
- A general framework for sound assumption-based argumentation dialogues (Q460606) (← links)
- How to deal with unbelievable assertions (Q524943) (← links)
- Instantiating abstract argumentation with classical logic arguments: postulates and properties (Q646494) (← links)
- Algorithms and complexity results for persuasive argumentation (Q646518) (← links)
- Algorithms for generating arguments and counterarguments in propositional logic (Q648354) (← links)
- Argumentation in artificial intelligence (Q1028943) (← links)
- An executable specification of a formal argumentation protocol (Q1028953) (← links)
- The carneades model of argument and burden of proof (Q1028962) (← links)
- Encoding deductive argumentation in quantified Boolean formulae (Q1045994) (← links)
- A characterization of types of support between structured arguments and their relationship with support in abstract argumentation (Q1748533) (← links)
- Augmenting tractable fragments of abstract argumentation (Q1761284) (← links)
- Computational complexity of flat and generic assumption-based argumentation, with and without probabilities (Q2238615) (← links)
- Self-stabilizing defeat status computation: dealing with conflict management in multi-agent systems (Q2457665) (← links)
- Towards Verification of Dialogue Protocols: A Mathematical Model (Q2814138) (← links)
- Backdoors to Satisfaction (Q2908542) (← links)
- Complexity Classifications for Logic-Based Argumentation (Q2946726) (← links)
- Logical limits of abstract argumentation frameworks (Q4583317) (← links)
- Argumentation Framework Based on Evidence Theory (Q5117214) (← links)
- Approximating agreements in formal argumentation dialogues1 (Q5145459) (← links)
- A Generalization of Dung’s Abstract Framework for Argumentation: Arguing with Sets of Attacking Arguments (Q5385341) (← links)
- A Persuasion Dialog for Gaining Access to Information (Q5385615) (← links)
- Parameterized Complexity of Logic-based Argumentation in Schaefer’s Framework (Q6116364) (← links)