Issues of feasibility, coherence, and robustness in a premise-to-claim model of argumentation: Result from four experiments

DOI10.1016/S0377-2217(00)00186-7zbMath0988.90541OpenAlexW2067314349MaRDI QIDQ5943561

John A. A. Sillince, Masoud H. Saeedi

Publication date: 8 July 2002

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(00)00186-7

zbMATH Keywords

algorithmpremise-to-claim model of augmentation

Mathematics Subject Classification ID

Operations research and management science (90B99)

Cites Work

• Unnamed Item
• A logical notion of conditional independence: properties and applications
• Speeding up inferences using relevance reasoning: a formalism and algorithms
• Policy as Argument—A Logic for Ill-Structured Decision Problems
• A FORMAL MODEL OF ORGANIZATIONAL ARGUMENTATION: APPLICATIONS OF INFORMAL LOGIC TO A COMMITTEE MEETING

This page was built for publication: Issues of feasibility, coherence, and robustness in a premise-to-claim model of argumentation: Result from four experiments