abaLanguage
Language · Kotlin object AbaLanguageModule · library prolog.argumentation.language.aba
The 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). Rules are the strict rules of arg2p.
- Calls: parser
| Predicate | Description |
|---|---|
premises/1 | The assumptions, as ordinary premises [asm(Assumption), Assumption] |
conflicts/1 | The contraries, as the conflicts conflict([Contrary], [Assumption]) |
check/0 | The theory is flat ABA: no defeasible rule, no ordinary premise (its premises are its assumptions, its facts strict), and no rule concluding an assumption |
premises/1
premises(-Premises)The assumptions, as ordinary premises [asm(Assumption), Assumption].
conflicts/1
conflicts(-Conflicts)The contraries, as the conflicts conflict([Contrary], [Assumption]).
check/0
checkThe theory is flat ABA: no defeasible rule, no ordinary premise (its premises are its assumptions, its facts strict), and no rule concluding an assumption.