Language

The rules of a theory, as the graph builders read them.

ModulePredicatesDescription
parser23The rules of a theory, read by the graph builders (module parser): convertAllRules/1 converts the rules, premises, preferences and burdens of the theory, which classicRule/2,3 and the other predicates read
transposition1The transpositions of the strict rules (module transposition), with autoTransposition: for a strict rule r : a, b -> c, the rules concluding a contradictory of each premise from a contradictory of the conclusion and the other premises (r_i : -c, b -> -a, r_ii : -c, a -> -b)
conflict5The conflicts between statements (module conflict)
aspicLanguage3The language of ASPIC+ (module aspicLanguage, a graphLanguage of the profiles aspic_plus and aspic): the one of arg2p, well formed (Modgil and Prakken 2013)
abaLanguage3The language of assumption-based argumentation (module abaLanguage, a graphLanguage of the profile aba), mapped to the one of arg2p as flat ABA is an instance of ASPIC+ (Prakken 2010): each assumption (assumption(A)) an ordinary premise asm(A), each contrary (contrary(A, C)) the conflict of C with A, one way (an argument for C attacks those resting on A)
defeasibleLanguage3The defeasible part of the language of ASPIC+ (module defeasibleLanguage, a graphLanguage of the profile aspic_defeasible): defeasible rules alone, facts as rules with no premise (r : [] => a.)
abstractLanguage4The language of Dung frameworks (module abstractLanguage, the graphLanguage of the profile abstract): arguments and attacks alone, which the module abstractGraph reads