Modifier and Type | Class and Description |
---|---|
class |
ExecutableExtension
This class packs an extension into an executable object.
|
Modifier and Type | Class and Description |
---|---|
class |
AbaExtension<T extends Formula>
An set of assumptions.
|
Modifier and Type | Class and Description |
---|---|
class |
LdoInterpretation
This class models an LDO interpretation, i.e., a pair
of an argumentation framework and (possibly) an extension.
|
Modifier and Type | Class and Description |
---|---|
class |
AbstractArgumentationInterpretation
This abstract class acts as a common ancestor for interpretations to
abstract argumentation frameworks.
|
class |
ArgumentRanking
This abstract class is the common ancestor for semantical approaches to argument ranking, i.e.
|
class |
Labeling
This class models a labeling of an abstract argumentation framework, i.e.
|
class |
LatticeArgumentRanking
This class models argument ranking by representing the acceptability of arguments in
a graph-based structure.
|
class |
NumericalArgumentRanking
This class provides a acceptability interpretation of arguments by
assigning them real values where larger values indicate more acceptability.
|
class |
StratifiedLabeling
This class implements stratified labelings as in [Thimm, Kern-Isberner, 2013].
|
Modifier and Type | Class and Description |
---|---|
class |
SocialMapping<L>
Implements a mapping from arguments to social value.
|
Modifier and Type | Interface and Description |
---|---|
interface |
InterpretationIterator<S extends Formula,B extends BeliefBase,T extends Interpretation<B,S>>
An iterator over interpretations.
|
interface |
ModelProvider<S extends Formula,B extends BeliefBase,T extends Interpretation<B,S>>
Instances of this interface model reasoner that determine the (selected) models
for a given set of formulas.
|
Modifier and Type | Class and Description |
---|---|
class |
AbstractInterpretation<B extends BeliefBase,S extends Formula>
An abstract interpretation for some logical language.
|
class |
InterpretationSet<T extends Formula,B extends BeliefBase,S extends Formula>
This class models an interpretation that is a set of some formula and as such implements the
java.util.Collection interface.
|
Modifier and Type | Class and Description |
---|---|
class |
DrasticDistance<T extends Interpretation<B,S>,B extends BeliefBase,S extends Formula>
This class models the drastic distance measure between interpretations,
see [Grant, Hunter.
|
interface |
InterpretationDistance<T extends Interpretation<B,S>,B extends BeliefBase,S extends Formula>
Classes implementing this interface represent distance functions
between two interpretations.
|
Modifier and Type | Class and Description |
---|---|
class |
RankingFunction
A ranking function (or ordinal conditional function, OCF) that maps possible worlds
of a propositional language to integers.
|
Modifier and Type | Class and Description |
---|---|
class |
DHitInconsistencyMeasure<T extends Interpretation<B,S>,B extends BeliefBase,S extends Formula>
This class implements the d-hit inconsistency measure from [Grant, Hunter.
|
class |
DMaxInconsistencyMeasure<T extends Interpretation<B,S>,B extends BeliefBase,S extends Formula>
This class implements the d-max inconsistency measure from [Grant, Hunter.
|
class |
DSumInconsistencyMeasure<T extends Interpretation<B,S>,B extends BeliefBase,S extends Formula>
This class implements the d-sum inconsistency measure from [Grant, Hunter.
|
Modifier and Type | Field and Description |
---|---|
private InterpretationIterator<S,B,? extends Interpretation<B,S>> |
HsInconsistencyMeasure.it
Used for iterating over interpretations of the underlying language.
|
private InterpretationIterator<S,B,? extends Interpretation<B,S>> |
EtaInconsistencyMeasure.it
Used for enumerating the interpretations of the underlying language.
|
Modifier and Type | Method and Description |
---|---|
Interpretation<B,S> |
ConsistencyWitnessProvider.getWitness(BeliefSet<S> bs)
If the belief set is consistent this method
returns some model of it or, if it is inconsistent, null.
|
Interpretation<B,S> |
ConsistencyWitnessProvider.getWitness(java.util.Collection<S> formulas)
If the collection of formulas is consistent this method
returns some model of it or, if it is inconsistent, null.
|
Interpretation<B,S> |
ConsistencyWitnessProvider.getWitness(S formula)
If the formula is consistent this method
returns some model of it or, if it is inconsistent, null.
|
Modifier and Type | Method and Description |
---|---|
private java.util.Collection<Interpretation<B,S>> |
HsInconsistencyMeasure.getHittingSet(java.util.Collection<S> formulas,
int card,
java.util.Collection<Interpretation<B,S>> interpretations)
Determines a hitting set of the given cardinality.
|
Modifier and Type | Method and Description |
---|---|
private java.util.Collection<Interpretation<B,S>> |
HsInconsistencyMeasure.getHittingSet(java.util.Collection<S> formulas,
int card,
java.util.Collection<Interpretation<B,S>> interpretations)
Determines a hitting set of the given cardinality.
|
private boolean |
HsInconsistencyMeasure.isHittingSet(java.util.Collection<S> formulas,
java.util.Collection<Interpretation<B,S>> candidate)
Checks whether the given candidate is a hitting set.
|
Constructor and Description |
---|
EtaInconsistencyMeasure(InterpretationIterator<S,B,? extends Interpretation<B,S>> it)
Creates a new inconsistency measure that uses the interpretations given
by the given iterator.
|
HsInconsistencyMeasure(InterpretationIterator<S,B,? extends Interpretation<B,S>> it)
Creates a new inconsistency measure that uses the interpretations given
by the given iterator.
|
Modifier and Type | Class and Description |
---|---|
class |
HerbrandInterpretation
A Herbrand interpretation is an interpretation for a first-order signature,
stating all ground atoms that are true in the interpretation.
|
Modifier and Type | Class and Description |
---|---|
class |
KripkeModel
This class models a Kripke model, i.e.
|
class |
ModalHerbrandInterpretation
Modified version of HerbrandInterpretation that allows for modal formulas.
|
Modifier and Type | Field and Description |
---|---|
private java.util.Set<? extends Interpretation<FolBeliefSet,FolFormula>> |
KripkeModel.possibleWorlds
The possible worlds of this model.
|
private java.util.Set<Pair<Interpretation<FolBeliefSet,FolFormula>,Interpretation<FolBeliefSet,FolFormula>>> |
AccessibilityRelation.tuples
The actual relation
|
private java.util.Set<Pair<Interpretation<FolBeliefSet,FolFormula>,Interpretation<FolBeliefSet,FolFormula>>> |
AccessibilityRelation.tuples
The actual relation
|
Modifier and Type | Method and Description |
---|---|
java.util.Set<Interpretation<FolBeliefSet,FolFormula>> |
AccessibilityRelation.getNodes()
Returns all interpretations of the accessibility relation.
|
java.util.Set<Interpretation<FolBeliefSet,FolFormula>> |
AccessibilityRelation.getSuccessors(Interpretation<FolBeliefSet,FolFormula> i)
Returns all interpretations that are accessible to a given interpretation i.
|
Modifier and Type | Method and Description |
---|---|
java.util.Set<Interpretation<FolBeliefSet,FolFormula>> |
AccessibilityRelation.getSuccessors(Interpretation<FolBeliefSet,FolFormula> i)
Returns all interpretations that are accessible to a given interpretation i.
|
Modifier and Type | Method and Description |
---|---|
boolean |
ModalHerbrandInterpretation.satisfies(Formula formula,
java.util.Set<Interpretation<FolBeliefSet,FolFormula>> successors)
Checks whether this Herbrand interpretation satisfies
the given formula.
|
Constructor and Description |
---|
AccessibilityRelation(java.util.Set<Pair<Interpretation<FolBeliefSet,FolFormula>,Interpretation<FolBeliefSet,FolFormula>>> tuples)
Constructs a new accessibility relation.
|
AccessibilityRelation(java.util.Set<Pair<Interpretation<FolBeliefSet,FolFormula>,Interpretation<FolBeliefSet,FolFormula>>> tuples)
Constructs a new accessibility relation.
|
KripkeModel(java.util.Set<? extends Interpretation<FolBeliefSet,FolFormula>> possibleWorlds,
AccessibilityRelation accRelation)
Creates a new Kripke model.
|
Modifier and Type | Class and Description |
---|---|
class |
ProbabilityDistribution<T extends Interpretation<PlBeliefSet,PropositionalFormula>>
This class represents a probability distribution on some logical language
|
Modifier and Type | Class and Description |
---|---|
class |
ProbabilityDistribution<T extends Interpretation<PlBeliefSet,PropositionalFormula>>
This class represents a probability distribution on some logical language
|
Modifier and Type | Method and Description |
---|---|
static <S extends Interpretation<PlBeliefSet,PropositionalFormula>> |
ProbabilityDistribution.convexCombination(double[] factors,
ProbabilityDistribution<S>[] creators)
Computes the convex combination of the
given probability distributions P1,...,PN with parameters factors, i.e.
|
static <S extends Interpretation<PlBeliefSet,PropositionalFormula>> |
ProbabilityDistribution.getUniformDistribution(java.util.Set<S> interpretations,
Signature sig)
Returns the uniform distribution on the given interpretations.
|
Modifier and Type | Method and Description |
---|---|
Probability |
ProbabilityDistribution.probability(Interpretation<PlBeliefSet,PropositionalFormula> w)
Gets the probability of the given Herbrand interpretation (this is just an
alias for get(Object o).
|
Modifier and Type | Method and Description |
---|---|
Interpretation<PlBeliefSet,PropositionalFormula> |
SatSolver.getWitness(BeliefSet<PropositionalFormula> bs) |
Interpretation<PlBeliefSet,PropositionalFormula> |
Sat4jSolver.getWitness(java.util.Collection<PropositionalFormula> formulas) |
Interpretation<PlBeliefSet,PropositionalFormula> |
LingelingSolver.getWitness(java.util.Collection<PropositionalFormula> formulas) |
abstract Interpretation<PlBeliefSet,PropositionalFormula> |
SatSolver.getWitness(java.util.Collection<PropositionalFormula> formulas)
If the collection of formulas is consistent this method
returns some model of it or, if it is inconsistent, null.
|
Interpretation<PlBeliefSet,PropositionalFormula> |
SimpleDpllSolver.getWitness(java.util.Collection<PropositionalFormula> formulas) |
Interpretation<PlBeliefSet,PropositionalFormula> |
SatSolver.getWitness(PropositionalFormula formula) |
Modifier and Type | Class and Description |
---|---|
class |
FuzzyInterpretation
A fuzzy interpretation for propositional logic.
|
class |
NicePossibleWorld
Wrapper for the PossibleWorld providing better representation mechanisms, it knows all
the possible propositions (the signature) and therefore provides a complete representation that
maps a boolean to the Proposition.
|
class |
PossibleWorld
This class represents a possible world of propositional logic, i.e.
|
class |
PriestWorld
A three-valued interpretation for propositional logic from
Priest's three valued logic (3VL) [Priest, G.: Logic of paradox.
|
Modifier and Type | Class and Description |
---|---|
class |
RelationalRankingFunction
A relational ranking function (or relational ordinal conditional function, ROCF) that maps
Herbrand interpretations to integers.
|
Modifier and Type | Class and Description |
---|---|
class |
Extension
An extension of a default theory, i.e.
|
Modifier and Type | Class and Description |
---|---|
class |
RpclProbabilityDistribution<T extends Interpretation<FolBeliefSet,FolFormula>>
Objects of this class represent probability distributions on the interpretations
of an underlying first-order signature for a relational probabilistic conditional knowledge base.
|
Modifier and Type | Class and Description |
---|---|
class |
CondensedProbabilityDistribution
Instances of this class represent condensed probability distributions, rf.
|
class |
ReferenceWorld
Instances of this class represent reference worlds, i.e.
|
class |
RpclProbabilityDistribution<T extends Interpretation<FolBeliefSet,FolFormula>>
Objects of this class represent probability distributions on the interpretations
of an underlying first-order signature for a relational probabilistic conditional knowledge base.
|