Engine Interface#

The engine can be queried in two ways:

buildLabelSets.

build and prints (in the output and graph tabs) both the argument and statement labellings according to the provided theory. This predicate is also available in two others versions:

buildLabelSets(StatementIN, StatementOUT, StatementUND).

returning the statements labelling divided in the three sets IN, OUT and UND;

buildLabelSets([StatementIN, StatementOUT, StatementUND], [ArgumentIN, ArgumentOUT, ArgumentUND]).

returning both the statements and arguments labelling divided in the three sets IN, OUT and UND;

Alternatively, the framework can be queried with:

answerQuery(Goal, In, Out, Und).

allowing to query the engine about a given Goal. The result are collected in the In, Out, Und lists respectively.

Flags#

The resolution process behaviour can be adjusted through the use of these flags. Some of them are required in order to successfully complete the evaluation process. Note that, in the standalone version of the library, there is no need to put them in the target theory, but it is possible to manage them through the Arg Flags tab.

• graphBuildMode(MODE) [REQUIRED] to select the preferred way to build the argumentation graph starting from the statements. MODE can only assume the value standard_af.
• statementLabellingMode(MODE) [REQUIRED] to select the preferred way to execute the statement labelling. MODE can only assume the values:
  • statement
  • statement_pass_through
  • statement_binary
• argumentLabellingMode(MODE) [REQUIRED] to select the preferred way to execute the argument labelling. MODE can assume the values:
  • conflictfree — use the conflict-free semantics
  • admissible — use the admissible semantics
  • stronglyadmissible — use the strongly admissible semantics
  • grounded — use the grounded semantics
  • complete — use Dung’s complete semantics
  • preferred — use the preferred semantics
  • semistable — use the semi-stable semantics
  • stable — use the stable semantics
  • ideal — use the ideal semantics
  • eager — use the eager semantics
  • naive — use the naïve semantics
  • stage — use the stage semantics
  • cf2 — use the CF2 semantics
  • stage2 — use the stage2 semantics
  • bp_grounded — use the bp grounded semantics (Calegari and Sartor)
  • bp_grounded_partial — use the bp partial semantics (Calegari and Sartor)
  • bp_grounded_complete — use the bp complete semantics (Calegari and Sartor)
• graphExtension(MODE) to select the preferred way to handle preferences. If absent, preference handling is disabled.MODE can assume the values:
  • standardPref for ASPIC+ static preferences;
  • defeasiblePref for Dung’s model for defeasible preferences;
  • defeasibleAllPref for the enhanced Dung’s model enabling the use of all ASPIC+’s comparators;
• orderingPrinciple(MODE) [REQUIRED] to select the preferred way to choose the relevant parts of an argument in order to compare them. MODE can assume the values:
  • last
  • weakest
• orderingComparator(MODE) [REQUIRED] to select the comparison strategy to use in argument ranking. MODE can assume the values:
  • democrat
  • elitist
  • normal.
• queryMode to enable the structured evaluation in the answerQuery/4 predicate;
• autoTransposition to enable the automatic closure under transposition of the target theory;
• graphExtension(rebutRestriction) (Unrestricted Rebut in the IDE) to manage the rebut restriction constraint.
• graphExtension(bp) (Meta Bp in the IDE) to enable the meta evaluation for burden of persuasion. If enabled the bp preferences must be included directly inside rules (for example r : [] => bp(something). or r : [] => -bp(something).). It can be used with any semantic. In the IDE the flag is called Meta Bp.