public class RankingFunction
extends net.sf.tweety.commons.AbstractInterpretation
| Modifier and Type | Field and Description |
|---|---|
static Integer |
INFINITY
Integer used to define infinity.
|
| Constructor and Description |
|---|
RankingFunction(net.sf.tweety.logics.pl.syntax.PropositionalSignature signature)
Creates a new ranking function mapping each
given interpretation to zero.
|
| Modifier and Type | Method and Description |
|---|---|
boolean |
equals(Object other) |
static boolean |
falsifies(net.sf.tweety.logics.pl.semantics.PossibleWorld w,
Conditional c)
Checks whether the given possible world w falsifies the given
conditional (B|A), i.e.
|
void |
forceStrictness(Set<net.sf.tweety.logics.pl.syntax.PropositionalFormula> formulas)
Sets the rank of every interpretation i that does not satisfy
the given set of formulas to RankingFunction.INFINITY.
|
Set<net.sf.tweety.logics.pl.semantics.PossibleWorld> |
getPossibleWorlds()
Returns all interpretations that are mapped to a rank
unequal to INFINITY.
|
net.sf.tweety.logics.pl.syntax.PropositionalSignature |
getSignature()
Returns the signature of the first-order language this ranking function
is defined on.
|
boolean |
isNormalized()
Checkes whether this OCF is normalized, i.e.
|
void |
normalize()
Normalizes this OCF, i.e.
|
Integer |
rank(net.sf.tweety.commons.Formula formula)
Gets the rank of the given formula.
|
Integer |
rank(net.sf.tweety.logics.pl.semantics.PossibleWorld w)
Gets the rank of the given possible world.
|
boolean |
satisfies(net.sf.tweety.commons.BeliefBase beliefBase) |
boolean |
satisfies(net.sf.tweety.commons.Formula formula) |
static boolean |
satisfies(net.sf.tweety.logics.pl.semantics.PossibleWorld w,
Conditional c)
Checks whether the given possible world w satisfies the given
conditional (B|A), i.e.
|
void |
setRank(net.sf.tweety.logics.pl.semantics.PossibleWorld w,
Integer value)
Sets the rank for the given possible world.
|
String |
toString() |
static boolean |
verifies(net.sf.tweety.logics.pl.semantics.PossibleWorld w,
Conditional c)
Checks whether the given possible world w verifies the given
conditional (B|A), i.e.
|
public static final Integer INFINITY
public RankingFunction(net.sf.tweety.logics.pl.syntax.PropositionalSignature signature)
signature - the signature of the language this ranking function
is defined on.public Integer rank(net.sf.tweety.logics.pl.semantics.PossibleWorld w) throws IllegalArgumentException
w - an possible world.IllegalArgumentException - if the given possible world has no
rank in this ranking function.public void setRank(net.sf.tweety.logics.pl.semantics.PossibleWorld w,
Integer value)
w - an possible world.value - the rank for the possible world.public boolean satisfies(net.sf.tweety.commons.Formula formula)
throws IllegalArgumentException
IllegalArgumentExceptionpublic boolean satisfies(net.sf.tweety.commons.BeliefBase beliefBase)
public void forceStrictness(Set<net.sf.tweety.logics.pl.syntax.PropositionalFormula> formulas)
formulas - a set of first-order formulas.public Integer rank(net.sf.tweety.commons.Formula formula) throws IllegalArgumentException
formula - a formula.IllegalArgumentException - if the languages of the formula does not correspond to the language of the
interpretations this ranking function is defined on.public void normalize()
public boolean isNormalized()
public Set<net.sf.tweety.logics.pl.semantics.PossibleWorld> getPossibleWorlds()
public net.sf.tweety.logics.pl.syntax.PropositionalSignature getSignature()
public static boolean verifies(net.sf.tweety.logics.pl.semantics.PossibleWorld w,
Conditional c)
w - a possible worldc - a conditional.public static boolean falsifies(net.sf.tweety.logics.pl.semantics.PossibleWorld w,
Conditional c)
w - a possible worldc - a conditional.public static boolean satisfies(net.sf.tweety.logics.pl.semantics.PossibleWorld w,
Conditional c)
w - a possible worldc - a conditional.Copyright © 2018. All rights reserved.