Modifier and Type | Class and Description |
---|---|
class |
ActionDescription<T extends CausalLaw>
This class represents an action description as a set of causal laws.
|
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.
|
Modifier and Type | Method and Description |
---|---|
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 |
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 | Class and Description |
---|---|
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 | Method and Description |
---|---|
boolean |
SActionQuerySatisfactionTester.isSatisfied(TransitionSystem transitionSystem,
BeliefBase actionQueries) |
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 | Class and Description |
---|---|
class |
ABATheory<T extends Formula> |
Constructor and Description |
---|
CompleteReasoner(BeliefBase beliefBase,
int inferenceType)
Creates a new complete reasoner for the given knowledge base.
|
FlatABAReasoner(BeliefBase beliefBase,
Semantics semantics,
int inferencetype)
Creates a new instance
|
GeneralABAReasoner(BeliefBase beliefBase,
int inferenceType)
Creates a new general reasoner for the given knowledge base.
|
IdealReasoner(BeliefBase beliefBase,
int inferenceType)
Creates a new ideal reasoner for the given knowledge base.
|
PreferredReasoner(BeliefBase beliefBase,
int inferenceType)
Creates a new preferred reasoner for the given knowledge base.
|
StableReasoner(BeliefBase beliefBase,
int inferenceType)
Creates a new stable reasoner for the given knowledge base.
|
WellFoundedReasoner(BeliefBase beliefBase,
int inferenceType)
Creates a new well-founded reasoner for the given knowledge base.
|
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 |
AspicArgumentationTheory<T extends Invertable> |
Constructor and Description |
---|
AspicReasoner(BeliefBase beliefBase,
int semantics,
int inferencetype)
Creates a new instance
|
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 |
DeductiveKnowledgeBase
Instances of this class represent deductive knowledge bases,
i.e.
|
Constructor and Description |
---|
AbstractDeductiveArgumentationReasoner(BeliefBase beliefBase,
Categorizer categorizer,
Accumulator accumulator)
Creates a new reasoner for the given belief base,
categorizer, and accumulator.
|
CompilationReasoner(BeliefBase beliefBase,
Categorizer categorizer,
Accumulator accumulator)
Creates a new compilation reasoner for the given belief base,
categorizer, and accumulator.
|
SimpleReasoner(BeliefBase beliefBase,
Categorizer categorizer,
Accumulator accumulator)
Creates a new reasoner for the given belief base,
categorizer, and accumulator.
|
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 |
DefeasibleLogicProgram
This class models a defeasible logic program (DeLP).
|
Constructor and Description |
---|
DelpAnswer(BeliefBase beliefBase,
Formula query) |
DelpReasoner(BeliefBase beliefBase,
ComparisonCriterion comparisonCriterion)
Creates a new DelpReasoner for the given delp.
|
Modifier and Type | Class and Description |
---|---|
class |
DungTheory
This class implements an abstract argumentation theory in the sense of Dung.
|
Modifier and Type | Method and Description |
---|---|
static AbstractExtensionReasoner |
AbstractExtensionReasoner.getReasonerForSemantics(BeliefBase beliefBase,
Semantics semantics,
int inferenceType)
Creates a reasoner for the given semantics.
|
Constructor and Description |
---|
AbstractExtensionReasoner(BeliefBase beliefBase)
Creates a new reasoner for the given knowledge base using sceptical inference.
|
AbstractExtensionReasoner(BeliefBase beliefBase,
int inferenceType)
Creates a new reasoner for the given knowledge base.
|
AdmissibleReasoner(BeliefBase beliefBase)
Creates a new admissible reasoner for the given knowledge base using sceptical inference.
|
AdmissibleReasoner(BeliefBase beliefBase,
int inferenceType)
Creates a new admissible reasoner for the given knowledge base.
|
CF2Reasoner(BeliefBase beliefBase)
Creates a new CF2 reasoner for the given knowledge base using sceptical inference.
|
CF2Reasoner(BeliefBase beliefBase,
int inferenceType)
Creates a new CF2 reasoner for the given knowledge base.
|
CompleteReasoner(BeliefBase beliefBase)
Creates a new complete reasoner for the given knowledge base using sceptical inference.
|
CompleteReasoner(BeliefBase beliefBase,
boolean useSatSolver)
Creates a new complete reasoner for the given knowledge base using sceptical inference.
|
CompleteReasoner(BeliefBase beliefBase,
int inferenceType)
Creates a new complete reasoner for the given knowledge base.
|
CompleteReasoner(BeliefBase beliefBase,
int inferenceType,
boolean useSatSolver)
Creates a new complete reasoner for the given knowledge base.
|
ConflictFreeReasoner(BeliefBase beliefBase)
Creates a new conflict-free reasoner for the given knowledge base using sceptical inference.
|
ConflictFreeReasoner(BeliefBase beliefBase,
int inferenceType)
Creates a new conflict-free reasoner for the given knowledge base.
|
GroundReasoner(BeliefBase beliefBase)
Creates a new ground reasoner for the given knowledge base using sceptical inference.
|
GroundReasoner(BeliefBase beliefBase,
int inferenceType)
Creates a new ground reasoner for the given knowledge base.
|
IdealReasoner(BeliefBase beliefBase)
Creates a new ideal reasoner for the given knowledge base using sceptical inference.
|
IdealReasoner(BeliefBase beliefBase,
int inferenceType)
Creates a new ideal reasoner for the given knowledge base.
|
PreferredReasoner(BeliefBase beliefBase)
Creates a new preferred reasoner for the given knowledge base using sceptical inference.
|
PreferredReasoner(BeliefBase beliefBase,
int inferenceType)
Creates a new preferred reasoner for the given knowledge base.
|
SccCompleteReasoner(BeliefBase beliefBase)
Creates a new complete reasoner for the given knowledge base using sceptical inference.
|
SccCompleteReasoner(BeliefBase beliefBase,
int inferenceType)
Creates a new complete reasoner for the given knowledge base.
|
SemiStableReasoner(BeliefBase beliefBase)
Creates a new semi-stable reasoner for the given knowledge base using sceptical inference.
|
SemiStableReasoner(BeliefBase beliefBase,
int inferenceType)
Creates a new semi-stable reasoner for the given knowledge base.
|
StableReasoner(BeliefBase beliefBase)
Creates a new stable reasoner for the given knowledge base using sceptical inference.
|
StableReasoner(BeliefBase beliefBase,
int inferenceType)
Creates a new stable reasoner for the given knowledge base.
|
StageReasoner(BeliefBase beliefBase)
Creates a new stage reasoner for the given knowledge base using sceptical inference.
|
StageReasoner(BeliefBase beliefBase,
int inferenceType)
Creates a new stage reasoner for the given knowledge base.
|
StratifiedLabelingReasoner(BeliefBase beliefBase)
Creates a new reasoner for the given knowledge base using sceptical inference and grounded semantics.
|
StratifiedLabelingReasoner(BeliefBase beliefBase,
Semantics semantics,
int inferenceType)
Creates a new reasoner for the given Dung theory, semantics, and inference type.
|
Modifier and Type | Method and Description |
---|---|
boolean |
LdoInterpretation.satisfies(BeliefBase beliefBase) |
Modifier and Type | Method and Description |
---|---|
boolean |
StratifiedLabeling.satisfies(BeliefBase beliefBase) |
boolean |
AbstractArgumentationInterpretation.satisfies(BeliefBase beliefBase) |
Modifier and Type | Class and Description |
---|---|
class |
ArgumentationKnowledgeBase
Instances of this class represent the set of minimal arguments from
a extended logic program
|
Constructor and Description |
---|
ArgumentationReasoner(BeliefBase beliefBase,
AttackStrategy attack,
AttackStrategy defence)
Creates a new ArgumentationReasoner for the given belief base and parameterised
by a notion of attack for the opponent and another notion of attack for the defense
|
LiteralReasoner(BeliefBase beliefBase,
AttackStrategy attack,
AttackStrategy defence)
Creates a new reasoner for reasoning about literals in an
extended logic program given by the beliefBase.
|
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 |
DeductiveProbabilisticKnowledgebase
This class represents a probabilistic knowledge base in the sense of [Hunter, Thimm, 2013, in preparation].
|
Constructor and Description |
---|
DeductiveArgMeReasoner(BeliefBase beliefBase,
Attack attack)
Creates a new reasoner for the given knowledge base and attack relation.
|
Modifier and Type | Class and Description |
---|---|
class |
StructuredArgumentationFramework
This class represents a structured argumentation framework, i.e.
|
Constructor and Description |
---|
OutputReasoner(BeliefBase beliefBase,
java.lang.Class<? extends AbstractExtensionReasoner> reasonerClass)
Creates a new reasoner for the given knowledge base.
|
Modifier and Type | Class and Description |
---|---|
class |
SocialAbstractArgumentationFramework
This class implements a social abstract argumentation framework from
[Joao Leite, Joao Martins.
|
Constructor and Description |
---|
IssReasoner(BeliefBase beliefBase,
SimpleProductSemantics semantics,
double tolerance)
Creates a new reasoner for the given social abstract argumentation framework
|
Modifier and Type | Method and Description |
---|---|
boolean |
SocialMapping.satisfies(BeliefBase beliefBase) |
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 |
BeliefBaseSampler<S extends BeliefBase>
This abstract class models a sampler for belief bases.
|
class |
Parser<T extends BeliefBase>
This class models an abstract parser for belief bases and formulas.
|
Modifier and Type | Class and Description |
---|---|
class |
BeliefSet<T extends Formula>
This class models a belief set, i.e.
|
Modifier and Type | Field and Description |
---|---|
private BeliefBase |
Reasoner.beliefBase
The knowledge base on which reasoning is performed.
|
private BeliefBase |
Answer.beliefBase
The knowledge base of the original query.
|
Modifier and Type | Method and Description |
---|---|
BeliefBase |
Reasoner.getKnowledgeBase()
Returns the knowledge base of this reasoner.
|
BeliefBase |
Answer.getKnowledgeBase()
Returns the knowledge base this answer relates to.
|
BeliefBase |
BeliefBaseMachineShop.repair(BeliefBase beliefBase)
Repairs the given belief base, i.e.
|
Modifier and Type | Method and Description |
---|---|
abstract boolean |
Language.isRepresentable(BeliefBase beliefBase)
Checks whether the given knowledge base is representable in this language.
|
BeliefBase |
BeliefBaseMachineShop.repair(BeliefBase beliefBase)
Repairs the given belief base, i.e.
|
boolean |
Interpretation.satisfies(BeliefBase beliefBase)
Checks whether this interpretation satisfies the given knowledge base.
|
Constructor and Description |
---|
Answer(BeliefBase beliefBase,
Formula query)
Creates an empty answer for the given query.
|
Reasoner(BeliefBase beliefBase)
Creates a new reasoner for the given knowledge base.
|
Modifier and Type | Class and Description |
---|---|
class |
ClBeliefSet
This class models a belief set on conditional logic, i.e.
|
Modifier and Type | Method and Description |
---|---|
private java.util.ArrayList<ClBeliefSet> |
ZReasoner.partition(BeliefBase kb)
Returns a partitioning of a knowledge base into partitions containing all conditionals that
tolerate the remaining set of conditionals of a knowledge base.
|
Constructor and Description |
---|
BruteForceCReasoner(BeliefBase beliefBase)
Creates a new simple c-representation reasoner for the given knowledge base.
|
BruteForceCReasoner(BeliefBase beliefBase,
boolean simple)
Creates a new c-representation reasoner for the given knowledge base.
|
CReasoner(BeliefBase beliefBase)
Creates a new c-representation reasoner for the given knowledge base.
|
RelevanceReasoner(BeliefBase beliefBase)
Creates a new relevance reasoner for the given knowledge base.
|
ZReasoner(BeliefBase beliefBase)
Creates a new System Z reasoner for the given knowledge base.
|
Modifier and Type | Method and Description |
---|---|
boolean |
RankingFunction.satisfies(BeliefBase beliefBase) |
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 |
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 | Method and Description |
---|---|
boolean |
KripkeModel.satisfies(BeliefBase beliefBase) |
Modifier and Type | Class and Description |
---|---|
class |
FolBeliefSet
This class models a first-order knowledge base, i.e.
|
Constructor and Description |
---|
ClassicalInference(BeliefBase beliefBase)
Creates a new classical inference operator for the given knowledge base.
|
Modifier and Type | Method and Description |
---|---|
boolean |
FolLanguage.isRepresentable(BeliefBase beliefBase) |
Modifier and Type | Method and Description |
---|---|
boolean |
HerbrandInterpretation.satisfies(BeliefBase beliefBase) |
Modifier and Type | Class and Description |
---|---|
class |
MarkovLogicNetwork
Instances of this class represent Markov Logic Networks [Domingos et.
|
Constructor and Description |
---|
AbstractMlnReasoner(BeliefBase beliefBase)
Creates a new reasoner for the given Markov logic network.
|
AbstractMlnReasoner(BeliefBase beliefBase,
FolSignature signature)
Creates a new reasoner for the given Markov logic network.
|
AlchemyMlnReasoner(BeliefBase beliefBase)
Creates a new AlchemyMlnReasoner for the given Markov logic network.
|
AlchemyMlnReasoner(BeliefBase beliefBase,
FolSignature signature)
Creates a new AlchemyMlnReasoner for the given Markov logic network.
|
ApproximateNaiveMlnReasoner(BeliefBase beliefBase,
FolSignature signature,
long maxNumberOfSelectedInterpretations,
long maxNumberOfInterpretationsForModel)
Creates a new ApproximateNaiveMlnReasoner for the given Markov logic network.
|
NaiveMlnReasoner(BeliefBase beliefBase)
Creates a new NaiveMlnReasoner for the given Markov logic network.
|
NaiveMlnReasoner(BeliefBase beliefBase,
FolSignature signature)
Creates a new NaiveMlnReasoner for the given Markov logic network.
|
SimpleSamplingMlnReasoner(BeliefBase beliefBase,
FolSignature signature,
double precision,
int numOfPositiveTests)
Creates a new SimpleSamplingMlnReasoner for the given Markov logic network.
|
Modifier and Type | Class and Description |
---|---|
class |
PclBeliefSet
This class models a belief set on probabilistic conditional logic, i.e.
|
Constructor and Description |
---|
DefaultMeReasoner(BeliefBase beliefBase)
Creates a new default ME-reasoner for the given knowledge base.
|
DefaultMeReasoner(BeliefBase beliefBase,
Signature signature)
Creates a new default ME-reasoner for the given knowledge base.
|
GeneralizedMeReasoner(BeliefBase beliefBase,
int p)
Creates a new generalized ME-reasoner for the given knowledge base.
|
GeneralizedMeReasoner(BeliefBase beliefBase,
Signature signature,
int p)
Creates a new generalized ME-reasoner for the given knowledge base.
|
Modifier and Type | Method and Description |
---|---|
BeliefBase |
PenalizingCreepingMachineShop.repair(BeliefBase beliefBase) |
BeliefBase |
PclBeliefSetQuadraticErrorMinimizationMachineShop.repair(BeliefBase beliefBase) |
BeliefBase |
MinimumViolationMachineShop.repair(BeliefBase beliefBase) |
BeliefBase |
MinimumAggregatedDistanceMachineShop.repair(BeliefBase beliefBase) |
BeliefBase |
MinimalViolationEuclideanMachineShop.repair(BeliefBase beliefBase) |
BeliefBase |
MaximumEntropyMachineShop.repair(BeliefBase beliefBase) |
BeliefBase |
GeneralizedMeMachineShop.repair(BeliefBase beliefBase) |
BeliefBase |
DistanceMinimizationMachineShop.repair(BeliefBase beliefBase) |
BeliefBase |
ConvexAggregatingMeMachineShop.repair(BeliefBase beliefBase) |
BeliefBase |
ConvexAggregatingMaxConsMeMachineShop.repair(BeliefBase beliefBase) |
BeliefBase |
BalancedMachineShop.repair(BeliefBase beliefBase) |
BeliefBase |
AbstractCreepingMachineShop.repair(BeliefBase beliefBase) |
protected BeliefBase |
MinimalViolationEuclideanMachineShopOjAlgoMatrix.repair(PclBeliefSet beliefSet)
Compute solution using ojalgos matrix representation.
|
protected BeliefBase |
MinimalViolationEuclideanMachineShopOjAlgoExpression.repair(PclBeliefSet beliefSet)
Compute solution using ojalgos matrix representation.
|
protected abstract BeliefBase |
MinimalViolationEuclideanMachineShop.repair(PclBeliefSet beliefSet) |
Modifier and Type | Method and Description |
---|---|
BeliefBase |
PenalizingCreepingMachineShop.repair(BeliefBase beliefBase) |
BeliefBase |
PclBeliefSetQuadraticErrorMinimizationMachineShop.repair(BeliefBase beliefBase) |
BeliefBase |
MinimumViolationMachineShop.repair(BeliefBase beliefBase) |
BeliefBase |
MinimumAggregatedDistanceMachineShop.repair(BeliefBase beliefBase) |
BeliefBase |
MinimalViolationEuclideanMachineShop.repair(BeliefBase beliefBase) |
BeliefBase |
MaximumEntropyMachineShop.repair(BeliefBase beliefBase) |
BeliefBase |
GeneralizedMeMachineShop.repair(BeliefBase beliefBase) |
BeliefBase |
DistanceMinimizationMachineShop.repair(BeliefBase beliefBase) |
BeliefBase |
ConvexAggregatingMeMachineShop.repair(BeliefBase beliefBase) |
BeliefBase |
ConvexAggregatingMaxConsMeMachineShop.repair(BeliefBase beliefBase) |
BeliefBase |
BalancedMachineShop.repair(BeliefBase beliefBase) |
BeliefBase |
AbstractCreepingMachineShop.repair(BeliefBase beliefBase) |
Modifier and Type | Method and Description |
---|---|
boolean |
ProbabilityDistribution.satisfies(BeliefBase beliefBase) |
Modifier and Type | Class and Description |
---|---|
class |
PlBeliefSet
This class represents a knowledge base of propositional formulae.
|
Constructor and Description |
---|
ClassicalInference(BeliefBase beliefBase,
EntailmentRelation<PropositionalFormula> entailment) |
NaiveReasoner(BeliefBase beliefBase) |
SatReasoner(BeliefBase beliefBase)
Creates a new reasoner for the given belief base.
|
Modifier and Type | Method and Description |
---|---|
boolean |
PropositionalLanguage.isRepresentable(BeliefBase beliefBase) |
Modifier and Type | Method and Description |
---|---|
boolean |
PriestWorld.satisfies(BeliefBase beliefBase) |
boolean |
PossibleWorld.satisfies(BeliefBase beliefBase) |
boolean |
NicePossibleWorld.satisfies(BeliefBase beliefBase) |
boolean |
FuzzyInterpretation.satisfies(BeliefBase beliefBase) |
Modifier and Type | Class and Description |
---|---|
class |
RclBeliefSet
This class models a belief set on relational conditional logic, i.e.
|
Constructor and Description |
---|
RelationalBruteForceCReasoner(BeliefBase beliefBase,
FolSignature signature)
Creates a new simple c-representation reasoner for the given knowledge base.
|
RelationalBruteForceCReasoner(BeliefBase beliefBase,
FolSignature signature,
boolean simple)
Creates a new relational c-representation reasoner for the given knowledge base.
|
Modifier and Type | Method and Description |
---|---|
boolean |
RelationalRankingFunction.satisfies(BeliefBase beliefBase) |
Modifier and Type | Class and Description |
---|---|
class |
DefaultTheory
Models a default theory in Reiter's default logic, see [R.
|
Constructor and Description |
---|
NaiveDefaultReasoner(BeliefBase beliefBase) |
Modifier and Type | Class and Description |
---|---|
class |
RpclBeliefSet
This class models a belief set on relational probabilistic conditional logic, i.e.
|
Modifier and Type | Method and Description |
---|---|
boolean |
ReferenceWorld.satisfies(BeliefBase beliefBase) |
boolean |
CondensedProbabilityDistribution.satisfies(BeliefBase beliefBase) |
Constructor and Description |
---|
RpclMeReasoner(BeliefBase beliefBase,
RpclSemantics semantics,
FolSignature signature)
Creates a new reasoner for the given knowledge base.
|
RpclMeReasoner(BeliefBase beliefBase,
RpclSemantics semantics,
FolSignature signature,
int inferenceType)
Creates a new reasoner for the given knowledge base.
|
Modifier and Type | Method and Description |
---|---|
boolean |
RpclProbabilityDistribution.satisfies(BeliefBase beliefBase) |
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 |
AnswerSet
A 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 |
NLPProgram
A nested logic program
|