MUS-based generation of arguments and counter-arguments

@article{Besnard2010MUSbasedGO,
  title={MUS-based generation of arguments and counter-arguments},
  author={Philippe Besnard and {\'E}ric Gr{\'e}goire and C{\'e}dric Piette and Badran Raddaoui},
  journal={2010 IEEE International Conference on Information Reuse & Integration},
  year={2010},
  pages={239-244}
}
Most of the approaches of computational argumentation define an argument as a pair consisting of premises and a conclusion, where the latter is entailed by the former. However, the matter of computing arguments and counter-arguments remains largely unsettled. We propose here a method to compute arguments and counter-arguments in the context of propositional logic, by using the concept of a MUS (Minimally Unsatisfiable Subset). The idea relies on the fact that reduction ad absurdum is valid in… CONTINUE READING
Highly Cited
This paper has 23 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.
15 Citations
10 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 10 references

A unified framework for hypothetical and practical reasoning ( 1 ) : Theoretical foundations Algorithms for effective argumentation in classical propositional logic : A connection graph approach

  • J. Fox S. K. Das, P. Krause
  • In FoIKS , volume 4932 of LNCS
  • 2008

Similar Papers

Loading similar papers…