Package-level declarations
Types
The conflicts between statements beyond those the theory declares (see the module conflict): the built-in ones as well (builtin: a literal and its negation, obligations and permissions), or none (declared, as in ABA, whose contraries are all declared)
The module building the argumentation graph: from the rules of the theory (ruleGraph), or from its arguments and attacks (abstractGraph). The profile of the theory sets it (see graphBuildMode); in the profile free, the solver and the theory do.
The languages extending the one of arg2p, each a module the parser asks for the premises and the conflicts its notation states, mapped to those of arg2p, and that checks the theory is written in it: abaLanguage (assumptions and contraries), defeasibleLanguage (defeasible rules alone), aspicLanguage (well-formed contraries), abstractLanguage (arguments and attacks alone). The profile of the theory attaches them.
How two sets of rules or premises are compared (see the module superiority)
Which rules and premises of two arguments their comparison weighs (see the module superiority)