GameProtocol net.sf.tweety.agents.sim
Classes implementing this interface represent protocols
for games in the game theoretic meaning.
GameSimulator S extends AbstractProtocol & GameProtocol ,T extends Agent ,R extends MultiAgentSystem <T >> - Class in net.sf.tweety.agents.sim
This class implements a game simulator.
GameSimulator(MultiAgentSystemGenerator<T, R>, ProtocolGenerator<S, T, R>, List<AgentGenerator<T, R>>) GameSimulator
Creates a new GameSimulator for the given
MultiAgentSystemGenerator and AgentGenerators.
gamma MultiClassRbfTrainer
The gamma parameter for learning
GAMMA_PARAMETER MultiClassRbfTrainer
The gamma parameter for learning
geLowerCut(DungTheory, double) ProbabilisticExtension
Returns the lower cut of this probabilistic extension wrt.
gen LotteryGameGenerator
for generating Dung theories.
gen GroundedGameGenerator
for generating Dung theories.
gen ASPParser.JJCalls
GeneralABAReasoner T extends Formula > - Class in net.sf.tweety.arg.aba.reasoner
GeneralABAReasoner() GeneralABAReasoner
GeneralizedMeMachineShop net.sf.tweety.logics.pcl.analysis
Uses the generalized ME-model of a knowledge base to repair it, cf.
GeneralizedMeMachineShop(int) GeneralizedMeMachineShop
Creates a new machine shop with the given norm.
GeneralizedMeReasoner net.sf.tweety.logics.pcl.reasoner
This class implements a generalized maximum entropy reasoner for probabilistic
conditional logic as proposed in [Potyka, Thimm, 2014] which also works for
inconsistent belief sets.
GeneralizedMeReasoner(int) GeneralizedMeReasoner
Creates a new generalized ME-reasoner
GeneralizedSpecificity net.sf.tweety.arg.delp.semantics
This class implements the generalized specificity criterion used to compare two arguments.
GeneralizedSpecificity() GeneralizedSpecificity
GeneralizedSpecificity.ActSetType net.sf.tweety.arg.delp.semantics
GeneralMathException net.sf.tweety.math
This class is represents a general math exception;
GeneralMathException() GeneralMathException
Creates a new general math exception.
GeneralMathException(String) GeneralMathException
Creates a new general math exception.
generate(LotteryGameSystem, SimulationParameters) DirectGameProtocolGenerator
generate(LotteryGameSystem, SimulationParameters) DummyAgentGenerator
generate(SimulationParameters) LotteryGameGenerator
generate(LotteryGameSystem, SimulationParameters) ProbabilisticLotteryAgentGenerator
generate(LotteryGameSystem, SimulationParameters) RandomLotteryAgentGenerator
generate(LotteryGameSystem, SimulationParameters) UtilityBasedAgentGenerator
generate(GroundedGameSystem, SimulationParameters) GroundedGameAgentGenerator
generate(SimulationParameters) GroundedGameGenerator
generate(GroundedGameSystem, SimulationParameters) GroundedGameProtocolGenerator
generate(S, SimulationParameters) AgentGenerator
Generates a new agent for the given multi-agent system.
generate(SimulationParameters) MultiAgentSystemGenerator
Generates a new multi-agent system.
generate(R, SimulationParameters) ProtocolGenerator
Generates a new protocol.
generate(int, boolean) RandomSubsetIterator
Generates a new bit set of the given length.
generateBeliefState(GroundedGameSystem, SimulationParameters) GroundedGameAgentGenerator
Generates a belief state for the agent wrt.
generateBeliefState(GroundedGameSystem, SimulationParameters) GroundedGameT1AgentGenerator
generateBeliefState(GroundedGameSystem, SimulationParameters, int, Extension, GroundedGameSystem.AgentFaction) GroundedGameT1AgentGenerator
Generates the (sub-)belief state of a T1-belief state.
generateBeliefState(GroundedGameSystem, SimulationParameters) GroundedGameT2AgentGenerator
generateBeliefState(GroundedGameSystem, SimulationParameters, int, Extension, GroundedGameSystem.AgentFaction) GroundedGameT2AgentGenerator
Generates the (sub-)belief state of a T2-belief state.
generateBeliefState(GroundedGameSystem, SimulationParameters) GroundedGameT3AgentGenerator
generateBeliefState(GroundedGameSystem, SimulationParameters, int, Extension, GroundedGameSystem.AgentFaction) GroundedGameT3AgentGenerator
Generates the (sub-)belief state of a T3-belief state.
generatedSubsets RandomSubsetIterator
Only used when avoidDuplicats is set to true.
generateFormulasOfLength(int) SyntacticEnumeratingIterator
Generates all formulas of the given length and stores them
in "pathToTemp/length/"
generateName() AspicArgument
Generates a unique identifying name for this argument, which describes it
and is used to determine equality
generateParseException() DelpParser
Generate ParseException.
generateParseException() RpclCondensedProbabilityDistributionParser
Generate ParseException.
generateParseException() RpclProbabilityDistributionParser
Generate ParseException.
generateParseException() ASPParser
Generate ParseException.
generateParseException() POParser
Generate ParseException.
generateParseException() UPParser
Generate ParseException.
generatePossibleAttacks(Set<Argument>) EnumeratingDungTheoryGenerator
Computes all possible attacks.
generatePreferenceOrder() Functions
this method returns a preference order made out of an ranking function
generatePreferenceOrder() LevelingFunction
this method returns a preference order made out of this leveling function
generatePreferenceOrder() RankingFunction
this method returns a preference order made out of an ranking function
generateRandomly(int) RandomSubsetIterator
Generates a random bit set of the given length.
generateString(Random, String, int) TestKBParsing
generateTreeShape(Argument) DefaultDungTheoryGenerator
Generates a Dung theory with a tree shape where the given argument
is the root.
Generator() ConditionalStructure.Generator
get(int) LdoAssociativeFormula
get(Object) Labeling
get(Object) NumericalArgumentRanking
get(Object) StratifiedLabeling
get(Division) ArgumentationLottery
Returns the probability of the given outcome.
get(LdoFormula) LdoArgumentationLottery
Returns the probability of the given outcome.
get(Argument) SocialMapping
Returns the social value of the given argument
get(int) AssociativeFormulaSupport
get() Term
get() StringTerm
get() TermAdapter
get(int) AssociativeFOLFormula
get(Object) ProbabilityDistribution
get(Object) FuzzyInterpretation
get(Proposition) PriestWorld
Returns the truth value of the given proposition.
get(int) AssociativePropositionalFormula
get(Predicate, Collection<? extends Constant>) ReferenceWorld
Retrieves the number of true instances assigned for the
given predicate and the given equivalence class of constants.
get(Object) ReferenceWorld
get(Object) RpclProbabilityDistribution
get(int) DLPHead
get(Object) ProbabilityFunction
get(Triple<T, T, Relation>) PreferenceOrder
checks existence and returns a demanded pair
get(Object) Functions
returns the value to a given key
getAbsoluteValues() Statement
Returns all absolute values of this statement.
getAbsoluteValues() AbsoluteValue
getAbsoluteValues() AssociativeOperation
getAbsoluteValues() Constant
getAbsoluteValues() Difference
getAbsoluteValues() Fraction
getAbsoluteValues() FunctionalTerm
getAbsoluteValues() Term
Returns all absolute values of this term.
getAbsoluteValues() Variable
getAcceptanceConstraint(Conditional, Map<PossibleWorld, IntegerVariable>) CReasoner
For the given conditional (B|A) and the given ranks of possible worlds, this
method constructs the inequation k(AB) < k(A-B) where k(AB) is the minimum of
the ranks of the interpretations that satisfy AB.
getAcceptanceProbability(LdoFormula, Semantics) SubgraphProbabilityFunction
Returns the probability of the given formula being acceptable wrt.
getAcceptanceProbability(Division, Semantics) SubgraphProbabilityFunction
Returns the probability of the given division being acceptable wrt.
getAcceptanceProbability(Argument, Semantics) SubgraphProbabilityFunction
Returns the probability of the given argument being acceptable wrt.
getAcceptanceProbability(Extension, Semantics) SubgraphProbabilityFunction
Returns the probability of the given set of arguments being acceptable wrt.
getAction() Transition
Returns the action that causes this transition.
getAction() ActionEvent
getActionName(String) ActionSignature
Returns the action name predicate with the given name if one exists, null
otherwise.
getActionNames() ActionSignature
Returns the set of action names contained in this action signature.
getActions() NecessarilyQuery
Returns the list of actions of this necessarily query in the correct order.
getActionSignature() NecessarilyQuery
getActionSignature() QueryProposition
Returns a new action signature containing all symbols of the inner formula
of this proposition.
getActionSignature() SActionQuery
Returns the action signature of this action query.
getAdditionalArguments() EFOLReasoner
Returns the additional arguments given to the call of the
EProver binary (Default value is "--auto-schedule").
getAdjancyMatrix() DungTheory
getAdjancyMatrix() DefaultGraph
getAdjancyMatrix() Graph
Returns the adjacency matrix of this graph (the order
of the nodes is the same as returned by "iterator()").
getAF() SimplePlLogicDeductiveKnowledgebase
Builds simple logic arguments and attacks among them---simple undercut and
simple rebuttal---as described in http://www0.cs.ucl.ac.uk/staff/a.hunter/papers/ac13t.pdf
getAfterFormula() DynamicLaw
Returns the afterFormula of this causal law.
getAgent() ActionEvent
getAllAdmissbleExtensions() ABATheory
Computes all admissible extensions
getAllArguments() ProbabilisticExtension
Returns the set of all arguments appearing.
getAllConclusions() Deduction
Returns all conclusions appearing in this argument.
getAllConclusions() AspicArgument
Returns all conclusions appearing in this argument.
getAllConflictFreeExtensions() ABATheory
Computes all context-free extensions
getAllDeductions() ABATheory
getAllDeductions(Collection<Assumption<T>>) ABATheory
getAllExtensions() ABATheory
Computes all possible extensions
getAllGrounded() CLaw
Returns the set of all grounded instances of this causal law.
getAllGrounded() DynamicLaw
getAllGrounded() StaticLaw
getAllGrounded() SActionQuery
Returns the set of all grounded instances of this causal rule.
getAllGroundedActionNameAtoms() ActionSignature
Returns the set of all possible grounded atoms in this signature on the
basis of all action name predicates contained.
getAllGroundedFluentAtoms() ActionSignature
Returns the set of all possible grounded atoms in this signature on the
basis of all fluent predicates contained.
getAllHerbrandInterpretations() HerbrandBase
Computes all possible Herbrand interpretations of this Herbrand
base, i.e.
getAllHerbrandInterpretations() ModalHerbrandBase
Computes all possible Herbrand interpretations of this Herbrand
base, i.e.
getAllInstantiations(FolSignature, Predicate, List<Term<?>>) HerbrandBase
Computes all instantiations of the predicate "p" relative to the signature "sig"
where "arguments" defines the first arguments of the atoms.
getAllMNCompleteExtensions(DungTheory, int, int) GrossiModgilRankingReasoner
Returns all mn-complete extensions.
getAllMNGroundedExtensions(DungTheory, int, int) GrossiModgilRankingReasoner
Returns all mn-grounded extensions.
getAllMNPreferredExtensions(DungTheory, int, int) GrossiModgilRankingReasoner
Returns all mn-preferred extensions.
getAllMStableExtensions(DungTheory, int) GrossiModgilRankingReasoner
Returns all m-stable extensions.
getAllPossibleWorlds(Collection<Proposition>) NicePossibleWorld
getAllPossibleWorlds(Collection<Proposition>) PossibleWorld
Returns the set of all possible worlds for the
given propositional signature.
getAllRules() Deduction
Returns all rules appearing in this argument.
getAllRules() AspicArgument
Returns all rules appearing in this argument.
getAllSubs() AspicArgument
returns the Subs according to the ASPIC+ specification
getAllSubstitutions(Set<Variable>, Set<Constant>) GroundingTools
Calculates all possible substitutions of variables for a given set of
constants
getAllSubstitutions(Set<Variable>) GroundingTools
Calculates all possible substitutions in the given set of variables using
all possible constants of the same sort.
getAmount() Update
returns the third element of this quadruple
getArgument() LdoArgument
Returns an argument representation (in Dung-style)
of this LdoArgument.
getArgumentationLine() DialecticalTree
Returns the argumentation line which is generated by the path from this node to the root (in reverse)
getArguments() AspicArgumentationTheory
Expands this systems's inference rules into a tree arguments
getArguments() DefeasibleLogicProgram
Returns the set of all possible arguments, that can be built in this delp.
getArguments() LdoArgument
getArguments() ArgumentationKnowledgeBase
Returns all minimal arguments constructible from the extended logic program
getArguments(LinkedList<Rule>) ArgumentationKnowledgeBase
Recursively constructions minimal arguments in a bottom-up fashion.
getArguments() FunctionalTerm
getArguments() Atom
getArguments() FOLAtom
getArguments() Proposition
getArguments() DLPAtom
getArguments() DLPNeg
getArgumentsOfStatus(ArgumentStatus) AbstractArgumentationInterpretation
Returns all arguments that have the given status in this interpretation.
getArgumentsOfStatus(ArgumentStatus) Extension
getArgumentsOfStatus(ArgumentStatus) Labeling
getArgumentsOfStatus(ArgumentStatus) LatticeArgumentRanking
getArgumentsOfStatus(ArgumentStatus) NumericalArgumentRanking
getArgumentTree(DeductiveKnowledgeBase, DeductiveArgument) AbstractDeductiveArgumentationReasoner
Computes the argument tree of the given argument.
getArgumentTree(DeductiveKnowledgeBase, DeductiveArgument) CompilationReasoner
getArgumentTree(DeductiveKnowledgeBase, DeductiveArgument) SimpleReasoner
getArgumentTree(DeductiveKnowledgeBase, DeductiveArgumentNode, Set<PropositionalFormula>) SimpleReasoner
Computes the argument tree of the given argument.
getArgumentTree(DeductiveArgument) Compilation
Returns the argument tree for the given argument.
getArgumentTypes() TypedStructure
getArgumentTypes() TypedStructureAdapter
getArity() TypedStructure
getArity() TypedStructureAdapter
getArity() DLPAtom
getAssumptions() ABATheory
getAssumptions() Deduction
getAssumptions() Argument
Returns the set of assumptions, i.e.
getAtom() DLPAtom
getAtom() DLPLiteral
getAtom() DLPNeg
getAtoms() CLaw
Returns the set of propositions in all formulas in this law.
getAtoms() DynamicLaw
getAtoms() StaticLaw
getAtoms() FolAction
Returns all atoms, e.g.
getAtoms() DelpRule
getAtoms() AbstractGraphLdoModality
getAtoms() AbstractLdoModality
getAtoms() LdoArgument
getAtoms() LdoAssociativeFormula
getAtoms() LdoFormula
getAtoms() LdoNegation
getAtoms() LdoRelation
getAtoms() Conditional
getAtoms() AssociativeFormulaSupport
getAtoms() SimpleLogicalFormula
Processes the set of all atoms which appear in this formula
getAtoms() QuantifiedFormulaSupport
getAtoms() RelationalFormula
getAtoms() HerbrandBase
Returns all atoms of this Herbrand base.
getAtoms() AssociativeFOLFormula
getAtoms() Equivalence
getAtoms() ExistsQuantifiedFormula
getAtoms() FOLAtom
getAtoms() ForallQuantifiedFormula
getAtoms() Implication
getAtoms() Negation
getAtoms() SpecialFormula
getAtoms() ModalHerbrandBase
Returns all atoms of this Herbrand base.
getAtoms() ModalFormula
getAtoms() MlnFormula
getAtoms() AssociativePropositionalFormula
getAtoms() Negation
getAtoms() Proposition
getAtoms() PropositionalFormula
getAtoms() SpecialFormula
getAtoms() RelationalConditional
getAtoms() DefaultRule
getAtoms() Aggregate
getAtoms() Arithmetic
getAtoms() Comparative
getAtoms() DLPAtom
getAtoms() DLPElement
getAtoms() DLPHead
getAtoms() DLPNeg
getAtoms() DLPNot
getAtoms() Rule
getAtoms() NLPNot
getAtoms() NLPRule
getAtomString(RelationalFormula, int) CTransitionSystemCalculator
Utility function representing a given atom, either an actionname or a
fluentname, to be used in a rule in an extended logic program.
getAttacked() Attack
returns the attacked argument of this attack relation.
getAttacked(Argument) DungTheory
Computes the set {A | (argument,A) in attacks}.
getAttacker() Attack
returns the attacking argument of this attack relation.
getAttackers(Argument) DungTheory
Computes the set {A | (A,argument) in attacks}.
getAttackingArguments(Argument) AttackRelation
Returns all arguments from the knowledgebase, that attack argument a.
getAttackOpportunities(DefeasibleLogicProgram) DelpArgument
Computes the set of literals that disagree with the conclusion of a subargument of this argument
getAttacks() DungTheory
Returns all attacks of this theory.
getBaseProblem(PclBeliefSet, ProbabilisticConditional, double) MeanDistanceCulpabilityMeasure
Creates the base problem (without target function set) for determining both minimal
and maximal incon values.
getBeginColumn() SimpleCharStream
Get token beginning column number.
getBeginColumn() SimpleCharStream
Get token beginning column number.
getBeginColumn() SimpleCharStream
Get token beginning column number.
getBeginColumn() SimpleCharStream
Get token beginning column number.
getBeginColumn() SimpleCharStream
Get token beginning column number.
getBeginLine() SimpleCharStream
Get token beginning line number.
getBeginLine() SimpleCharStream
Get token beginning line number.
getBeginLine() SimpleCharStream
Get token beginning line number.
getBeginLine() SimpleCharStream
Get token beginning line number.
getBeginLine() SimpleCharStream
Get token beginning line number.
getBeliefState() ArguingAgent
Returns the belief state of the agent.
getBinarybase() PriestWorld
Returns the binary base of this world, i.e.
getBinaryLocation() EFOLReasoner
Returns the path of the EProver binary.
getBinaryLocation() Prover9FolReasoner
Returns the path of the Prover9 binaries.
getBipartitions(Set<E>) SetTools
Computes every bipartition of the given set, e.g.
getBooleanAnswer() DelpAnswer.Type
getCanonicalFormulas(int, PropositionalSignature) HsSampler
For a signature {a1,...,an} creates num different canonical and mutually exclusive
formulas of the form a1a2a3, a1a2-a3, a1-a2a3, etc.
getCategories() TrainingSet
Returns the collection of categories present in this
training set.
getCharacteristicProbabilisticExtension(DungTheory, AbstractArgumentationInterpretation) ProbabilisticExtension
Returns the characteristic probabilistic extension of the given interpretation,
i.e.
getChildren(Node) DungTheory
getChildren(Node) DefaultGraph
getChildren(Node) Graph
Returns the set of children (node connected via an undirected edge or a directed edge
where the given node is the parent) of the given node.
getClaim() DeductiveArgument
Returns the claim of this argument.
getClaim() SimplePlLogicArgument
getClaim() ArgumentStructure
Returns the claim of this argument structure, i.e.
getClassical() PriestWorld.TruthValue
getClosure(Collection<Assumption<T>>) ABATheory
A closure is the set of assumptions that can be derived from a set of
assumptions via inference rules
getColumn() SimpleCharStream
Deprecated.
getColumn() SimpleCharStream
Deprecated.
getColumn() SimpleCharStream
Deprecated.
getColumn() SimpleCharStream
Deprecated.
getColumn() SimpleCharStream
Deprecated.
getCommand() FirstOrderLogicPlugin
This class returns the parameter used to call this plugin
getCommand() PropositionalLogicPlugin
returns the parameter used to call this plugin from the tweety cli
getCommand() RPCLPlugin
getCommand() AbstractTweetyPlugin
returns the command this plugin is called with
getCommand() TweetyPlugin
returns the keyword used in the cli to call this plugin
getCommand() PreferencesPlugin
getCommonView() SasAgent
Returns the common view of this agent.
getComparisonCriterion() DelpReasoner
returns the comparison criterion used in this program
getComplement() GroundedGameSystem.AgentFaction
getComplementGraph(int) DungTheory
getComplementGraph(int) DefaultGraph
getComplementGraph(int) Graph
Returns the complement graph of this graph, i.e.
getCompleteConjunction(PropositionalSignature) PossibleWorld
Returns the complete conjunction representing this possible world wrt.
getCompleteExtensions(DungTheory, Extension, Collection<Argument>) SimpleCompleteReasoner
Auxiliary method to compute all complete extensions
getCompletenessEnforcementRules(Set<FOLAtom>, int) CTransitionSystemCalculator
Returns rules, that enforce the existence of each atom in the given set in
all answer sets of an extended logic program.
getCompletions(DelpArgument, DefeasibleLogicProgram) ArgumentCompletion
This static method computes all argument completions for the given parameter argument using
the strict rules from the parameter delp
getConcepts() DlSignature
getConclusion() Assumption
getConclusion() Deduction
getConclusion() InferenceRule
getConclusion() AspicArgument
Returns Conc according to the ASPIC+ specification
getConclusion() InferenceRule
getConclusion() SimplePlRule
getConclusion() DelpArgument
returns the conclusion of this argument
getConclusion() DelpRule
getConclusion() BasicArgument
getConclusion() Derivation
Returns the conclusion of this derivation.
getConclusion() Rule
Returns the conclusion of this rule.
getConclusion() Conditional
getConclusion() RelationalConditional
getConclusion() DefaultRule
getConclusion() Rule
getConclusion() NLPRule
getConclusion() AssociationRule
Returns the conclusion of this rule.
getConclusions() Argument
Returns the set of conclusions of this argument, which is made up of
the heads of all rules contained in this argument.
getConclusions() RuleSet
Returns all conclusions of all rules of this rule set.
getConditionalGenerators(Conditional) ConditionalStructure
Processes the Map form PossibleWorlds to the Generators of the given Conditional
getConditionals() ConditionalStructure
getConflictbase() PriestWorld
Returns the conflict base of this world, i.e.
getConflictingRules(Program, Program) PreferenceHandling
Helper method: Finds all pairs of conflicting rules in program p1 and p2.
getConjunction() SymbolicSet
getConjunctionOfAllQueries() SActionQuerySet
Returns a conjunction of all contained queries.
getConjunctions() SpecialFormula
getConsistentSetCounts(Collection<S>, Collection<S>, Collection<Collection<S>>, int) DfInconsistencyMeasure
Computes the numbers of consistent subsets for cardinalities |inFormulas|...|inFormulas|+|restFormulas|
(the knowledge base considered is inFormulas\cup restFormulas and the formulas in inFormulas have to be part
of every considered subset).
getConstant(String, Sort) GroundingRequirementsParser
Returns the constant with the name 'name' of the sort 'sort', if one
exists, null otherwise.
getConstant(String) FolSignature
getConstants() FolSignature
getConstants() LogicStructure
Returns all constants that appear in this structure.
getConstraints(Collection<? extends SActionQuery>) SActionQuerySatisfactionTester
Returns the program C_q which contains a constraint for each query in
question.
getContol() OpenOptRootFinder
getContol() OpenOptSolver
getCredibilityOrder() CrMasBeliefSet
Returns the credibility order of this belief set.
getCriteria() CustomStringListCommandParameter
getCurrentDiretory() RevisionComparePresenter.DefaultFileHandler
getCurrentDiretory() RevisionComparePresenter.FileHandler
getCurrentDiretory() SimpleRevisionComparePresenter.DefaultFileHandler
getCurrentDiretory() SimpleRevisionComparePresenter.FileHandler
getCygwinShell(String) Shell
a wrapper around the cygwin shell
getDeductiveArguments(PropositionalFormula) DeductiveKnowledgeBase
Computes all deductive arguments for the given claim.
getDeductiveArguments() DeductiveKnowledgeBase
Computes all deductive arguments.
getDefaultEnumerator() PlMusEnumerator
Returns the default MUS enumerator.
If a default MUS enumerator has been configured this enumerator
is returned by this method.
getDefaultGeneralSolver() Solver
Returns the default solver for non-linear (general) optimization problems.
getDefaultIntegerLinearSolver() Solver
Returns the default solver for integer linear optimization problems.
getDefaultLinearSolver() Solver
Returns the default solver for linear optimization problems.
If a default solver for linear problems has been configured this solver
is returned by this method.
getDefaultMetaVariable() CriterionOptionHandler
getDefaultNegationRules(Set<FOLAtom>, int) CTransitionSystemCalculator
Returns rules of an extended logic program for the given set of atoms and a
parameter t.
getDefaultReasoner() FolReasoner
Returns the default theorem prover
getDefaultReasoner() AbstractModalReasoner
Returns the default reasoner for modal logic
getDefaults() DefaultTheory
getDefaultSolver() SatSolver
Returns the default SAT solver.
If a default SAT solver has been configured this solver
is returned by this method.
getDefaultValue() TrainingParameter
Returns the default value of this parameter.
getDefeasibleRules() AspicArgument
Returns the DefRules according to ASPIC+ specification,
i.e.
getDefeasibleSubs() AspicArgument
Determines subarguments with defeasible toprules, premises do not count as subrules
getDefeaters(Set<DelpArgument>, DefeasibleLogicProgram, ComparisonCriterion) DialecticalTree
Computes the set of arguments which are defeaters for the argument in this tree node and returns
the corresponding dialectical tree nodes with these defeaters.
getDefensibleArguments(ArgumentationKnowledgeBase) ArgumentationReasoner
Returns the set of defensible arguments, i.e.
getDerivableLiterals(Collection<Rule>) ArgumentationKnowledgeBase
This method returns the set of conclusions of all rules in the collection
of rules given.
getDescription() CommandParameter
returns the description for this parameter
getDeviation(PclBeliefSet, ProbabilisticConditional) DistanceMinimizationInconsistencyMeasure
Returns the deviation of the given conditional in the
nearest consistent belief set.
getDialogueTrace() ArgumentationEnvironment
Returns the current dialogue trace.
getDialogueTrace() LotteryArgumentationEnvironment
Returns the current dialogue trace.
getDialogueTrace() DeductiveEnvironment
Returns the current dialogue trace.
getDirection(double[][], double[]) HessianGradientDescent
Find the best direction.
getDirectSubs() AspicArgument
The argument's direct children, whose conclusions fit its prerequisites
getDisagreementSubargument(FolFormula, DefeasibleLogicProgram) DelpArgument
Computes the disagreement subargument of this argument for the given literal
getDisjunctions() SpecialFormula
getDividers(DungTheory, Semantics) Division
Returns the dividers for this division, i.e.
getDividers(DungTheory, Semantics) LdoFormula
Returns the dividers for this formula, i.e.
getDivisions(Collection<Extension>, DungTheory) Division
Returns all divisions of all given extensions and the given aaf.
getDivisions(Extension, DungTheory) Division
Returns all divisions of aaf that arise from the given extension.
getDomainElements() BinaryRelation
returns a set of the single elements in this binary relation
getDomainElements() PreferenceOrder
(re-)computes a set of single elements in this preference order
getDoubleAnswer() DelpAnswer.Type
getDualCoNorm() LukasiewiczNorm
getDualCoNorm() MinimumNorm
getDualCoNorm() ProductNorm
getDualCoNorm() TNorm
Returns the dual T-conorm of this T-norm.
getDualNorm() BoundedSum
getDualNorm() MaximumCoNorm
getDualNorm() ProbabilisticSum
getDualNorm() TCoNorm
Returns the dual T-norm of this T-conorm.
getDungTheory(AspicArgumentationTheory<T>, Formula) AbstractAspicReasoner
Computes the Dung theory from which the answer will be derived
getDungTheory(AspicArgumentationTheory<T>, Formula) ModuleBasedAspicReasoner
getDungTheory(AspicArgumentationTheory<T>, Formula) NaiveAspicReasoner
getDungTheory(AspicArgumentationTheory<T>, Formula) RandomAspicReasoner
getDungTheory() DefeasibleLogicProgram
This method translates this delp into an abstract Dung theory.
getDynamicLaws() CActionDescription
Returns a set of all dynamic laws contained in this action description.
getEdge(Argument, Argument) DungTheory
getEdge(T, T) DefaultGraph
getEdge(T, T) Graph
Returns the corresponding edge (a,b) if a and b are adjacent.
getEdges() DungTheory
getEdges() DefaultGraph
getEdges() Graph
Returns the edges of this graph.
getElement() Update
returns the fourth element of this quadruple
getElements() DialogueTrace
Returns all elements mentioned in this dialogue trace.
getElements() Order
Returns the elements appearing in this order.
getElementsByValue(int) Functions
returns an entry set of all elements in this ranking function with the same rank (= value)
getEmptySymbol() LdoConjunction
getEmptySymbol() LdoDisjunction
getEmptySymbol() AssociativeFormulaSupport.AssociativeSupportBridge
getEmptySymbol() Conjunction
getEmptySymbol() Disjunction
getEmptySymbol() Conjunction
getEmptySymbol() Disjunction
getEmptySymbol() DLPHead
getEndColumn() SimpleCharStream
Get token end column number.
getEndColumn() SimpleCharStream
Get token end column number.
getEndColumn() SimpleCharStream
Get token end column number.
getEndColumn() SimpleCharStream
Get token end column number.
getEndColumn() SimpleCharStream
Get token end column number.
getEndLine() SimpleCharStream
Get token end line number.
getEndLine() SimpleCharStream
Get token end line number.
getEndLine() SimpleCharStream
Get token end line number.
getEndLine() SimpleCharStream
Get token end line number.
getEndLine() SimpleCharStream
Get token end line number.
getEntry(int, int) Matrix
Returns the entry with the given coordinates.
getEnvironment() MultiAgentSystem
Returns the environment of this multi-agent system.
getEpistemicLabeling() ProbabilisticExtension
Returns the epistemic labeling of this probabilistic extension, i.e.
getEpistemicProbability(Argument) SubgraphProbabilityFunction
Returns the epistemic probability of the given argument, i.e.
getEpistemicProbability(Attack) SubgraphProbabilityFunction
Returns the epistemic probability of the given attack, i.e.
getEquivalenceClasses(FolSignature) RpclBeliefSet
Determines the equivalence classes of this belief set wrt.
getEquivalenceClasses() RpclBeliefSet
Determines the equivalence classes of this belief set, i.e.
getError() AspInterface
This method returns the error output of a previously called
answer set solver tools.
getExpectedUtility(LdoArgumentationLottery) LdoUtilityFunction
Returns the expected utility of the given lottery.
getExpectedUtility(ArgumentationLottery) UtilityFunction
Returns the expected utility of the given lottery.
getExtensions() DefaultProcessTree
getFaction() ArguingAgent
Returns the faction of the agent.
getFaction() GroundedGameAgentGenerator
Returns the faction of the generated agents.
getFacts() DefaultTheory
getFacts() NLPProgram
getFactsByName(String) AnswerSetList
getFactsByName(String, int) AnswerSetList
Returns all the literals in the answer set which have a given name.
getFactsByName(String) AnswerSetList
getFactsByName(String, int) AnswerSetList
Returns all the literals in the answer-set which have a given name.
getFalsifiyingWorlds(Conditional) ConditionalStructure
getFileFormat(String) FileFormat
Returns the file format instance that corresponds to the given abbrevation
getFileFormats(String) FileFormat
Returns a collection of file formats parsed from the given string which
has to be in the format "[format1,...,formatn]".
getFilter() RevisionComparePresenter.DefaultFileHandler
getFilter() RevisionComparePresenter.FileHandler
getFilter() SimpleRevisionComparePresenter.DefaultFileHandler
getFilter() SimpleRevisionComparePresenter.FileHandler
getFirst() Pair
returns the first element of this pair
getFirst() Triple
returns the first element of this triple
getFluentName(String) ActionSignature
Returns the fluent name predicate with the given name if one exists, null
otherwise.
getFluentNames() ActionSignature
Returns the set of fluent names contained in this action signature.
getFormat(String) PlParserFactory.Format
getFormula() SActionQuery
Returns the formula represented by this action query.
getFormula() Assumption
Returns the inner formula of this assumption.
getFormula() LdoNegation
Returns the formula within this negation.
getFormula() InformationObject
Returns the formula of this information object.
getFormula() QuantifiedFormula
getFormula() QuantifiedFormulaSupport
Returns the folFormula this quantified formula ranges over
getFormula() RelationalFormula
getFormula() ExistsQuantifiedFormula
getFormula() ForallQuantifiedFormula
getFormula() Negation
getFormula() ModalFormula
Returns the inner formula of this modal formula.
getFormula() MlnFormula
Returns the inner formula.
getFormula() Negation
Returns the formula within this negation.
getFormulas() CLaw
Returns the set of formulas contained in this causal law, e.g.
getFormulas() DynamicLaw
getFormulas() StaticLaw
getFormulas() LdoAssociativeFormula
getFormulas(Class<C>) LdoAssociativeFormula
getFormulas() AssociativeFormulaSupport
getFormulas(Class<C>) AssociativeFormulaSupport
getFormulas() AssociativeFormula
getFormulas(Class<C>) AssociativeFormula
Process the formulas of type C that are children of this associative
formula
getFormulas() AssociativeFOLFormula
getFormulas(Class<C>) AssociativeFOLFormula
getFormulas() Equivalence
Returns the formulas of the equivalence.
getFormulas() Implication
Returns the formulas of the implication.
getFormulas() AssociativePropositionalFormula
getFormulas(Class<C>) AssociativePropositionalFormula
getFormulas() DLPHead
getFormulas(Class<C>) DLPHead
getFrom() Transition
Returns the source state of this transition.
getFtol() OpenOptRootFinder
getFtol() OpenOptSolver
getFunction() AbstractPAChangeOperator
Returns the function f.
getFunctionalTerms() LogicStructure
Returns all functional terms that appear in this structure.
getFunctions() RootFinder
Returns the function of this root finder.
getFunctor() FunctionalTerm
getFunctor(String) FolSignature
getFunctor() Aggregate
getFunctors() DelpRule
getFunctors() QuantifiedFormulaSupport
getFunctors() RelationalFormula
getFunctors() AssociativeFOLFormula
getFunctors() Equivalence
getFunctors() ExistsQuantifiedFormula
getFunctors() FOLAtom
getFunctors() FolSignature
getFunctors() ForallQuantifiedFormula
getFunctors() Implication
getFunctors() LogicStructure
Returns all functors that appear in this structure.
getFunctors() Negation
getFunctors() SpecialFormula
getFunctors() ModalFormula
getFunctors() MlnFormula
getFunctors() RelationalConditional
getFunctors() DefaultRule
getFunctors() AnswerSet
getFunctors() AnswerSet
getFunctors() NLPNot
getGroundingRequirements() SActionQuery
Returns all grounding requirements, that have to be met, when this
action query is grounded.
getGtol() OpenOptRootFinder
getGtol() OpenOptSolver
getHeadFormula() CLaw
Returns the headFormula of this causal law.
getHittingSet(Collection<S>, int, Collection<Interpretation<B, S>>) HsInconsistencyMeasure
Determines a hitting set of the given cardinality.
getIdentifier() InferenceRule
Returns the name if it has one, else it returns the hashcode
getIdentifier() CommandParameter
returns this parameters name (the identifier)
getIdentityMatrix(int) Matrix
Returns the identity matrix of the given dimension.
getIfFormula() CLaw
Returns the ifFormula of this causal law.
GetImage() SimpleCharStream
Get token literal value.
GetImage() SimpleCharStream
Get token literal value.
GetImage() SimpleCharStream
Get token literal value.
GetImage() SimpleCharStream
Get token literal value.
GetImage() SimpleCharStream
Get token literal value.
getImagPart() ComplexNumber
Returns the imaginary part of this complex number.
getIn() DefaultSequence
getInconsistencyMeasure(InconsistencyMeasureFactory.Measure) InconsistencyMeasureFactory
Creates a new inconsistency measure of the given type with default
settings.
getInconsistencyMeasureProcess(FormulaStream<S>) DefaultStreamBasedInconsistencyMeasure
getInconsistencyMeasureProcess(FormulaStream<S>) StreamBasedInconsistencyMeasure
Processes the formulas in the given stream one after the other.
getInconsistencyValue() InconsistencyMeasurementProcess
Returns the current inconsistency value of this stream processing or
the last value if the stream processing has finalized.
getIndividuals() DlSignature
getInferenceRule(T, AspicArgumentationTheory<T>) RuleFormulaGenerator
Transforms a formula of type T into a corresponding
defeasible ASPIC inference rule form the knowledge base kb
getInferenceType() RpclMeReasoner
Returns the inference type of this reasoner, i.e.
getInnerActions() AlwaysQuery
getInnerActions() HoldsQuery
getInnerActions() NecessarilyQuery
getInnerActions() QueryProposition
Returns the set of all actions contained in this query proposition.
getInnerActions() SActionQuery
Returns all actions, which occur in action sequences in necessarily
queries in this action query.
getInnerAtoms() SActionQuery
Returns all inner atoms, which occur in state formulas and actions in
this action query.
getInnerFormula() QueryProposition
Returns the inner formula of this query proposition, e.g.
getInnerFormula() AbstractLdoModality
Returns the inner formula of this modality.
getInnerFormulas() SActionQuery
Returns all inner formulas that are contained in query propositions
in this action query.
getInnerVariables() SActionQuery
Returns all inner variables, which occur in state formulas and actions
in this action query.
getInstance() CanonicalUndercut
Returns the singleton instance of this class.
getInstance() Defeat
Returns the singleton instance of this class.
getInstance() DefeatingRebuttal
Returns the singleton instance of this class.
getInstance() DirectDefeat
Returns the singleton instance of this class.
getInstance() DirectUndercut
Returns the singleton instance of this class.
getInstance() Rebuttal
Returns the singleton instance of this class.
getInstance() Undercut
Returns the singleton instance of this class.
getInstance() Attack
Returns the singleton instance of this class.
getInstance() ConfidentAttack
Returns the singleton instance of this class.
getInstance() ConfidentRebut
Returns the singleton instance of this class.
getInstance() Defeat
Returns the singleton instance of this class.
getInstance() Rebut
Returns the singleton instance of this class.
getInstance() StrongAttack
Returns the singleton instance of this class.
getInstance() StrongConfidentAttack
Returns the singleton instance of this class.
getInstance() StrongUndercut
Returns the singleton instance of this class.
getInstance() Undercut
Returns the singleton instance of this class.
getInterval() IntegerCommandParameter
returns each possible selection argument
getIntervalset() Interval
getJamaMatrix() Matrix
Creates the Jama matrix representation of this matrix.
getJustification() DefaultRule
getJustifiedArguments(ArgumentationKnowledgeBase) ArgumentationReasoner
Returns the set of x/y-justified arguments using a bottom-up fixpoint calculation
getKB(String) Utilities
Get knowledge base as a String from the named test resource.
getKernels(Collection<T>, T) KernelProvider
Retrieves the set of kernels for the given formula
from the given set of formulas.
getKernels(Collection<PropositionalFormula>, PropositionalFormula) AbstractPropositionalLogicReasoner
getKnownArguments() BeliefState
Returns the set of known arguments.
getLastAnswerset() CredibilityRevision
getLastProjectedAnswerSet() CredibilityRevision
getLdoArgument() Argument
getLdoFormula() Argument
getLdoFormula() Attack
getLdoFormula() DungEntity
Returns a logical representation of this entity in LDO
(Logic of dialectical outcomes, cf.
getLeft() LdoRelation
getLeftArgument() Arithmetic
getLeftGuard() Aggregate
getLefthand() Comparative
getLeftOperator() Aggregate
getLeftTerm() Statement
Returns the left term of this statement.
getLegalMoves(ArgumentationEnvironment, DialogueTrace<Argument, Extension>) BeliefState
Returns the set of possible moves in the given situation and the given trace.
getLevelingFunction() PreferenceOrder
returns the ranking function for this preference order
getLevelingFunction() Functions
returns the ranking function
getLevelingFunction() LevelingFunction
returns this leveling function
getLine() SimpleCharStream
Deprecated.
getLine() SimpleCharStream
Deprecated.
getLine() SimpleCharStream
Deprecated.
getLine() SimpleCharStream
Deprecated.
getLine() SimpleCharStream
Deprecated.
getListLastDefeasibleRules() AspicArgument
Returns all defeasible subrules of the level where the first defeasible subrule appears,
i.e.
getLiterals() AbstractLdoModality
getLiterals() LdoArgument
getLiterals() LdoAssociativeFormula
getLiterals() LdoFormula
Returns all literals, i.e.
getLiterals() LdoNegation
getLiterals() LdoRelation
getLiterals() AssociativePropositionalFormula
getLiterals() Negation
getLiterals() Proposition
getLiterals() PropositionalFormula
Returns all literals, i.e.
getLiterals() SpecialFormula
getLiterals() Aggregate
getLiterals() Arithmetic
getLiterals() Comparative
getLiterals() DLPAtom
getLiterals() DLPElement
getLiterals() DLPHead
getLiterals() DLPNeg
getLiterals() DLPNot
getLiterals() Rule
getLiteralString(FolFormula, int, boolean) CTransitionSystemCalculator
Utility function representing a single literal either in a direct manner or
using default negation.
getLiteralsWithName(String) AnswerSet
getLiteralsWithName(String) AnswerSet
getLogLevel(String) TweetyConfiguration.LogLevel
Returns the log level described by the given string.
getLowerBound() AbstractCreepingMachineShop
Retrieves the lower bound for delta for this machine shop.
getLowerBound() PenalizingCreepingMachineShop
getLowerBound() SmoothedPenalizingCreepingMachineShop
getLowerBound() UnbiasedCreepingMachineShop
getLowerBound() TrainingParameter
Returns the lower bound of this parameter.
getLowerBound() Interval
getLowerBound() Variable
Returns the lower bound of this variable.
getLowerReferenceArguments() AbstractGraphLdoModality
Returns the lower reference arguments of this modality.
getLpT(CActionDescription, ActionSignature, int) CTransitionSystemCalculator
Calculates an extended logic programm lp_T(D) for a given action
description D and a parameter T, which corresponds to the length of
histories in the transition system described by D.
getMapping(HerbrandInterpretation, Set<Predicate>, Set<Set<Constant>>) ReferenceWorld
Determines the reference world of the given interpretation wrt.
getMarking() DialecticalTree
Computes the marking of this node by considering the marking of all child nodes
getMaxFunEvals() OpenOptSolver
getMaximallyAcceptedArguments(Collection<Argument>) ArgumentRanking
Returns the set of all arguments a from the given
set that are maximally accepted, i.e.
getMaximums() Statement
Returns all maximums of this statement.
getMaximums() AssociativeOperation
getMaximums() Constant
getMaximums() Difference
getMaximums() Fraction
getMaximums() FunctionalTerm
getMaximums() Maximum
getMaximums() Minimum
getMaximums() Term
Returns all maximums of this term.
getMaximums() Variable
getMaximumValue(PclBeliefSet, ProbabilisticConditional, double) MeanDistanceCulpabilityMeasure
Determines the maximal value for the given conditional.
getMaxIter() OpenOptSolver
getMaxLength() BeliefSetSampler
Returns the max length of kbs of this sampler.
getMdAnticover(List<Set<S>>, int, Set<Set<Set<S>>>) McscInconsistencyMeasure
Recursively determines sets of minimal correction sets that have an empty intersection
(= the complements of maximal consistent sets where the union equals the knowledge base;
we call it MD-anticover).
getMeasure(String) InconsistencyMeasureFactory.Measure
getMessage() TokenMgrError
You can also modify the body of this method to customize your error messages.
getMessage() TokenMgrError
You can also modify the body of this method to customize your error messages.
getMessage() TokenMgrError
You can also modify the body of this method to customize your error messages.
getMessage() TokenMgrError
You can also modify the body of this method to customize your error messages.
getMessage() ProblemInconsistentException
getMessage() TokenMgrError
You can also modify the body of this method to customize your error messages.
getMiComponents(Collection<S>) AbstractMusEnumerator
getMiComponents(Collection<S>) MusEnumerator
Computes the maximal (wrt.
getMinimallyAcceptedArguments(Collection<Argument>) ArgumentRanking
Returns the set of all arguments a from the given
set that are minimally accepted, i.e.
getMinimums() Statement
Returns all minimums of this statement.
getMinimums() ConstraintSatisfactionProblem
Returns all minimums appearing in this problem.
getMinimums() OptimizationProblem
getMinimums() AssociativeOperation
getMinimums() Constant
getMinimums() Difference
getMinimums() Fraction
getMinimums() FunctionalTerm
getMinimums() Maximum
getMinimums() Minimum
getMinimums() Term
Returns all minimums of this term.
getMinimums() Variable
getMinimumValue(PclBeliefSet, ProbabilisticConditional, double) MeanDistanceCulpabilityMeasure
Determines the minimal value for the given conditional.
getMinLength() BeliefSetSampler
Returns the min length of kbs of this sampler.
getModel(ABATheory<T>) GeneralABAReasoner
getModel(DungTheory) AbstractExtensionReasoner
getModel(DungTheory) AbstractSatExtensionReasoner
getModel(DungTheory) GrossiModgilRankingReasoner
getModel(DungTheory) ProboReasoner
getModel(DungTheory) SimpleAdmissibleReasoner
getModel(DungTheory) SimpleCF2Reasoner
getModel(DungTheory) SimpleCompleteReasoner
getModel(DungTheory) SimpleConflictFreeReasoner
getModel(DungTheory) SimpleGroundedReasoner
getModel(DungTheory) SimpleIdealReasoner
getModel(DungTheory) SimplePreferredReasoner
getModel(DungTheory) SimpleSccCompleteReasoner
getModel(DungTheory) SimpleSemiStableReasoner
getModel(DungTheory) SimpleStableReasoner
getModel(DungTheory) SimpleStageReasoner
getModel(DungTheory) StratifiedLabelingReasoner
getModel(DungTheory) ProbabilisticRankingReasoner
getModel(SocialAbstractArgumentationFramework) IssReasoner
getModel(B) ModelProvider
Returns a single (dedicated) model of the given belief base.
getModel(ClBeliefSet) AbstractConditionalLogicReasoner
getModel(ClBeliefSet) BruteForceCReasoner
getModel(ClBeliefSet) CReasoner
getModel(ClBeliefSet) RuleBasedCReasoner
getModel(ClBeliefSet) ZReasoner
getModel(PclBeliefSet) AbstractPclReasoner
getModel(PclBeliefSet) DefaultMeReasoner
getModel(PclBeliefSet, PropositionalSignature) DefaultMeReasoner
Computes the ME-distribution this reasoner bases on.
getModel(PclBeliefSet) GeneralizedMeReasoner
getModel(PclBeliefSet, PropositionalSignature) GeneralizedMeReasoner
Computes the ME-distribution this reasoner bases on.
getModel(RclBeliefSet) RelationalBruteForceCReasoner
getModel(RclBeliefSet, FolSignature) RelationalBruteForceCReasoner
Retrieves the C representation of the given belief set wrt.
getModel(DefaultTheory) NaiveDefaultReasoner
getModel(RpclBeliefSet) RpclMeReasoner
getModel(RpclBeliefSet, FolSignature) RpclMeReasoner
Determines the ME distribution of the given knowlege base
wrt.
getModels(ABATheory<T>) CompleteReasoner
getModels(ABATheory<T>) FlatABAReasoner
getModels(ABATheory<T>) GeneralABAReasoner
getModels(ABATheory<T>) IdealReasoner
getModels(ABATheory<T>) PreferredReasoner
getModels(ABATheory<T>) StableReasoner
getModels(ABATheory<T>) WellFoundedReasoner
getModels(DungTheory) AbstractExtensionReasoner
getModels(DungTheory) AbstractSatExtensionReasoner
getModels(DungTheory) GrossiModgilRankingReasoner
getModels(DungTheory) ProboReasoner
getModels(DungTheory) SimpleAdmissibleReasoner
getModels(DungTheory) SimpleCF2Reasoner
getModels(DungTheory) SimpleCompleteReasoner
getModels(DungTheory) SimpleConflictFreeReasoner
getModels(DungTheory) SimpleGroundedReasoner
getModels(DungTheory) SimpleIdealReasoner
getModels(DungTheory) SimplePreferredReasoner
getModels(DungTheory) SimpleSccCompleteReasoner
getModels(DungTheory) SimpleSemiStableReasoner
getModels(DungTheory) SimpleStableReasoner
getModels(DungTheory) SimpleStageReasoner
getModels(DungTheory) StratifiedLabelingReasoner
getModels(DungTheory) ProbabilisticRankingReasoner
getModels(SocialAbstractArgumentationFramework) IssReasoner
getModels(B) ModelProvider
Returns a characterizing model of the given belief base
getModels(ClBeliefSet) AbstractConditionalLogicReasoner
getModels(PclBeliefSet) AbstractPclReasoner
getModels(PclBeliefSet) DefaultMeReasoner
getModels(PclBeliefSet) GeneralizedMeReasoner
getModels(PropositionalSignature) Conjunction
getModels(PropositionalSignature) Contradiction
getModels(PropositionalSignature) Disjunction
getModels(PropositionalSignature) Negation
getModels(PropositionalSignature) Proposition
getModels() PropositionalFormula
Returns the set of models of this formula wrt.
getModels(PropositionalSignature) PropositionalFormula
Returns the set of models of this formula wrt.
getModels(PropositionalSignature) Tautology
getModels(RclBeliefSet) RelationalBruteForceCReasoner
getModels(DefaultTheory) NaiveDefaultReasoner
getModels(RpclBeliefSet) RpclMeReasoner
getMultiAgentSystem() AbstractProtocol
Returns the multi-agent system this protocol operates on.
getMultiAgentSystem() ActionEvent
getMultiplicator(FolFormula) ReferenceWorld
Returns the multiplicator of this reference world for the given formula,
i.e.
getMultiplicatorForConjunction(FolFormula) ReferenceWorld
Returns the multiplicator of this reference world for the given formula
(which is a conjunction of literals or a single literal),
i.e.
getName() ActionName
Returns the name of this action.
getName() FluentName
Returns the name of this fluent.
getName() FolAction
getName() Agent
Returns the name of this agent.
getName() InferenceRule
Returns the name
getName() LdoArgument
getName() Argument
returns the name of the argument
getName() Postulate
The textual name of the postulate
getName() Atom
getName() TypedStructure
getName() Sort
getName() TypedStructureAdapter
getName() FOLAtom
getName() ImFreeFormulaIndependence
getName() ImMonotony
getName() Proposition
getName() DLPAtom
getName() DLPNeg
getName() TrainingParameter
Returns the name of this parameter.
getName() Variable
Returns the name of this variable.
getNativeShell() Shell
a wrapper for the os' native shell
getNecessarilyQueryMinusFirstAction(NecessarilyQuery) SActionQuerySatisfactionTester
For a given necessarily query of the form
necessarily F after A_0 ; A_1 ; ...
getNegations() ABATheory
getNegative(Argument) SocialAbstractArgumentationFramework
Returns the number of negative votes of the given argument
getNeighbors(Argument) DungTheory
getNeighbors(T) DefaultGraph
getNeighbors(T) Graph
Returns the set of neighbors of the given node.
getNextToken() DelpParser
Get the next Token.
getNextToken() DelpParserTokenManager
Get the next Token.
getNextToken() RpclCondensedProbabilityDistributionParser
Get the next Token.
getNextToken() RpclCondensedProbabilityDistributionParserTokenManager
Get the next Token.
getNextToken() RpclProbabilityDistributionParser
Get the next Token.
getNextToken() RpclProbabilityDistributionParserTokenManager
Get the next Token.
getNextToken() ASPParser
Get the next Token.
getNextToken() ASPParserTokenManager
Get the next Token.
getNextToken() POParser
Get the next Token.
getNextToken() POParserTokenManager
Get the next Token.
getNextToken() UPParser
Get the next Token.
getNextToken() UPParserTokenManager
Get the next Token.
getNodeA() Edge
Returns the first node of this edge.
getNodeB() Edge
Returns the second node of this edge.
getNodes() DungTheory
getNodes() DefaultGraph
getNodes() Graph
Returns the nodes of this graph.
getNodes() AccessibilityRelation
Returns all interpretations of the accessibility relation.
getNorm() AbstractPAChangeOperator
Returns the norm.
getNumberOfNodes() DungTheory
getNumberOfNodes() DefaultGraph
getNumberOfNodes() Graph
Returns the number of nodes in this graph.
getNumberOfOccurences(FolFormula, Predicate, Collection<? extends Constant>, boolean) ReferenceWorld
Determines the number of occurrences of instances of predicate "p" with a constant in "constants".
getNumOfMinmalProofs(PropositionalFormula, Collection<PropositionalFormula>) PmInconsistencyMeasure
Returns the number of minimal proofs of f in formulas.
getObj1() Quadruple
returns the first element of this quadruple
getObj2() Quadruple
returns the second element of this quadruple
getObj3() Quadruple
returns the third element of this quadruple
getObj4() Quadruple
returns the fourth element of this quadruple
getObject() Writer
Returns the object of this writer.
getObservations(T) TrainingSet
Returns all observations of the given category.
getOnes(int, int) OjAlgoMathUtils
Create (m,n)-matrix containing only ones.
getOpenLiterals(Collection<Rule>) ArgumentationKnowledgeBase
Returns the set of non-default-negated literals that are part of the premise
of some rule but not the conclusion of some other rule
getOpenOptCode() OpenOptRootFinder
Builds the OpenOpt code for the given problem which can be interpreted by a python.
getOpenOptCode(OptimizationProblem) OpenOptSolver
Builds the OpenOpt code for the given problem which can be interpreted
by a python.
getOperation() Update
returns the second element of this quadruple
getOperator() Arithmetic
getOperator() Comparative
getOperatorSymbol() LdoConjunction
getOperatorSymbol() LdoDisjunction
getOperatorSymbol() AssociativeFormulaSupport.AssociativeSupportBridge
getOperatorSymbol() Conjunction
getOperatorSymbol() Disjunction
getOperatorSymbol() Conjunction
getOperatorSymbol() Disjunction
getOperatorSymbol() DLPHead
getOptimalInterpretation(Collection<PropositionalFormula>) FuzzyInconsistencyMeasure
Returns an optimal interpretation as a witness for the inconsistency value.
getOptimizedWorld() NicePossibleWorld
getOrder() AspicArgumentationTheory
getOrdinaryPremises() AspicArgument
getOut() DefaultSequence
getOutparents(DungTheory, Collection<Argument>) SimpleCF2Reasoner
Returns the set { a in A | a nicht in S und a -> S }
getOutput(StructuredArgumentationFramework) OutputReasoner
Returns the output this reasoner bases upon.
getOutput() AspInterface
This method returns the output of a previously called
answer set solver tools.
getOutput() AspInterface.StreamFlusher
getOutput() PluginOutput
getOverruledArguments(ArgumentationKnowledgeBase) ArgumentationReasoner
Returns the set of overruled arguments, i.e.
getParameter(TrainingParameter) ParameterSet
Returns the parameter of this set with the same name as the given
parameter (or throws an IllegalArgumentException)
getParameters() AbstractTweetyPlugin
returns all possible parameters
getParameters() TweetyPlugin
returns parameters allowed with plugin calls
getParameters() PreferencesPlugin
getParameterSet() ParameterTrainer
getParameterSet() MultiClassRbfTrainer
getParameterSet() Trainer
Returns the set of parameters for this trainer.
getParents(Node) DungTheory
getParents(Node) DefaultGraph
getParents(Node) Graph
Returns the set of parents (node connected via an undirected edge or a directed edge
where the given node is the child) of the given node.
getParser(FileFormat) AbstractDungParser
Retrieves the parser for the given file format.
getParserForFormat(PlParserFactory.Format) PlParserFactory
Retrieves an appropriate parser for the given format.
getPerceivedDungTheory(Extension) ArgumentationEnvironment
Returns the view of the universal Dung theory restricted to
the given set of arguments.
getPerceivedDungTheory(Extension) LotteryArgumentationEnvironment
Returns the view of the universal Dung theory restricted to
the given set of arguments.
getPercepts(Agent) ArgumentationEnvironment
getPercepts(Agent) LotteryArgumentationEnvironment
getPercepts(Agent) DeductiveEnvironment
getPercepts(Agent) StructuredArgumentationSystem.SasEnvironment
getPercepts(Agent) Environment
Retrieves the current percepts for the given agent.
getPositive(Argument) SocialAbstractArgumentationFramework
Returns the number of positive votes of the given argument
getPositiveFluents() State
Returns the set of fluent atoms that are mapped to true by this state.
getPossibleArguments() SasAgent
Returns the set of arguments this agent may bring forward.
getPossibleInterpretations() RelationalRankingFunction
Returns all interpretations that are mapped to a rank
unequal to INFINITY.
getPossibleOutcomes() ArgumentationLottery
Returns the set of possible outcomes.
getPossibleOutcomes() LdoArgumentationLottery
Returns the set of possible outcomes.
getPossibleWorlds() ConditionalStructure
getPossibleWorlds() RankingFunction
Returns all interpretations that are mapped to a rank
unequal to INFINITY.
getPredecessors(Map.Entry<T, Integer>) Functions
returns a set of predecessor elements for the given entry
getPredicate() LdoArgument
getPredicate() Atom
getPredicate() FOLAtom
Returns the predicate of this atom
getPredicate(String) FolSignature
getPredicate() Proposition
getPredicate() InstanceAssignment
Returns the predicate of this assignment.
getPredicate() DLPAtom
getPredicate() DLPNeg
getPredicateCls() LdoFormula
getPredicateCls() Conditional
getPredicateCls() AssociativeFormulaSupport
getPredicateCls() SimpleLogicalFormula
getPredicateCls() RelationalFormula
getPredicateCls() PropositionalFormula
getPredicateCls() DLPElementAdapter
getPredicateCls() DLPHead
getPredicateCls() DLPNot
getPredicateCls() NLPRule
getPredicates() DelpRule
getPredicates() AbstractGraphLdoModality
getPredicates() AbstractLdoModality
getPredicates() LdoArgument
getPredicates() LdoAssociativeFormula
getPredicates() LdoFormula
getPredicates() LdoNegation
getPredicates() LdoRelation
getPredicates() Conditional
getPredicates() AssociativeFormulaSupport
getPredicates() SimpleLogicalFormula
Processes the set of all predicates which appear in this
formula
getPredicates() QuantifiedFormulaSupport
getPredicates() AssociativeFOLFormula
getPredicates() Equivalence
getPredicates() ExistsQuantifiedFormula
getPredicates() FOLAtom
getPredicates() FolSignature
getPredicates() ForallQuantifiedFormula
getPredicates() Implication
getPredicates() Negation
getPredicates() SpecialFormula
getPredicates() ModalFormula
getPredicates() MlnFormula
getPredicates() AssociativePropositionalFormula
getPredicates() Negation
getPredicates() Proposition
getPredicates() PropositionalFormula
getPredicates() SpecialFormula
getPredicates() RelationalConditional
getPredicates() DefaultRule
getPredicates() Aggregate
getPredicates() Arithmetic
getPredicates() Comparative
getPredicates() DLPAtom
getPredicates() DLPElement
getPredicates() DLPHead
getPredicates() DLPNeg
getPredicates() DLPNot
getPredicates() Rule
getPredicates() NLPNot
getPredicates() NLPRule
getPreferenceOrderIndex() Update
returns the first element of this quadruple
getPreimage(Argument) RecognitionFunction
Returns the argument which maps to the set containing
the given argument.
getPremise() Assumption
getPremise() InferenceRule
getPremise() InferenceRule
getPremise() SimplePlRule
getPremise() DelpRule
getPremise() BasicArgument
getPremise() Rule
Returns the premise of this rule.
getPremise() Conditional
getPremise() RelationalConditional
getPremise() Rule
getPremise() NLPRule
getPremise() AssociationRule
Returns the premise of this rule.
getPremises() RuleSet
Returns all premises appearing in this rule set.
getPrerequisite() DefaultRule
getPrimeImplicants() PropositionalFormula
Returns the set of prime implicants of this formula.
getProbability(Argument) ProbabilisticArgumentationFramework
Returns the probability of the given argument.
getProbability(Attack) ProbabilisticArgumentationFramework
Returns the probability of the given attack.
getProbability(DungTheory) ProbabilisticArgumentationFramework
Computes the probability of the given AAF wrt.
getProbability() ProbabilisticConditional
Returns the probability of this conditional.
getProbability() RelationalProbabilisticConditional
Returns the probability of this conditional.
getProbabilityVector() ProbabilityFunction
Returns the vector of probabilities, depending on the order
of the domain elements (which can be ordered as they
implement Comparable).
getProbabilityVectorAsDoubles() ProbabilityFunction
Returns the vector of probabilities, depending on the order
of the domain elements (which can be ordered as they
implement Comparable).
getProblem(String) ProboProblem
Returns the problem instance that corresponds to the given abbreviation.
getProblems(String) ProboProblem
Returns a collection of problems parsed from the given string which
has to be in the format "[problem1,...,problemn]".
getProcesses() DefaultProcessTree
getProducts() AssociativeOperation
getProducts() Constant
getProducts() Difference
getProducts() Fraction
getProducts() FunctionalTerm
getProducts() Product
getProducts() Term
Returns all products of this term.
getProducts() Variable
getPropositionalCharacterisation(DungTheory) AbstractSatExtensionReasoner
Creates a propositional representation of the set of labelings of the given
Dung theory that are consistent with the given semantics.
getPropositionalCharacterisationBySemantics(DungTheory, Map<Argument, Proposition>, Map<Argument, Proposition>, Map<Argument, Proposition>) AbstractSatExtensionReasoner
Returns the semantic-specific propositional characterization of the underlying Dung
theory, see getPropositionalCharacterisation.
getPropositionalCharacterisationBySemantics(DungTheory, Map<Argument, Proposition>, Map<Argument, Proposition>, Map<Argument, Proposition>) SatCompleteReasoner
getPropositionalCharacterisationBySemantics(DungTheory, Map<Argument, Proposition>, Map<Argument, Proposition>, Map<Argument, Proposition>) SatStableReasoner
getPrototypes(RelationalConditional) RelationalRankingFunction
Returns the set of instances with prototypes.
getQuantifiedFormulas() ExistsQuantifiedFormula
getQuantifiedFormulas() ForallQuantifiedFormula
getQuantifiedFormulas() SpecialFormula
getQuantifierVariables() DelpRule
getQuantifierVariables() QuantifiedFormula
getQuantifierVariables() QuantifiedFormulaSupport
Returns the variables of this quantified formula.
getQuantifierVariables() AssociativeFOLFormula
getQuantifierVariables() ExistsQuantifiedFormula
getQuantifierVariables() FolFormula
getQuantifierVariables() ForallQuantifiedFormula
getQuantifierVariables() ModalFormula
getQuantifierVariables() MlnFormula
getQuantifierVariables() RelationalConditional
getQuantifierVariables() DefaultRule
getQueryPartRules(PropositionalFormula) SActionQuerySatisfactionTester
Calculates the translation of an action query to rules of a normal logic
program according to the translation sheme presented in [1].
getQueryParts(PropositionalFormula) SActionQuerySatisfactionTester
Calculates the set of all subformulas of an action query down to
propositions (holds, always, necessarily)
getQueryPropositionPartRules(QueryProposition) SActionQuerySatisfactionTester
Calculatesthe translation of a query proposition (holds, always,
necessarily) to rules of a normal logic program.
getQueryPropositions(SActionQuery) SActionQuerySatisfactionTester
Calculates the set of all query propositions which appear in the given
query.
getRandom() GroundedGameAgentGenerator
Returns the random number generator.
getRandomDistribution(RpclSemantics, FolSignature, Set<Set<Constant>>) CondensedProbabilityDistribution
Returns a random distribution on the given signature.
getRankConstraint(PossibleWorld, IntegerVariable, Map<Conditional, IntegerVariable>, Map<Conditional, IntegerVariable>) CReasoner
For the given interpretation "i" and the given kappas, this method
computes the constraint
getRankingFunction() LevelingFunction
returns a new RankingFunction based on this LevelingFunction
getRankingFunction() RankingFunction
returns the ranking function
getRealPart() ComplexNumber
Returns the real part of this complex number.
getRelationSymbol() Equation
getRelationSymbol() Inequation
getRelationSymbol() Statement
Returns the relation symbol of this statement.
getRepresentationStructure() NicePossibleWorld
getRestriction(Collection<Argument>) DungTheory
getRestriction(Collection<T>) DefaultGraph
getRestriction(Collection<T>) Graph
Returns copy of this graph consisting only of the given
nodes and all corresponding edges.
getResult() Arithmetic
getResult() UpdateEvent
returns the result for this update event
getRight() LdoRelation
getRightArgument() Arithmetic
getRightGuard() Aggregate
getRighthand() Comparative
getRightOperator() Aggregate
getRightTerm() Statement
Returns the right term of this statement.
getRoles() DlSignature
getRoot() ArgumentTree
Returns the root node of this tree.
getRule() Deduction
getRuleBodyString(FolFormula, int, boolean) CTransitionSystemCalculator
Calculates the representation of an inner formula of a causal rule
according to the translation in
"Representing Transition Systems by Logic Programs.".
getRuleFormula(DefeasibleInferenceRule<FolFormula>) FolFormulaGenerator
getRuleFormula(DefeasibleInferenceRule<PropositionalFormula>) PlFormulaGenerator
getRuleFormula(DefeasibleInferenceRule<T>) RuleFormulaGenerator
Transforms a defeasible ASPIC inference rule into a corresponding formula
of type T
getRuleFormulaGenerator() AspicArgumentationTheory
Returns the generator to transform rules into words of the language they range over
getRules(Collection<SActionQuery>) SActionQuerySatisfactionTester
Returns the basic translation of action query laws to rules in the logic
program.
getRules() ABATheory
getRules() Deduction
getRulesWithConclusion(Formula) RuleSet
Returns all rules this set with the given conclusion
getRulesWithHead(FolFormula) ArgumentCompletion
getRulesWithHead(FolFormula) DefeasibleLogicProgram
Returns all defeasible and strict rules appearing in this program with the given literal as head
getRulesWithHead(FolFormula) DelpArgument
Returns all defeasible rules of the support of this argument with the given literal as head
getSatisfactionRatio() RelationalFormula
Returns the ratio of worlds not satisfying this formula to
worlds satisfying this formula.
getSatisfactionStatement(RelationalProbabilisticConditional, FolSignature, Map<Interpretation<FolBeliefSet, FolFormula>, FloatVariable>) AbstractRpclSemantics
getSatisfactionStatement(RelationalProbabilisticConditional, FolSignature, Map<Interpretation<FolBeliefSet, FolFormula>, FloatVariable>) AggregatingSemantics
getSatisfactionStatement(RelationalProbabilisticConditional, FolSignature, Map<Interpretation<FolBeliefSet, FolFormula>, FloatVariable>) AveragingSemantics
getSatisfactionStatement(RelationalProbabilisticConditional, FolSignature, Map<Interpretation<FolBeliefSet, FolFormula>, FloatVariable>) RpclSemantics
Returns the mathematical statement corresponding to the satisfaction
of the given conditional wrt.
getSatisfactionStatements(DungTheory, Map<Collection<Argument>, FloatVariable>) AbstractPASemantics
getSatisfactionStatements(DungTheory, Map<Collection<Argument>, FloatVariable>) CoherentPASemantics
getSatisfactionStatements(DungTheory, Map<Collection<Argument>, FloatVariable>) FoundedPASemantics
getSatisfactionStatements(DungTheory, Map<Collection<Argument>, FloatVariable>) InvolutaryPASemantics
getSatisfactionStatements(DungTheory, Map<Collection<Argument>, FloatVariable>) JustifiablePASemantics
getSatisfactionStatements(DungTheory, Map<Collection<Argument>, FloatVariable>) NeutralPASemantics
getSatisfactionStatements(DungTheory, Map<Collection<Argument>, FloatVariable>) OptimisticPASemantics
getSatisfactionStatements(DungTheory, Map<Collection<Argument>, FloatVariable>) PASemantics
Returns the mathematical statement corresponding to the satisfaction
of the given theory wrt.
getSatisfactionStatements(DungTheory, Map<Collection<Argument>, FloatVariable>) RationalPASemantics
getSatisfactionStatements(DungTheory, Map<Collection<Argument>, FloatVariable>) SemiFoundedPASemantics
getSatisfactionStatements(DungTheory, Map<Collection<Argument>, FloatVariable>) SemiOptimisticPASemantics
getScreen() ScreenedRemainderSets
Returns the screened rules that are contained in every remainder set.
getScriptLocation() MleanCoPReasoner
Get the mleancop.sh path.
getSecond() Pair
returns the second element of this pair
getSecond() Triple
returns the second element of this triple
getSelections() SelectionCommandParameter
returns each possible selection argument
getSemantics() AbstractLotteryAgent
Returns the semantics.
getSemantics() AbstractPAChangeOperator
Returns the semantics.
getSemantics() ArgumentationLottery
Returns the used semantics.
getSemantics() LdoArgumentationLottery
Returns the used semantics.
getSemantics() AbstractPafReasoner
The semantics of this reasoner.
getSemantics() RpclProbabilityDistribution
Returns the semantics of this distribution.
getSet() SubsetIterator
Returns the set this iterator is iterating over.
getSignature() CParser
getSignature() CActionDescription
getSignature() CLaw
getSignature() DynamicLaw
getSignature() StaticLaw
getSignature() SActionQuery
getSignature() SActionQuerySet
getSignature() TransitionSystem
Returns the action signature of this transition system.
getSignature() ABATheory
getSignature() Assumption
getSignature() InferenceRule
getSignature() Negation
getSignature() AspicArgumentationTheory
getSignature() InferenceRule
getSignature() SimplePlLogicDeductiveKnowledgebase
getSignature() SimplePlRule
getSignature() DelpParser
getSignature() DefeasibleLogicProgram
getSignature() DelpArgument
Always null.
getSignature() DelpRule
getSignature() LdoArgument
getSignature() LdoAssociativeFormula
getSignature() LdoFormula
getSignature() LdoNegation
getSignature() Argument
getSignature() Attack
getSignature() DungTheory
getSignature() Argument
getSignature() ArgumentationKnowledgeBase
getSignature() PartialProbabilityAssignment
getSignature() BasicArgument
getSignature() StructuredArgumentationFramework
getSignature() RevisionComparePresenter.MockFormula
getSignature() CrMasBeliefSet
getSignature() InformationObject
getSignature() BeliefBase
Returns the signature of the language of this knowledge base.
getSignature() BeliefSet
getSignature() BeliefSetSampler
Returns the signature of this sampler.
getSignature() Formula
Returns the signature of the language of this formula.
getSignature() FormulaSampler
Returns the signature of this sampler.
getSignature() Rule
getSignature() ConditionalStructure
getSignature() RankingFunction
Returns the signature of the first-order language this ranking function
is defined on.
getSignature() ClBeliefSet
getSignature() Conditional
getSignature() AssociativeFormulaSupport
getSignature() LogicProgram
getSignature() RelationalFormula
getSignature() Axiom
getSignature() FolParser
Returns the signature of this parser.
getSignature() TPTPParser
Returns the signature of this parser.
getSignature() FolBeliefSet
getSignature() FolFormula
getSignature() ModalParser
Returns the signature of this parser.
getSignature() ModalBeliefSet
getSignature() ModalFormula
getSignature() MarkovLogicNetwork
getSignature() MlnFormula
getSignature() ProbabilityDistribution
Returns the signature of the underlying language.
getSignature() PclBeliefSet
getSignature() AssociativePropositionalFormula
getSignature() Negation
getSignature() PlBeliefSet
getSignature() Proposition
getSignature() PropositionalFormula
getSignature(Collection<? extends PropositionalFormula>) PropositionalSignature
Returns the set of atoms appearing in the given collection of formulas
getSignature() RclParser
Returns the signature of this parser.
getSignature() RclBeliefSet
getSignature() RelationalConditional
getSignature() DefaultRule
getSignature() DefaultTheory
getSignature() RpclParser
Returns the signature of this parser.
getSignature() RpclProbabilityDistribution
Returns the signature of the underlying language.
getSignature() RpclBeliefSet
getSignature() AnswerSet
getSignature() Aggregate
getSignature() Arithmetic
getSignature() Comparative
getSignature() DLPAtom
getSignature() DLPElement
getSignature() DLPHead
getSignature() DLPNeg
getSignature() DLPNot
getSignature() Program
getSignature() Rule
getSignature() AnswerSet
getSignature() NLPProgram
getSignature() NLPRule
getSimpleReasonerForSemantics(Semantics) AbstractExtensionReasoner
Creates a reasoner for the given semantics.
getSolver() OpenOptSolver
getSort() Term
getSort() TermAdapter
getSort(String) FolSignature
getSorts() FolSignature
getSource() InformationObject
Returns the source of this information object.
getSourceBeliefBase() RemainderSets
Returns the belief base that seeded this remainder set.
getSourceBeliefBase() ScreenedRemainderSets
Returns the original program p for which this set represents the
set of remainder sets.
getStandardDivisions(DungTheory) Division
Returns the standard set of divisions of the given argumentation theory, i.e.
getStartingPoint() RootFinder
Returns the starting point of this finder.
getState(Set<FOLAtom>) TransitionSystem
Returns the state that maps the given fluents to true, if it exists,
otherwise null.
getStatePartRules(FolFormula) SActionQuerySatisfactionTester
This function translates a propositional formula into a logic program
according to certain rules.
getStateParts(FolFormula) SActionQuerySatisfactionTester
Calculates the set of all possible parts of the propositional formula
given.
getStates() TransitionSystem
Returns all states contained in this transition system.
getStaticLaws() CActionDescription
Returns a set of all static laws contained in this action description.
getStrictClosure(Set<FolFormula>, Set<DefeasibleRule>, boolean) DefeasibleLogicProgram
Computes the strict closure of the program, i.e., the set of all strictly derivable literals.
getStrictClosure(Set<FolFormula>, Set<DefeasibleRule>) DefeasibleLogicProgram
Computes the strict closure of the program, i.e., the set of all strictly derivable literals.
getStrictClosure(Set<FolFormula>) DefeasibleLogicProgram
Computes the strict closure of the program, i.e., the set of all strictly derivable literals.
getStrictClosure() DefeasibleLogicProgram
Computes the strict closure of the program, i.e., the set of all strictly derivable literals.
getStronglyConnectedComponents() DungTheory
getStronglyConnectedComponents() DefaultGraph
getStronglyConnectedComponents(Graph<S>) DefaultGraph
Returns the strongly connected components of the given graph.
getStronglyConnectedComponents() Graph
Returns the strongly connected components of this graph.
getStronglyConnectedComponentsRec(int, S, Stack<S>, Collection<Collection<S>>, Graph<S>, Map<S, Integer>, Map<S, Integer>) DefaultGraph
Main method for computing the strongly connected components using
Tarjan's algorithm.
getSubgraphProbabilityFunction() ProbabilisticArgumentationFramework
Returns the complete subgraph probability function on the subgraphs
of this PAF, assuming independence between probabilities of all
arguments and attacks.
getSubgraphs() DungTheory
getSubgraphs() DefaultGraph
getSubgraphs(Graph<S>) DefaultGraph
Returns the set of sub graphs of the given graph.
getSubgraphs() Graph
Returns the set of sub graphs of this graph.
getSubsets(T, S) ShapleyCulpabilityMeasure
Computes all pairs (k,k') of knowledge bases k,k'\subseteq kb, such that k = k' \cup {pc}.
getSubTerms() KappaMin
getSubTerms() KappaSum
getSubTerms() KappaTerm
Processes all the sub-terms
getSubTerms() KappaValue
getSuccessors(Interpretation<FolBeliefSet, FolFormula>) AccessibilityRelation
Returns all interpretations that are accessible to a given interpretation i.
getSuccessors(Map.Entry<T, Integer>) Functions
returns a set of successor elements for the given entry
GetSuffix(int) SimpleCharStream
Get the suffix.
GetSuffix(int) SimpleCharStream
Get the suffix.
GetSuffix(int) SimpleCharStream
Get the suffix.
GetSuffix(int) SimpleCharStream
Get the suffix.
GetSuffix(int) SimpleCharStream
Get the suffix.
getSupport() DeductiveArgument
Returns the support of this argument.
getSupport() SimplePlLogicArgument
getSupport() DelpArgument
returns the support of this argument
getSymbol() DefeasibleRule
getSymbol() DelpFact
getSymbol() DelpRule
getSymbol() StrictRule
getSymbolArrow() ABAParser
getSymbolComma() ABAParser
getSymbolicSet() Aggregate
getSymbolTrue() ABAParser
getSyntacticModule(Formula) RuleSet
Returns the maximal subset of this rule set that is closed under
"syntactic" neighbourhood relationship for the given formula.
getSyntaxComponents() PlBeliefSet
Returns the set of syntax components of this belief set, i.e.
getTabSize(int) SimpleCharStream
getTabSize(int) SimpleCharStream
getTabSize(int) SimpleCharStream
getTabSize(int) SimpleCharStream
getTabSize(int) SimpleCharStream
getTargetFunction() OptimizationProblem
Returns the target function of this problem.
getTargetSort() Functor
Returns the sort of this functor
getTerm(PropositionalFormula, Map<Proposition, Variable>) FuzzyInconsistencyMeasure
Returns a mathematical term representation of the given formula by replacing
proposition by their given mathematical variables and replacing conjunction, disjunction,
and negation by their fuzzy counterparts (taking the given t-norm and t-conorm into account).
getTerm(int) DLPAtom
getTerm(Vector<Term>) EntropyFunction
getTerm(Vector<Term>) SimpleRealValuedFunction
getTerm() FunctionalTerm
Returns the inner term.
getTerms() DelpRule
getTerms(Class<C>) DelpRule
getTerms() AssociativeFormulaSupport
getTerms(Class<C>) AssociativeFormulaSupport
getTerms(Class<C>) ComplexLogicalFormulaAdapter
getTerms() FunctionalTerm
getTerms(Class<C>) FunctionalTerm
getTerms() LogicStructure
getTerms(Class<C>) LogicStructure
Processes the set containing all terms of type C.
getTerms() QuantifiedFormulaSupport
getTerms(Class<C>) QuantifiedFormulaSupport
getTerms() Sort
getTerms(Class<C>) Sort
getTerms() TermAdapter
getTerms(Class<C>) TermAdapter
getTerms() AssociativeFOLFormula
getTerms(Class<C>) AssociativeFOLFormula
getTerms() Equivalence
getTerms(Class<C>) Equivalence
getTerms() ExistsQuantifiedFormula
getTerms(Class<C>) ExistsQuantifiedFormula
getTerms() FOLAtom
getTerms(Class<C>) FOLAtom
getTerms() ForallQuantifiedFormula
getTerms(Class<C>) ForallQuantifiedFormula
getTerms() Implication
getTerms(Class<C>) Implication
getTerms() Negation
getTerms(Class<C>) Negation
getTerms() SpecialFormula
getTerms(Class<C>) SpecialFormula
getTerms() ModalFormula
getTerms(Class<C>) ModalFormula
getTerms() MlnFormula
getTerms(Class<C>) MlnFormula
getTerms() RelationalConditional
getTerms(Class<C>) RelationalConditional
getTerms() DefaultRule
getTerms(Class<C>) DefaultRule
getTerms() Aggregate
getTerms() Arithmetic
getTerms() Comparative
getTerms() DLPAtom
getTerms() DLPHead
getTerms() DLPNeg
getTerms() DLPNot
getTerms() Rule
getTerms() NLPNot
getTerms(Class<C>) NLPNot
getTerms() NLPRule
getTerms() AssociativeOperation
Returns the terms of this operation.
getTheory() AbstractLotteryAgent
Returns the theory of this agent.
getTheory() ProbabilisticLotteryAgent
Returns the theory of this agent.
getTheory() ArgumentationLottery
Returns the used argumentation theory.
getTheory() LdoArgumentationLottery
Returns the used argumentation theory.
getTheory() SubgraphProbabilityFunction
Returns the theory of this probability function.
getThird() Triple
returns the third element of this triple
getTo() Transition
Returns the target state of this transition.
getToken(int) DelpParser
Get the specific Token.
getToken(int) RpclCondensedProbabilityDistributionParser
Get the specific Token.
getToken(int) RpclProbabilityDistributionParser
Get the specific Token.
getToken(int) ASPParser
Get the specific Token.
getToken(int) POParser
Get the specific Token.
getToken(int) UPParser
Get the specific Token.
getTop() ArgumentStructure
Returns the first basic arguments of
this argument structure
getTopRule() AspicArgument
Retruns the TopRule according to ASPIC+ specification
getTrainer() ParameterTrainer
Returns the trainer of this parameter trainer.
getTransitions() TransitionSystem
Returns all transitions contained in this transition system.
getTransitionSystemRules(TransitionSystem) SActionQuerySatisfactionTester
Calculates a normal logic program which consists only of facts describing
the transition system given.
getTranslateInfo(Class<?>) Translator
getTriple(T, T) PreferenceOrder
returns a pair if it consists of of two given elements
getType() Inequation
Returns the type of this inequation.
getType() OptimizationProblem
Returns the type of this problem.
getUnboundVariables() DelpRule
getUnboundVariables() QuantifiedFormula
getUnboundVariables() QuantifiedFormulaSupport
getUnboundVariables() AssociativeFOLFormula
getUnboundVariables() Equivalence
getUnboundVariables() ExistsQuantifiedFormula
getUnboundVariables() FOLAtom
getUnboundVariables() ForallQuantifiedFormula
getUnboundVariables() Implication
getUnboundVariables() Negation
getUnboundVariables() SpecialFormula
getUnboundVariables() ModalFormula
getUnboundVariables() MlnFormula
getUnboundVariables() RelationalConditional
getUnboundVariables() DefaultRule
getUnboundVariables() NLPNot
getUniformDistribution(Set<S>, Signature) ProbabilityDistribution
Returns the uniform distribution on the given interpretations.
getUniformDistribution(RpclSemantics, FolSignature, Set<Set<Constant>>) CondensedProbabilityDistribution
Returns the uniform distribution on the given signature.
getUniformDistribution(RpclSemantics, FolSignature) RpclProbabilityDistribution
Returns the uniform distribution on the given signature.
getUniformDistribution(Set<S>) ProbabilityFunction
Returns the uniform distribution on the given interpretations.
getUniformProbability() DelpRule
getUniformProbability() LdoFormula
getUniformProbability() ProbabilityAware
getUniformProbability() RelationalFormula
getUniformProbability() FolFormula
getUniformProbability() ModalFormula
getUniformProbability() MlnFormula
getUniformProbability() ProbabilisticConditional
getUniformProbability() PropositionalFormula
Returns this formula's probability in the uniform distribution.
getUniformProbability() RelationalConditional
getUniformProbability() DefaultRule
getUnion(Set<Set<E>>) SetTools
Returns the union of the set of sets.
getUnityMultiple(int, double) OjAlgoMathUtils
Create unity matrix multiplied by scalar.
getUpdate() UPParser
getUpperBound() AbstractCreepingMachineShop
Retrieves the upper bound for delta for this machine shop.
getUpperBound() PenalizingCreepingMachineShop
getUpperBound() SmoothedPenalizingCreepingMachineShop
getUpperBound() UnbiasedCreepingMachineShop
getUpperBound() TrainingParameter
Returns the upper bound of this parameter.
getUpperBound() Interval
getUpperBound() Variable
Returns the upper bound of this variable.
getUpperCut(DungTheory, double) ProbabilisticExtension
Returns the upper cut of this probabilistic extension wrt.
getUpperReferenceArguments() AbstractGraphLdoModality
Returns the upper reference arguments of this modality.
getUtility(DungTheory, Semantics) AbstractLotteryAgent
Returns the utility of the agent wrt.
getUtility(DungTheory, Semantics) DummyLotteryAgent
getUtility(DungTheory, Semantics) ProbabilisticLotteryAgent
getUtility(DungTheory, Semantics) RandomLotteryAgent
getUtility(Agent) DirectGameProtocol
getUtility(DungTheory, Semantics) UtilityBasedLotteryAgent
getUtility(DialogueTrace<Argument, Extension>) ArguingAgent
Assess the given dialogue trace with the belief states utility function.
getUtility(Agent) GroundedGameProtocol
getUtility(Extension, DialogueTrace<Argument, Extension>) GroundedGameUtilityFunction
Determines the utility of the given trace with
the given grounded extension.
getUtility(DialogueTrace<Argument, Extension>) GroundedGameUtilityFunction
getUtility(DialogueTrace<Argument, Extension>, Set<Argument>, Set<Attack>) GroundedGameUtilityFunction
getUtility(DialogueTrace<S, T>) UtilityFunction
Gives the utility of the given dialogue trace.
getUtility(DialogueTrace<S, T>, Set<S>, Set<Attack>) UtilityFunction
Gives the utility of the given dialogue trace that
takes the additional arguments and attacks into account.
getUtility(Agent) GameProtocol
Returns the utility of the given agent for
the final situation.
getUtility(DungTheory, Semantics) LdoUtilityFunction
Gets the utility of the given theory wrt.
getUtility(DungTheory, Semantics) UtilityFunction
Gets the utility of the given theory wrt.
getUtilityFunction() BeliefState
Returns the utility function of this belief state.
getUtilityFunction() SasAgent
Returns the utility function of this agent.
getValue(FOLAtom, State) TransitionSystem
Returns the value of a fluent in a state in this transition system.
getValue() Token
An optional attribute value of the Token.
getValue() Token
An optional attribute value of the Token.
getValue() Token
An optional attribute value of the Token.
getValue() Token
An optional attribute value of the Token.
getValue() TrainingParameter
Returns the actual value of this parameter.
getValue() Probability
Returns the value of this probability.
getValue() FloatConstant
Get the value of this float.
getValue() IntegerConstant
Get the value of this integer.
getValue() CustomStringListCommandParameter
getValue() FileListCommandParameter
returns the given instantiation argument value for this parameter
getValue() IntegerCommandParameter
returns the given instantiation argument value for this parameter
getValue() SelectionCommandParameter
returns the given instantiation argument value for this parameter
getValue() StringListCommandParameter
getValue() Token
An optional attribute value of the Token.
getValues(double, PclBeliefSet) AbstractCreepingMachineShop
Computes the values of the conditionals for step delta
getValues(double, PclBeliefSet) PenalizingCreepingMachineShop
getValues(double, PclBeliefSet) SmoothedPenalizingCreepingMachineShop
getValues(double, PclBeliefSet) UnbiasedCreepingMachineShop
getVariables() AlwaysQuery
getVariables() HoldsQuery
getVariables() NecessarilyQuery
getVariables() QueryProposition
Returns all variables occuring in inner formulas and actions of this query
proposition.
getVariables() FolParser
getVariables() LogicStructure
Returns all variables that appear in this structure.
getVariables() SymbolicSet
getVariables() ConstraintSatisfactionProblem
Returns all variables of this problem.
getVariables() OptimizationProblem
getVariables() AssociativeOperation
getVariables() Constant
getVariables() Difference
getVariables() Fraction
getVariables() FunctionalTerm
getVariables() Term
Returns all variables in this term.
getVariables() Variable
getVerifyingWorlds(Conditional) ConditionalStructure
getView() SasAgent
Returns the view of this agent.
getWarrants(DefeasibleLogicProgram) DelpReasoner
Computes the subset of the arguments of this program, that are warrants.
getWeakPrototypes(RelationalConditional) RelationalRankingFunction
Returns the set of instances with weak prototypes.
getWeight() WeightedDirectedEdge
getWeight() WeightedEdge
Returns the weight of this edge.
getWeight() MlnFormula
Returns the weight.
getWeight(int) BordaWeightVector
returns the weight based on the rank in the ranking function.
getWeight(int) SinglePeakWeightVector
checks, whether an element got the highest rank
getWeight(int) SingleValeWeightVector
returns the weight of the element
getWeight(int) WeightVector
returns the weight of an
getWinner() DirectGameProtocol
getWinner() GroundedGameProtocol
getWinner() GameProtocol
If the game has a winner, this methods returns it.
getWitness(Collection<S>) ConsistencyWitnessProvider
If the collection of formulas is consistent this method
returns some model of it or, if it is inconsistent, null.
getWitness(S) ConsistencyWitnessProvider
If the formula is consistent this method
returns some model of it or, if it is inconsistent, null.
getWitness(BeliefSet<S>) ConsistencyWitnessProvider
If the belief set is consistent this method
returns some model of it or, if it is inconsistent, null.
getWitness(Collection<PropositionalFormula>) LingelingSolver
getWitness(Collection<PropositionalFormula>) Sat4jSolver
getWitness(Collection<PropositionalFormula>) SatSolver
If the collection of formulas is consistent this method
returns some model of it or, if it is inconsistent, null.
getWitness(PropositionalFormula) SatSolver
getWitness(BeliefSet<PropositionalFormula>) SatSolver
getWitness(Collection<PropositionalFormula>) SimpleDpllSolver
getWorldGenerators(NicePossibleWorld) ConditionalStructure
Processes the map from Conditionals to Generators for a given PossibleWorld
getWriter(FileFormat) AbstractDungWriter
Retrieves the writer for the given file format.
getXDimension() Matrix
Returns the x dimension of this matrix.
getXtol() OpenOptRootFinder
getXtol() OpenOptSolver
getYDimension() Matrix
Returns the y dimension of this matrix.
globalclusteringcoefficient(Graph<T>) GraphUtil
Returns the global clustering coefficient of the graph (if it is directed it is interpreted
as an undirected version).
GlpkSolver net.sf.tweety.math.opt.solver
GlpkSolver() GlpkSolver
gotoNextValidIndex() CanonicalIterator
Sets this.next to the next value actually encoding a belief base (or to this.upperBoundIndex if set).
gradedDefense(DungTheory, Collection<Argument>, int, int) GrossiModgilRankingReasoner
Implements the graded defense function from Def.
gradedNeutrality(DungTheory, Collection<Argument>, int) GrossiModgilRankingReasoner
Implements the graded neutrality function from Def.
GradientDescent net.sf.tweety.math.opt.solver
This class implements the gradient descent method to
find an optimum.
GradientDescent(Map<Variable, Term>) GradientDescent
Creates a new gradient descent solver
GradientDescentRootFinder net.sf.tweety.math.opt
Implements the gradient descent method to find zeros of a (multi-dimensional)
function.
GradientDescentRootFinder(Term, Map<Variable, Term>) GradientDescentRootFinder
Creates a new root finder for the given starting point and the given function
GradientDescentRootFinder(List<Term>, Map<Variable, Term>) GradientDescentRootFinder
Creates a new root finder for the given starting point and the given
(multi-dimensional) function
Graph T extends Node > - Interface in net.sf.tweety.graphs
Common interface for graphs with
nodes of type T
GraphExample net.sf.tweety.graphs.examples
GraphExample() GraphExample
GraphUtil net.sf.tweety.graphs.util
This abstract class contains some auxiliary methods for working
with graphs.
GraphUtil() GraphUtil
GraphUtilTest net.sf.tweety.graphs.util
GraphUtilTest() GraphUtilTest
GREATER ASPParserConstants
RegularExpression Id.
GREATER Inequation
GREATER_EQUAL Inequation
GREATEREQ ASPParserConstants
RegularExpression Id.
greaterEqualThan() KappaMin
greaterEqualThan() KappaSum
greaterEqualThan() KappaTerm
greaterEqualThan() KappaValue
GridSearchParameterLearner S extends Observation ,T extends Category > - Class in net.sf.tweety.machinelearning
A grid-search approach for learning parameters.
GridSearchParameterLearner(Trainer<S, T>, ClassificationTester<S, T>, int, int) GridSearchParameterLearner
Creates a new grid-search parameter learner with the given arguments.
GrossiModgilRankingReasoner net.sf.tweety.arg.dung.reasoner
This class implements the argument ranking approach of
[Grossi, Modgil.
GrossiModgilRankingReasoner() GrossiModgilRankingReasoner
GrossiModgilReasonerExample net.sf.tweety.arg.dung.examples
Example code for using graded semantics by Grossi/Modgil
GrossiModgilReasonerExample() GrossiModgilReasonerExample
ground() CActionDescription
Calculates a new action description containing all ground instances of each
law in this action description.
ground() SActionQuerySet
Returns a new SActionQuerySet consisting of all possible groundings of the
contained queries.
ground() DefeasibleLogicProgram
In general, a delp comprises of rule schemes with variables.
ground(Set<Constant>) DefeasibleLogicProgram
In general, a delp comprises of rule schemes with variables.
ground() DefaultTheory
Removes Variables by expanding formulas
GroundAtom(FolSignature) RpclProbabilityDistributionParser
GROUNDED_SEMANTICS Semantics
GroundedGameAgentGenerator net.sf.tweety.agents.dialogues.oppmodels.sim
Generates new arguing agents for a grounded game.
GroundedGameAgentGenerator(GroundedGameSystem.AgentFaction) GroundedGameAgentGenerator
Creates a new agent generator.
GroundedGameGenerator net.sf.tweety.agents.dialogues.oppmodels.sim
Generates grounded games.
GroundedGameGenerator(DungTheoryGenerator, double, double) GroundedGameGenerator
Creates a new game generator.
GroundedGameProtocol net.sf.tweety.agents.dialogues.oppmodels
This class implements a round robin protocol for the grounded game.
GroundedGameProtocol(GroundedGameSystem) GroundedGameProtocol
Creates a new grounded game protocol for the given grounded game systems.
GroundedGameProtocolGenerator net.sf.tweety.agents.dialogues.oppmodels.sim
Creates protocols for a grounded game.
GroundedGameProtocolGenerator() GroundedGameProtocolGenerator
GroundedGameSystem net.sf.tweety.agents.dialogues.oppmodels
This multi-agent system models a grounded dialogue game between
two agents.
GroundedGameSystem(DungTheory) GroundedGameSystem
Creates a new grounded game system.
GroundedGameSystem.AgentFaction net.sf.tweety.agents.dialogues.oppmodels
The factions of agents in this game.
GroundedGameT1AgentGenerator net.sf.tweety.agents.dialogues.oppmodels.sim
Generates agents of type T1.
GroundedGameT1AgentGenerator(GroundedGameSystem.AgentFaction, T1Configuration) GroundedGameT1AgentGenerator
Creates a new generator for agents of type T1.
GroundedGameT2AgentGenerator net.sf.tweety.agents.dialogues.oppmodels.sim
Generates agents of type T2.
GroundedGameT2AgentGenerator(GroundedGameSystem.AgentFaction, T2Configuration) GroundedGameT2AgentGenerator
Creates a new generator for agents of type T1.
GroundedGameT3AgentGenerator net.sf.tweety.agents.dialogues.oppmodels.sim
Generates agents of type T3.
GroundedGameT3AgentGenerator(GroundedGameSystem.AgentFaction, T3Configuration) GroundedGameT3AgentGenerator
Creates a new generator for agents of type T1.
GroundedGameUtilityFunction net.sf.tweety.agents.dialogues.oppmodels
The grounded game utility function u_a^g.
GroundedGameUtilityFunction(DungTheory, Argument, GroundedGameSystem.AgentFaction) GroundedGameUtilityFunction
Construct utility function.
GroundedTest net.sf.tweety.agents.dialogues.examples
GroundedTest() GroundedTest
GroundedTest2 net.sf.tweety.agents.dialogues.examples
GroundedTest2() GroundedTest2
GroundingRequirement net.sf.tweety.action.grounding
This is a common interface for grounding constraints, which have to be met by
a grounder when calculating possible applications of constants to variables.
GroundingRequirementsParser net.sf.tweety.action.grounding.parser
This class parses a list of grounding requirements of the form
REQUIREMENT ("," REQUIREMENT)*
GroundingRequirementsParser() GroundingRequirementsParser
GroundingTools net.sf.tweety.action.grounding
This class holds common grounding functionality for causal theories using
first-order formulas.
GroundingTools() GroundingTools
gtol OpenOptRootFinder
gtol OpenOptSolver
guiGetAnswerSetView() SimpleRevisionCompareView
guiGetButtons() SimpleRevisionCompareView
guiGetInput() SimpleRevisionCompareView
guiGetOperatorControls() SimpleRevisionCompareView
guiGetRevisionResult() SimpleRevisionCompareView