Modifier and Type | Class and Description |
---|---|
class |
ActionDescription<T extends CausalLaw>
This class represents an action description as a set of causal laws.
|
class |
CActionDescription
This class represents an action description for the action language C as a
set of causal rules, and provides some basic functionality such as grounding.
|
Modifier and Type | Method and Description |
---|---|
boolean |
SActionQuerySatisfactionTester.isSatisfied(TransitionSystem transitionSystem,
BeliefBase actionQueries) |
boolean |
ActionQuerySatisfactionTester.isSatisfied(TransitionSystem transitionSystem,
BeliefBase actionQuery)
Checks whether the given transition system satisfies the given action
queries.
|
Modifier and Type | Class and Description |
---|---|
class |
ActionQuerySet<T extends ActionQuery>
An Action Query Set consists of action queries in a specific query language
and provides some common functionalities for such queries.
|
class |
SActionQuerySet
This class models a set of action queries in the language S which is based on
the query language "P" discussed in the paper: Action Languages.
|
Modifier and Type | Class and Description |
---|---|
class |
ExecutableDungTheory
This class packs a Dung theory into an executable object.
|
Modifier and Type | Class and Description |
---|---|
class |
PerceivableStructuredArgumentationFramework
This class packs a structured argumentation framework into a
perceivable object.
|
Modifier and Type | Field and Description |
---|---|
private Parser<? extends BeliefBase> |
ABAParser.formulaparser
Used to parse formulae
|
Constructor and Description |
---|
ABAParser(Parser<? extends BeliefBase> formulaparser)
Create a new ABA parser
|
Modifier and Type | Class and Description |
---|---|
class |
ABATheory<T extends Formula> |
Modifier and Type | Field and Description |
---|---|
private Parser<? extends BeliefBase> |
AspicParser.formulaparser
Used to parse formulae
|
Constructor and Description |
---|
AspicParser(Parser<? extends BeliefBase> formulaparser,
RuleFormulaGenerator<T> rfg)
Constructs a new instance
|
Modifier and Type | Class and Description |
---|---|
class |
AspicArgumentationTheory<T extends Invertable> |
Modifier and Type | Field and Description |
---|---|
private Parser<? extends BeliefBase> |
SimplePlLogicParser.formulaparser |
Modifier and Type | Class and Description |
---|---|
class |
CompilationNode
Instances of this class represent nodes in the compilation of
a knowledge base, i.e.
|
Modifier and Type | Class and Description |
---|---|
class |
DeductiveKnowledgeBase
Instances of this class represent deductive knowledge bases,
i.e.
|
class |
SimplePlLogicDeductiveKnowledgebase |
Modifier and Type | Class and Description |
---|---|
class |
DefeasibleLogicProgram
This class models a defeasible logic program (DeLP).
|
Modifier and Type | Class and Description |
---|---|
class |
DungTheory
This class implements an abstract argumentation theory in the sense of Dung.
|
Modifier and Type | Class and Description |
---|---|
class |
ArgumentationKnowledgeBase
Instances of this class represent the set of minimal arguments from
a extended logic program
|
Modifier and Type | Class and Description |
---|---|
class |
PartialProbabilityAssignment
A partial probability assignment for abstract argumentation theories.
|
class |
ProbabilisticArgumentationFramework
This class implements the probabilistic argumentation framework approach
of [Li, Oren, Norman.
|
Modifier and Type | Class and Description |
---|---|
class |
StructuredArgumentationFramework
This class represents a structured argumentation framework, i.e.
|
Modifier and Type | Class and Description |
---|---|
class |
SocialAbstractArgumentationFramework
This class implements a social abstract argumentation framework from
[Joao Leite, Joao Martins.
|
Modifier and Type | Class and Description |
---|---|
class |
CrMasBeliefSet<T extends Formula>
This class represents belief sets for credibility-based agents multi-agent systems.
|
Modifier and Type | Class and Description |
---|---|
class |
AbstractInterpretation<B extends BeliefBase,S extends Formula>
An abstract interpretation for some logical language.
|
interface |
Interpretation<B extends BeliefBase,S extends Formula>
An interpretation for some logical language.
|
interface |
InterpretationIterator<S extends Formula,B extends BeliefBase,T extends Interpretation<B,S>>
An iterator over interpretations.
|
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.
|
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.
|
class |
Parser<T extends BeliefBase>
This class models an abstract parser for belief bases and formulas.
|
interface |
QualitativeReasoner<B extends BeliefBase,F extends Formula>
The general interface for objects that are able to query a belief base
with some formula and return either TRUE or FALSE as answer.
|
interface |
QuantitativeReasoner<B extends BeliefBase,F extends Formula>
The general interface for objects that are able to query a belief base
with some formula and return a degree (double value) of its acceptability.
|
interface |
Reasoner<O,B extends BeliefBase,F extends Formula>
The general interface for objects that are able to query a belief base
with some formula.
|
Modifier and Type | Class and Description |
---|---|
class |
BeliefSet<T extends Formula>
This class models a belief set, i.e.
|
Modifier and Type | Method and Description |
---|---|
BeliefBase |
BeliefBaseMachineShop.repair(BeliefBase beliefBase)
Repairs the given belief base, i.e.
|
Modifier and Type | Method and Description |
---|---|
BeliefBase |
BeliefBaseMachineShop.repair(BeliefBase beliefBase)
Repairs the given belief base, i.e.
|
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 |
ClBeliefSet
This class models a belief set on conditional logic, i.e.
|
Modifier and Type | Interface and Description |
---|---|
interface |
ConsistencyTester<T extends BeliefBase>
Classes implementing this interface are capable of testing
whether a given belief base is consistent.
|
interface |
ConsistencyWitnessProvider<B extends BeliefBase,S extends Formula>
Provides methods for returning some model (if it exists) of
a set of formulas.
|
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.
|
class |
EtaInconsistencyMeasure<B extends BeliefBase,S extends Formula>
This class implements the Eta-inconsistency measure, cf.
|
class |
HsInconsistencyMeasure<B extends BeliefBase,S extends Formula>
This class implements the Hitting Set inconsistency measure as proposed in [Thimm, 2014, in preparation].
|
interface |
InconsistencyMeasure<T extends BeliefBase>
Classes implementing this interface represent inconsistency measures
on belief bases.
|
Modifier and Type | Interface and Description |
---|---|
interface |
LogicProgram<C extends Formula,P extends Formula,T extends Rule<?,?>>
An interface for a logic program, which is a set of rules.
|
Modifier and Type | Class and Description |
---|---|
class |
FolBeliefSet
This class models a first-order knowledge base, i.e.
|
Modifier and Type | Class and Description |
---|---|
class |
ModalBeliefSet
This class models a modal knowledge base, i.e.
|
Modifier and Type | Class and Description |
---|---|
class |
MarkovLogicNetwork
Instances of this class represent Markov Logic Networks [Domingos et.
|
Modifier and Type | Method and Description |
---|---|
BeliefBase |
PclBeliefSetQuadraticErrorMinimizationMachineShop.repair(BeliefBase beliefBase) |
BeliefBase |
MinimumViolationMachineShop.repair(BeliefBase beliefBase) |
BeliefBase |
DistanceMinimizationMachineShop.repair(BeliefBase beliefBase) |
BeliefBase |
BalancedMachineShop.repair(BeliefBase beliefBase) |
BeliefBase |
AbstractCreepingMachineShop.repair(BeliefBase beliefBase) |
BeliefBase |
ConvexAggregatingMaxConsMeMachineShop.repair(BeliefBase beliefBase) |
BeliefBase |
MinimumAggregatedDistanceMachineShop.repair(BeliefBase beliefBase) |
BeliefBase |
MinimalViolationEuclideanMachineShop.repair(BeliefBase beliefBase) |
BeliefBase |
PenalizingCreepingMachineShop.repair(BeliefBase beliefBase) |
BeliefBase |
GeneralizedMeMachineShop.repair(BeliefBase beliefBase) |
BeliefBase |
MaximumEntropyMachineShop.repair(BeliefBase beliefBase) |
BeliefBase |
ConvexAggregatingMeMachineShop.repair(BeliefBase beliefBase) |
protected BeliefBase |
MinimalViolationEuclideanMachineShopOjAlgoExpression.repair(PclBeliefSet beliefSet)
Compute solution using ojalgos matrix representation.
|
protected BeliefBase |
MinimalViolationEuclideanMachineShopOjAlgoMatrix.repair(PclBeliefSet beliefSet)
Compute solution using ojalgos matrix representation.
|
protected abstract BeliefBase |
MinimalViolationEuclideanMachineShop.repair(PclBeliefSet beliefSet) |
Modifier and Type | Method and Description |
---|---|
BeliefBase |
PclBeliefSetQuadraticErrorMinimizationMachineShop.repair(BeliefBase beliefBase) |
BeliefBase |
MinimumViolationMachineShop.repair(BeliefBase beliefBase) |
BeliefBase |
DistanceMinimizationMachineShop.repair(BeliefBase beliefBase) |
BeliefBase |
BalancedMachineShop.repair(BeliefBase beliefBase) |
BeliefBase |
AbstractCreepingMachineShop.repair(BeliefBase beliefBase) |
BeliefBase |
ConvexAggregatingMaxConsMeMachineShop.repair(BeliefBase beliefBase) |
BeliefBase |
MinimumAggregatedDistanceMachineShop.repair(BeliefBase beliefBase) |
BeliefBase |
MinimalViolationEuclideanMachineShop.repair(BeliefBase beliefBase) |
BeliefBase |
PenalizingCreepingMachineShop.repair(BeliefBase beliefBase) |
BeliefBase |
GeneralizedMeMachineShop.repair(BeliefBase beliefBase) |
BeliefBase |
MaximumEntropyMachineShop.repair(BeliefBase beliefBase) |
BeliefBase |
ConvexAggregatingMeMachineShop.repair(BeliefBase beliefBase) |
Modifier and Type | Class and Description |
---|---|
class |
PclBeliefSet
This class models a belief set on probabilistic conditional logic, i.e.
|
Modifier and Type | Class and Description |
---|---|
class |
PlBeliefSet
This class represents a knowledge base of propositional formulae.
|
Modifier and Type | Class and Description |
---|---|
class |
RclBeliefSet
This class models a belief set on relational conditional logic, i.e.
|
Modifier and Type | Class and Description |
---|---|
class |
DefaultTheory
Models a default theory in Reiter's default logic, see [R.
|
Modifier and Type | Class and Description |
---|---|
class |
RpclBeliefSet
This class models a belief set on relational probabilistic conditional logic, i.e.
|
Modifier and Type | Class and Description |
---|---|
class |
AnswerSet
An answer set is a belief set which only contains literals
and represents the deductive belief set of an extended logic
program under the answer set semantic.
|
Modifier and Type | Class and Description |
---|---|
class |
Program
This class models an disjunctive logical program, which is
a collection of rules.
|
Modifier and Type | Class and Description |
---|---|
class |
NLPProgram
A nested logic program
|