Coverage Summary for Class: Arg2pModule (it.unibo.tuprolog.argumentation.core.modules.entry)

 package it.unibo.tuprolog.argumentation.core.modules.entry
 
 import it.unibo.tuprolog.argumentation.core.modules.PrologModule
 import it.unibo.tuprolog.argumentation.core.modules.graph.language.ParserModule
 import it.unibo.tuprolog.core.operators.OperatorSet
 
 /**
  * The entry points of arg2p (module `arg2p`, loaded by every solver): the labels of the statements of the theory,
  * of the whole graph or of a query. solve/0,1,2,3 are the entry points; buildLabelSets/0,2,3 and answerQuery/1,2,4,
  * which they call, the older forms.
  */
 object Arg2pModule : PrologModule("prolog.argumentation.interface", "arg2p") {
     // The operators of the rules of a theory, for the theory of the interface and the solvers using it
     override val libraryOperators: OperatorSet
         get() = ParserModule.operators()
 
     override val theoryOperators: OperatorSet
         get() = super.theoryOperators.plus(ParserModule.operators())
 
     override val prologRawTheory: String =
         // language=Prolog
         """
         %! argTuProlog
         %  The solver is an arg2p one.
         argTuProlog.
 
         %! solve
         %  The labelling of the theory, in the context (buildLabelSets/0, without printing it).
         solve :- buildLabelSetsSilent.
         %! solve(+Query)
         %  answerQuery/1.
         solve(Query) :- answerQuery(Query).
         %! solve(+Query, -Result)
         %  answerQuery/2.
         solve(Query, Res) :- answerQuery(Query, Res).
         %! solve(-StatIn, -StatOut, -StatUnd)
         %  The statements of the theory labelled IN, OUT and UND, one solution for each labelling (buildLabelSets/3).
         solve(StatIn, StatOut, StatUnd) :- buildLabelSets(StatIn, StatOut, StatUnd).
 
         %! buildLabelSets(-StatementLabels, -ArgumentLabels)
         %  The statements and the arguments of the theory labelled IN, OUT and UND, as [In, Out, Und] lists.
         buildLabelSets([StatIn, StatOut, StatUnd], [ArgsIn, ArgsOut, ArgsUnd]) :-
             context_reset,
             parser:::convertAllRules(_),
             structuredWhole::computeGlobalAcceptance(_, [ArgsIn, ArgsOut, ArgsUnd], [StatIn, StatOut, StatUnd]).
 
         %! buildLabelSets(-StatIn, -StatOut, -StatUnd)
         %  The statements of the theory labelled IN, OUT and UND.
         buildLabelSets(StatIn, StatOut, StatUnd) :-
             buildLabelSets([StatIn, StatOut, StatUnd], _).
 
         %! buildLabelSets
         %  The labelling of the theory, printed: the graph, the labels of the arguments and those of the statements.
         buildLabelSets :-
             context_reset,
             parser:::convertAllRules(ArgRules),
             structuredWhole::computeGlobalAcceptance([Arguments, Attacks, Supports], [ArgsIn, ArgsOut, ArgsUnd], [StatIn, StatOut, StatUnd]),
             debug::printArgumentationGraph(Arguments, Attacks, Supports),
             debug::printArgumentLabelling([ArgsIn, ArgsOut, ArgsUnd]),
             debug::printStatementLabelling([StatIn, StatOut, StatUnd]).
 
         %! answerQuery(+Goal, -Yes, -No, -Und)
         %  The statements unifying with Goal labelled IN, OUT and UND: with queryMode only the part of the graph they depend on is built.
         answerQuery(Goal, Yes, No, Und) :-
             context_reset,
             parser:::convertAllRules(_),
             structuredPartial:::computeStatementAcceptance(Goal, Yes, No, Und).
 
         %! answerQuery(+Goal, -Result)
         %  The labels of the statements unifying with Goal, as in(S), out(S) and und(S) terms.
         answerQuery(Goal, Res) :-
             context_reset,
             parser:::convertAllRules(_),
             structuredPartial:::computeStatementAcceptance(Goal, Res).
 
         %! answerQuery(+Goal)
         %  Goal is a statement labelled IN.
         answerQuery(Goal) :-
             context_reset,
             parser:::convertAllRules(_),
             structuredPartial:::computeStatementAcceptance(Goal),
             graphStore::statementLabel(in, [Goal]).
 
         %! buildLabelSetsSilent
         %  The labelling of the theory, in the context.
         buildLabelSetsSilent :-
             context_reset,
             parser:::convertAllRules(ArgRules),
             structuredWhole::computeGlobalAcceptance.
         """.trimIndent()
 }