Struct DynamicPreferredSemanticsSolver 

pub struct DynamicPreferredSemanticsSolver<T>
where
    T: LabelType,
{ /* private fields */ }

A dynamic solver dedicated to the preferred semantics.

Implementations

impl<T> DynamicPreferredSemanticsSolver<T>

where T: LabelType,

pub fn new() -> Self

where T: LabelType,

Builds a new SAT based dynamic solver for the preferred semantics.

The underlying SAT solver is one returned by default_solver.

pub fn new_with_sat_solver_factory( solver_factory: Box<SatSolverFactoryFn>, ) -> Self

where T: LabelType,

Builds a new SAT based dynamic solver for the preferred semantics.

The SAT solver to use in given through the solver factory.

Trait Implementations

impl<T> CredulousAcceptanceComputer<T> for DynamicPreferredSemanticsSolver<T>

where T: LabelType,

fn are_credulously_accepted(&mut self, _args: &[&T]) -> bool

Checks the credulous acceptance of a disjunction of arguments.

fn are_credulously_accepted_with_certificate( &mut self, _args: &[&T], ) -> (bool, Option<Vec<&Argument<T>>>)

Checks the credulous acceptance of a disjunction of arguments, and provide a certificate if it is the case.

fn is_credulously_accepted(&mut self, arg: &T) -> bool

Checks the credulous acceptance of an argument.

fn is_credulously_accepted_with_certificate( &mut self, arg: &T, ) -> (bool, Option<Vec<&Argument<T>>>)

Checks the credulous acceptance of an argument, and provide a certificate if it is the case.

impl<T> Default for DynamicPreferredSemanticsSolver<T>

where T: LabelType,

fn default() -> Self

Returns the “default value” for a type.

impl<T> DynamicSolver<T> for DynamicPreferredSemanticsSolver<T>

where T: LabelType,

fn new_argument(&mut self, label: T)

Adds a new argument to the underlying AF.

fn remove_argument(&mut self, label: &T) -> Result<()>

Removes an argument from the underlying AF.

fn new_attack(&mut self, from: &T, to: &T) -> Result<()>

Adds an attack to the underlying AF.

fn remove_attack(&mut self, from: &T, to: &T) -> Result<()>

Removes an attack from the underlying AF.

impl<T> SkepticalAcceptanceComputer<T> for DynamicPreferredSemanticsSolver<T>

where T: LabelType,

fn are_skeptically_accepted_with_certificate( &mut self, args: &[&T], ) -> (bool, Option<Vec<&Argument<T>>>)

Checks the skeptical acceptance of a disjunction of arguments, and provide a certificate if it is the case.

fn are_skeptically_accepted(&mut self, args: &[&T]) -> bool

Checks the skeptical acceptance of a disjunction of arguments.

fn is_skeptically_accepted(&mut self, arg: &T) -> bool

Checks the skeptical acceptance of an argument.

fn is_skeptically_accepted_with_certificate( &mut self, arg: &T, ) -> (bool, Option<Vec<&Argument<T>>>)

Checks the skeptical acceptance of an argument, and provide a certificate if it is the case.