Class DeductiveArgumentation
java.lang.Object
org.tweetyproject.arg.bipolar.examples.DeductiveArgumentation
Demonstrates the construction of deductive argumentation frameworks and the computation of their extensions.
This example uses the Deductive Argumentation Framework to create an argumentation framework, add arguments and relationships, and then compute various types of extensions. The example framework and its associated Dung theory are used to compute extensions using different reasoners.
The example is based on the work by Cayrol and Lagasquie-Schiex on bipolarity in argumentation graphs.
-
Constructor Summary
ConstructorDescriptionDefault constructor for theDeductiveArgumentation
class. -
Method Summary
-
Constructor Details
-
DeductiveArgumentation
public DeductiveArgumentation()Default constructor for theDeductiveArgumentation
class. Initializes an instance of this class, though it currently has no specific initialization logic.
-
-
Method Details
-
main
The entry point of the example program. Constructs a deductive argumentation framework, adds arguments, attacks, and supports, and computes various types of extensions using different reasoners.The following steps are performed in the main method:
- Create a
DeductiveArgumentationFramework
instance. - Add four arguments to the framework.
- Add one attack and two support relationships between the arguments.
- Obtain the associated Dung theory and meta-framework for the deductive argumentation framework.
- Set the default SAT solver to
Sat4jSolver
. - Compute and print the closed extensions and safe extensions using the
ClosureReasoner
andSafetyReasoner
. - Compute and print the preferred, grounded, and stable extensions for the Dung theory using the
SimplePreferredReasoner
,SimpleGroundedReasoner
, andSimpleStableReasoner
. - Compute and print the complete extensions for both the Dung theory and the meta-framework using the
SimpleCompleteReasoner
.
- Parameters:
args
- command-line arguments (not used)
- Create a
-