Using dispute tree approach, this project implements assumption-based argumentation and is able to compute the following semantics:
- Conflict-free: An argument is conflict-free iff it does not attack itself.
- Admissible: An argument is admissible iff it is conflict-free and attacks all arguments attacking it.
- Complete: An argument is complete iff it is admissible and contains all arguments it can defend (by attacking every arguments attacking them)
- Grounded: An argument is grounded iff it is minimally (with respect to set inclusion) complete.
- Stable: An argument is stable iff conflict-free and attacks every argument that does not belong to itself.
- Ideal: An argument is ideal iff admissible and there are no admissible arguments attacking it.
Syntax for input area consists of multiple lines of codes, where each line can only be a single type of expression. There are three types of expression supported in the project, namely:
supporting |- claim.
Supporting symbols (supporting) are comma-separated symbols, meanwhile claim can only contains one symbol. A symbol is a string of continuous string of characters. A valid rule has supporting symbols appeared in other supported symbols or assumptions.
Meaning that argument containing a as assumption can be attacked by argument with b as its claim.
Explicitly states that a is an assumption. Every assumption need to have its contrary.