PARevisionOperator

java.lang.Object
- net.sf.tweety.arg.prob.dynamics.AbstractPAChangeOperator
- - net.sf.tweety.arg.prob.dynamics.PARevisionOperator

All Implemented Interfaces:

ChangeOperator
```
public class PARevisionOperator
extends AbstractPAChangeOperator
```
This operator implements a revision of some probabilistic assessment of arguments upon the observation of an argumentation theory. More specifically, for a given probabilistic semantics S, some norm N, a function f, and a partial probability assignment PPA, it computes the PPA-compliant prob-function that 1.) has minimal N-distance to S-prob'functions and 2.) maximizes function f.

Author:

Matthias Thimm

Constructor Summary

Constructors
Constructor	Description
`PARevisionOperator(PASemantics semantics, RealVectorNorm norm, SimpleRealValuedFunction f)`	Creates a new change operator for the given semantics that uses the specified norm for distance measuring and the given function for optimizing.

Method Summary

Modifier and Type	Method	Description
`ProbabilisticExtension`	`change(PartialProbabilityAssignment ppa, DungTheory theory)`	Given a partial probability assignment ppa and an argumentation theory, compute the closest probabilistic extension that is adequate for observing the theory in the state ppa.

Methods inherited from class net.sf.tweety.arg.prob.dynamics.AbstractPAChangeOperator
change

Methods inherited from class java.lang.Object
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

- Constructor Detail
  - PARevisionOperator
```
public PARevisionOperator(PASemantics semantics,
                          RealVectorNorm norm,
                          SimpleRealValuedFunction f)
```
    Creates a new change operator for the given semantics that uses the specified norm for distance measuring and the given function for optimizing.
    
    Parameters:
    
    semantics - the semantics used for change.
    
    norm - the norm used for distance measurement between probabilistic extensions.
    
    f - the function that is maximized on the set of probabilistic extensions with minimal distance.
- Method Detail
  - change
```
public ProbabilisticExtension change(PartialProbabilityAssignment ppa,
                                     DungTheory theory)
```
    Description copied from interface: ChangeOperator
    
    Given a partial probability assignment ppa and an argumentation theory, compute the closest probabilistic extension that is adequate for observing the theory in the state ppa.
    
    Specified by:
    
    change in interface ChangeOperator
    
    Specified by:
    
    change in class AbstractPAChangeOperator
    
    Parameters:
    
    ppa - some partial probability assignment.
    
    theory - some theory.
    
    Returns:
    
    the closest probabilistic extension that is adequate for observing the theory in the state ppa.