The following pages link to How to reason defeasibly (Q1199924):
Displaying 46 items.
- OSCAR (Q38059) (← links)
- Generating possible intentions with constrained argumentation systems (Q433517) (← links)
- Valued preference-based instantiation of argumentation frameworks with varied strength defeats (Q465598) (← links)
- Postulates for logic-based argumentation systems (Q465599) (← 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 and complexity results for persuasive argumentation (Q646518) (← links)
- Epistemic entrenchment and arithmetical hierarchy (Q685538) (← links)
- A new approach for preference-based argumentation frameworks (Q766045) (← links)
- The logicist manifesto: At long last let logic-based artificial intelligence become a field unto itself (Q959049) (← links)
- On the evaluation of argumentation formalisms (Q1028909) (← links)
- Argumentation in artificial intelligence (Q1028943) (← links)
- On principle-based evaluation of extension-based argumentation semantics (Q1028948) (← links)
- Reaching agreements through argumentation: a logical model and implementation (Q1274675) (← links)
- Justification and defeat (Q1329366) (← links)
- Deontic logic as founded on nonmonotonic logic (Q1353848) (← links)
- Dynamic reasoning with qualified syllogisms (Q1402719) (← links)
- Abstract argumentation systems (Q1402750) (← links)
- Extending abstract argumentation systems theory (Q1575701) (← links)
- Inductive inference and argumentation methods in modern intelligent decision support systems (Q1742432) (← links)
- Deductive argumentation by enhanced sequent calculi and dynamic derivations (Q1744402) (← 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)
- Minimal hypotheses: extension-based semantics to argumentation (Q1928824) (← links)
- A generalized proof-theoretic approach to logical argumentation based on hypersequents (Q2021565) (← links)
- A review of the relations between logical argumentation and reasoning with maximal consistency (Q2294581) (← links)
- On three-valued acceptance conditions of abstract dialectical frameworks (Q2333663) (← links)
- An argumentation system for defeasible reasoning (Q2409094) (← links)
- Logical argumentation by dynamic proof systems (Q2424889) (← links)
- A QBF-based formalization of abstract argumentation semantics (Q2446545) (← links)
- A neural cognitive model of argumentation with application to legal inference and decision making (Q2447172) (← links)
- SCC-recursiveness: a general schema for argumentation semantics (Q2457654) (← links)
- Self-stabilizing defeat status computation: dealing with conflict management in multi-agent systems (Q2457665) (← links)
- A formal account of Socratic-style argumentation (Q2480967) (← links)
- Abductive inference in defeasible reasoning: a model for research programmes (Q2565607) (← links)
- Backdoors to Satisfaction (Q2908542) (← links)
- Building an Epistemic Logic for Argumentation (Q2915085) (← links)
- Handling controversial arguments (Q3400791) (← links)
- The Logical Handling of Threats, Rewards, Tips, and Warnings (Q3524933) (← links)
- Argumentation through a distributed self-stabilizing approach (Q4808099) (← links)
- An Approach to Human-Level Commonsense Reasoning (Q4912992) (← links)
- I don’t care, I don’t know … I know too much! On Incompleteness and Undecidedness in Abstract Argumentation (Q5172620) (← links)
- Evaluation of arguments in weighted bipolar graphs (Q5915677) (← links)
- Cost-bounded argumentation (Q5932223) (← links)
- A logic-based theory of deductive arguments (Q5941137) (← links)
- Belief revision and computational argumentation: a critical comparison (Q6097772) (← links)
