Year:

Forthcoming articles
  1. Mare Koit & Haldur Õim (forthcoming). A Computational Model of Argumentation in Agreement Negotiation Processes. Argument and Computation:1-28.
    The paper describes a computational model that we have implemented in an experimental dialogue system. Communication in a natural language between two participants A and B is considered, where A has a communicative goal that his/her partner B will make a decision to perform an action D. A argues the usefulness, pleasantness, etc. of D, in order to guide B's reasoning in a desirable direction. A computational model of argumentation is developed, which includes reasoning. Our model is based on the (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  2. Tangming Yuan, Tim Kelly & Tianhua Xu (forthcoming). Computer-Assisted Safety Argument Review – a Dialectics Approach. Argument and Computation:1-19.
    There has been increasing use of argument-based approaches in the development of safety-critical systems. Within this approach, a safety case plays a key role in the system development life cycle. The key components in a safety case are safety arguments, which are designated to demonstrate that the system is acceptably safe. Inappropriate reasoning in safety arguments could undermine a system's safety claims which in turn contribute to safety-related failures of the system. The review of safety arguments is therefore a crucial (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  3. Martin Diller, Johannes Peter Wallner & Stefan Woltran (forthcoming). Reasoning in Abstract Dialectical Frameworks Using Quantified Boolean Formulas. Argument and Computation:1-29.
    dialectical frameworks constitute a recent and powerful generalisation of Dung's argumentation frameworks, where the relationship between the arguments can be specified via Boolean formulas. Recent results have shown that this enhancement comes with the price of higher complexity compared to AFs. In fact, acceptance problems in the world of ADFs can be hard even for the third level of the polynomial hierarchy. In order to implement reasoning problems on ADFs, systems for quantified Boolean formulas thus are suitable engines to be (...)
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
 Previous issues
  
Next issues