p ArgumentationReasonerTest
p PNormDistanceFunction
The parameter for the p-norm.
p ProbabilisticPNormDistanceFunction
The parameter for the p-norm.
p DistanceMinimizationInconsistencyMeasure
The p-norm parameter.
p DistanceMinimizationMachineShop
The p-norm parameter.
p GeneralizedMeMachineShop
Parameter p for p-norm.
p PNorm
The parameter of this p-norm.
pageRank(Graph<? extends Node>, Node, double, double) GraphUtil
Computes the PageRank of the given node in the given graph.
pageRankInverted(Graph<? extends Node>, Node, double, double) AnalysisTest
Inverted PageRank
PageRankTest() AnalysisTest
PageRankTest2() AnalysisTest
PAInconsistencyMeasure net.sf.tweety.arg.prob.analysis
This inconsistency measure measures the distance between a given partial
probability assignment to the set of rational/justifiable probabilistic extensions
of a given Dung theory.
PAInconsistencyMeasure(RealVectorNorm, DungTheory, PASemantics) PAInconsistencyMeasure
Creates a new inconsinstency measure which uses the given norm and
measures wrt.
Pair E ,F > - Class in net.sf.tweety.commons.util
This class implements a simple pair of elements.
Pair() Pair
Initializes an empty pair.
Pair(E, F) Pair
Initializes the elements of this pair with the given parameters
PAR_CLOSE ASPParserConstants
RegularExpression Id.
PAR_OPEN ASPParserConstants
RegularExpression Id.
PARAM_ARGUMENT LotteryGameGenerator
Key for the simulation parameter which refers to the argument of the dialogue.
PARAM_ARGUMENT GroundedGameGenerator
Key for the simulation parameter which refers to the argument of the dialogue.
PARAM_DUMMY_THEORY LotteryGameGenerator
Key for the simulation parameter which refers to the dummy agent's theory.
PARAM_LOT_PROB LotteryGameGenerator
Key for the simulation parameter which refers to the probability function for the actual lottery agent.
PARAM_LOT_UTIL LotteryGameGenerator
Key for the simulation parameter which refers to the utility function for the actual lottery agent.
PARAM_SEM LotteryGameGenerator
Key for the simulation parameter which refers to the semantics used.
PARAM_UNIVERSALTHEORY LotteryGameGenerator
Key for the simulation parameter which refers to the universal theory generated.
PARAM_UNIVERSALTHEORY GroundedGameGenerator
Key for the simulation parameter which refers to the universal theory generated.
ParameterisedArgumentativeSelectiveRevisionOperator net.sf.tweety.lp.asp.beliefdynamics.selectiverevision
This class represents a selective revision using the base revision approach
from [1] for the inner revision and the sceptical argumentative transformation
function from [2].
ParameterisedArgumentativeSelectiveRevisionOperator(Solver, AttackStrategy, AttackStrategy, ParameterisedArgumentativeSelectiveRevisionOperator.TransformationType) ParameterisedArgumentativeSelectiveRevisionOperator
Constructs a new selective revision operator using the given attack relations
and a asp solver.
ParameterisedArgumentativeSelectiveRevisionOperator.TransformationType net.sf.tweety.lp.asp.beliefdynamics.selectiverevision
parameters AbstractTweetyPlugin
valid parameters for this plugin
ParameterSet net.sf.tweety.machinelearning
A set of parameters that can be given to a trainer to
specifiy the training task.
ParameterSet() ParameterSet
ParameterTrainer S extends Observation ,T extends Category > - Class in net.sf.tweety.machinelearning
Performs a parameter training on a given trainer, i.e.
ParameterTrainer(Trainer<S, T>) ParameterTrainer
Creates a new parameter trainer for the given trainer.
params DefaultDungTheoryGenerator
The parameters for generation.
parens(String) Prover9Writer
Puts str in parentheses.
parens(String) TptpWriter
Puts str in parentheses.
parent DialecticalTree
The parent node; null if this node is a root
parent InconsistencyMeasurementProcess
The measure from where this process has been dispatched.
parent SimpleNode
PARENTHESES_LEFT() LogicalSymbols
PARENTHESES_RIGHT() LogicalSymbols
parents DigraphNode
nodes with edges from/to this node
PARevisionOperator net.sf.tweety.arg.prob.dynamics
This operator implements a revision of some probabilistic assessment of
arguments upon the observation of an argumentation theory.
PARevisionOperator(PASemantics, RealVectorNorm, SimpleRealValuedFunction) PARevisionOperator
Creates a new change operator for the given semantics that uses the specified norm
for distance measuring and the given function for optimizing.
parse(Reader) AbstractDungParser
Parses the given file into an abstract argumentation framework
parse(Reader) ApxParser
parse(Reader) CnfParser
parse(Reader) TgfParser
parse(File) POParser
parse(String) POParser
parse(String) UPParser
parseAction(List<Object>) ActionQueryParser
Parses a list of actionnames or a list of actions.
parseActionFormula(Stack<Object>) ActionQueryParser
Parses a simple formula as a list of string tokens or formulas into an action query.
parseActionName(String) ActionQueryParser
parseAlwaysFormula(String, String) CLawParser
Parses a string containing a single causal law of the form
always A
which is converted to
caused - if !A
parseAnswerSet(String) ASPParser
parseAnswerSet(Reader) ASPParser
parseAnswerSet(String) DLVComplex
parseAnswerSetList(String) ASPParser
parseAnswerSetList(Reader) ASPParser
parseAnswerSets(String) Clingo
parseAnswerSets(String) DLV
parseArgumentList(String) AbstractDungParser
Returns a collection view of the given set of arguments
parseArguments(Parameters) CriterionOptionHandler
parseAssociativeFormula(BitSet, int, int, PropositionalSignature) CanonicalEnumerator
Parses an associate formula from the given bitset starting at index idx, with the given number
of terms and the given signature
parseAtomic(List<Object>) ActionQueryParser
Parses a simple formula as a list of String tokens or formulas into a propositional formula.
parseAtomic(List<Object>) FolParser
Parses a simple formula as a list of String tokens or formulas into a fol formula.
parseAtomic(List<Object>) PlParser
Parses a simple formula as a list of String tokens or formulas into a propositional formula.
parseBeliefBase(Reader) CLawParser
parseBeliefBase(Reader) CParser
parseBeliefBase(Reader) ActionQueryParser
parseBeliefBase(Reader) ABAParser
parseBeliefBase(Reader) AspicParser
parseBeliefBase(Reader) DelpParser
parseBeliefBase(Reader) AbstractDungParser
parseBeliefBase(Reader) DungParser
parseBeliefBase(String) Parser
Parses the given text into a belief base of the given type.
parseBeliefBase(Reader) Parser
Parses the given reader into a belief base of the given type.
parseBeliefBase(Reader) ClParser
parseBeliefBase(Reader) FolParser
parseBeliefBase(Reader) PclParser
parseBeliefBase(Reader) PlParser
parseBeliefBase(Reader) RclParser
parseBeliefBase(Reader) RdlParser
parseBeliefBase(Reader) RpclParser
parseBeliefBaseFromFile(String) Parser
Parses the file of the given filename into a belief base of the given type.
parseBoolean(String) AbstractDungParser
Parses the given string (either "YES" or "NO") to a boolean value.
parseCausedFormula(String, String) CLawParser
Parses a string containing a single causal law of the form
caused A (if B)? (after C)?
parseCausesFormula(String, String) CLawParser
Parses a string containing a single causal law of the form
A causes B if C
which is converted to
caused B if + after A && C
parseComments() TestKBParsing
parseCondensedProbabilityDistribution(Reader) RpclCondensedProbabilityDistributionParser
parseConjunction(List<Object>) ActionQueryParser
Parses a simple formula as a list of String tokens or formulas into a propositional formula.
parseConjunction(List<Object>) FolParser
Parses a simple conjunction as a list of String tokens or formulas into a fol formula.
parseConjunction(List<Object>) PlParser
Parses a simple formula as a list of String tokens or formulas into a propositional formula.
parseDefaultFormula(String, String) CLawParser
Parses a string containing a single causal law of the form
default A (if B)?
which is converted to the causal law
caused A if A && B
parseDisjunction(List<Object>) ActionQueryParser
Parses a simple formula as a list of String tokens or formulas into a propositional formula.
parseDisjunction(List<Object>) FolParser
Parses a disjunction as a list of String tokens or formulas into a fol formula.
parseDisjunction(List<Object>) PlParser
Parses a simple formula as a list of String tokens or formulas into a propositional formula.
parseDoubleNegation() TestFormulaParsing
parseEmpty() TestKBParsing
parseEmptyPreds() TestKBParsing
ParseException net.sf.tweety.arg.delp.parser
This exception is thrown when parse errors are encountered.
ParseException(Token, int[][], String[]) ParseException
This constructor is used by the method "generateParseException"
in the generated parser.
ParseException() ParseException
The following constructors are for use by you for whatever
purpose you can think of.
ParseException(String) ParseException
Constructor with message.
ParseException net.sf.tweety.arg.dung.parser
This exception is thrown when parse errors are encountered.
ParseException(Token, int[][], String[]) ParseException
This constructor is used by the method "generateParseException"
in the generated parser.
ParseException() ParseException
The following constructors are for use by you for whatever
purpose you can think of.
ParseException(String) ParseException
Constructor with message.
ParseException net.sf.tweety.logics.fol.parser
This exception is thrown when parse errors are encountered.
ParseException(Token, int[][], String[]) ParseException
This constructor is used by the method "generateParseException"
in the generated parser.
ParseException() ParseException
The following constructors are for use by you for whatever
purpose you can think of.
ParseException(String) ParseException
Constructor with message.
ParseException net.sf.tweety.logics.rpcl.parser.rpclcondensedprobabilitydistributionparser
This exception is thrown when parse errors are encountered.
ParseException(Token, int[][], String[]) ParseException
This constructor is used by the method "generateParseException"
in the generated parser.
ParseException() ParseException
The following constructors are for use by you for whatever
purpose you can think of.
ParseException(String) ParseException
Constructor with message.
ParseException net.sf.tweety.logics.rpcl.parser.rpclprobabilitydistributionparser
This exception is thrown when parse errors are encountered.
ParseException(Token, int[][], String[]) ParseException
This constructor is used by the method "generateParseException"
in the generated parser.
ParseException() ParseException
The following constructors are for use by you for whatever
purpose you can think of.
ParseException(String) ParseException
Constructor with message.
ParseException net.sf.tweety.lp.asp.parser
This exception is thrown when parse errors are encountered.
ParseException(Token, int[][], String[]) ParseException
This constructor is used by the method "generateParseException"
in the generated parser.
ParseException() ParseException
The following constructors are for use by you for whatever
purpose you can think of.
ParseException(String) ParseException
Constructor with message.
ParseException net.sf.tweety.preferences.io
This exception is thrown when parse errors are encountered.
ParseException(Token, int[][], String[]) ParseException
This constructor is used by the method "generateParseException"
in the generated parser.
ParseException() ParseException
The following constructors are for use by you for whatever
purpose you can think of.
ParseException(String) ParseException
Constructor with message.
parseExtensionList(String) AbstractDungParser
Returns a collection view of the given set of extensions (=sets of
arguments)
parseFolFormula(String) CLawParser
Parses a FolFormula from a string using the FolParser class
parseFormula(Reader) CLawParser
parseFormula(String) CLawParser
parseFormula(Reader) CParser
parseFormula(String) CParser
parseFormula(Reader) ActionQueryParser
parseFormula(Reader) ABAParser
parseFormula(Reader) AspicParser
parseFormula(Reader) DelpParser
A formula here is a Literal, that is an Atom or a negated Atom.
parseFormula(Reader) AbstractDungParser
parseFormula(Reader) DungParser
parseFormula(String) Parser
Parses the given text into a formula of the given type.
parseFormula(Reader) Parser
Parses the given reader into a formula of the given type.
parseFormula(Reader) ClParser
parseFormula(Reader) FolParser
parseFormula(Reader) PclParser
parseFormula(Reader) PlParser
parseFormula(BitSet, int, PropositionalSignature) CanonicalEnumerator
Reads the next formula of the given bitset, starting at the given index.
parseFormula(Reader) RclParser
parseFormula(Reader) RdlParser
parseFormula(Reader) RpclParser
parseFormulaFromFile(String) Parser
Parses the file of the given filename into a formula of the given type.
parseInertialFormula(String, String) CLawParser
Parses a string containing a single causal law of the form
inertial A
which is converted to the causal law
caused A if A after A
parseInterpretation(String) NaiveMlnReasoner
Constructs a Herbrand interpretation from the given string
parseKnownKBs() TestKBParsing
parseLabeling(String) AbstractDungParser
Returns a labeling parsed from the given string
parseLabelingList(String) AbstractDungParser
Returns a collection view of the given set of labelings
parseLpT(String[], ActionSignature) CTransitionSystemCalculator
Parses the resulting answer sets of an lp_T(D) program as a set.
parseLpTSingleLine(String, ActionSignature) CTransitionSystemCalculator
Utility function parsing a single answer set to a map from timestamp to the
set of atoms with that particular timestamp.
parseMayCauseFormula(String, String) CLawParser
Parses a string containing a single causal law of the form
A may cause B if C
which is converted to
caused B if B after A && C
parseNegation(List<Object>) ActionQueryParser
Parses a simple formula as a list of String tokens or formulas into a propositional formula.
parseNegation(List<Object>) FolParser
Parses a simple formula as a list of String tokens or formulas into a fol formula.
parseNegation(List<Object>) PlParser
Parses a simple formula as a list of String tokens or formulas into a propositional formula.
parseNonexecutableFormula(String, String) CLawParser
Parses a string containing a single causal law of the form
nonexecutable A if B
which is converted to
caused - after A && B
parseOutput(String) OpenOptSolver
This method parses the output data of an OpenOpt run
parseProbabilityDistribution(Reader) RpclProbabilityDistributionParser
parseProgram(String) ASPParser
parseProgram(Reader) ASPParser
parseProposition(BitSet, int, PropositionalSignature) CanonicalEnumerator
Parses a proposition in bitset s starting from idx.
parseQuantification(List<Object>) FolParser
Parses a quantified formula as a list of String tokens or formulas.
parseQuotedStrings() TestKBParsing
parser FileDungTheoryGenerator
A parser for parsing the files.
Parser T extends BeliefBase > - Class in net.sf.tweety.commons
This class models an abstract parser for belief bases and formulas.
Parser() Parser
parser MinimalViolationInconsistencyMeasureLPSolveTest
parser RPCLPlugin
parser ClingoTest
parser ParserTest
parser SimpleNode
PARSER_BIRDS TestFormulaParsing
PARSER_BIRDS TestQueries
PARSER_COUNTER TestQueries
PARSER_DTREE TestQueries
PARSER_HOBBES TestQueries
PARSER_NIXON TestQueries
PARSER_STOCKS TestFormulaParsing
PARSER_STOCKS TestQueries
parseRequirement(String, Set<Variable>) GroundingRequirementsParser
Parses a string of the following form:
(VARIABLENAME "<>" VARIABLENAME | VARIABLENAME "<>" CONSTANTNAME)
where the constant CONSTANTNAME has to be of the same sort as the
variable VARIABLENAME.
parseRequirements(String, Set<Variable>) GroundingRequirementsParser
Parses a string of the following form: REQUIREMENT ("," REQUIREMENT)*
ParserException net.sf.tweety.commons
This class models a general exception for parsing.
ParserException(String) ParserException
Creates a new parser exception with the given message.
ParserException(Exception) ParserException
Creates a new parser exception with the given sub exception.
ParserTest() ABATest
parserTest() RDLTest
ParserTest net.sf.tweety.lp.asp.parser
Test all important functions of the ASP-Parser in combination with the
InstantiateVisitor which is responsible to walk through the parse-tree and
generate in-memory classes of the ASP-Program saved in a file or represented
as a String.
ParserTest() ParserTest
ParserTest1() AspicTest
ParserTest2() AspicTest
parseRule(String) ASPParser
parseRule(Reader) ASPParser
parseSignature(String) ActionSignatureParser
Parses the given text into a signature of the given type.
parseSignature(Reader) ActionSignatureParser
Parses the given reader into a signature of the given type.
parseSignatureFromFile(String) ActionSignatureParser
Parses the file of the given filename into a signature.
parseSimple() TestFormulaParsing
parseSimpleOrder(String) AspicParser
Extracts and Constructs a SimpleAspicOrder out of a string
parseSortDeclaration(String) ActionSignatureParser
Parses a sort declaration of the form "SORTNAME "=" "{" (CONSTANTNAME ("," CONSTANTNAME)*)? "}""
and adds it to the signature.
parseSortDeclaration(String, FolSignature) FolParser
Parses a sort declaration of the form "SORTNAME "=" "{" (CONSTANTNAME ("," CONSTANTNAME)*)? "}""
and modifies the given signature accordingly.
parseTermlist(List<Object>) FolParser
Parses a term list as a list of String tokens or terms into a list of terms.
parseTooLong() TestKBParsing
parseTooMuch() TestFormulaParsing
parseTooMuch2() TestFormulaParsing
parseTooMuch3() TestFormulaParsing
parseTooShort() TestKBParsing
parseTypeDeclaration(String) ActionSignatureParser
Parses an action declaration of the form "action" "(" ACTIONNAME ("(" SORTNAME ("," SORTNAME)* ")")? ")"
or a fluent declaration of the form "fluent" "(" FLUENTNAME ("(" SORTNAME ("," SORTNAME)* ")")? ")"
and adds them to the signature.
parseTypeDeclaration(String, FolSignature) FolParser
Parses a predicate declaration of the form "type" "(" PREDICATENAME "(" (SORTNAME ("," SORTNAME)*)? ")" ")"
or a functor declaration of the form "type" "(" SORTNAME "=" FUNCTORNAME "(" (SORTNAME ("," SORTNAME)*)? ")" ")"
and modifies the given signature accordingly.
parseUnknownConstant() TestFormulaParsing
parseUnknownConstantAsPredicate() TestFormulaParsing
parseUnknownPred() TestFormulaParsing
parseUnknownToken() TestKBParsing
parseUnknownVariableAsPredicate() TestFormulaParsing
PartialProbabilityAssignment net.sf.tweety.arg.prob
A partial probability assignment for abstract argumentation theories.
PartialProbabilityAssignment() PartialProbabilityAssignment
partition(BeliefBase) ZReasoner
Returns a partitioning of a knowledge base into partitions containing all conditionals that
tolerate the remaining set of conditionals of a knowledge base.
partitions GridSearchParameterLearner
The number of partitions of each parameter interval.
PASemantics net.sf.tweety.arg.prob.semantics
This interface contains common methods for probabilistic argumentation semantics.
path2clingo Clingo
path2dlv DLV
path2dlx DLVComplex
PATH_BIRDS TestDeLP
PATH_HOBBES TestDeLP
path_to_exec ProboSolver
pathToGroundTruth GroundTruthSolver
The path to the ground truth files.
pathToMarco MarcoMusEnumerator
The MARCO executable.
pathToMimus MimusMusEnumerator
The Mimus executable.
pathToOctave OctaveSqpSolver
Path to Octave
pathToTmp SyntacticEnumeratingPlBeliefSetSampler
the path to a folder where intermediate results (all formulas up to the required length)
are stored
PAUpdateOperator net.sf.tweety.arg.prob.dynamics
This operator implements an update of some probabilistic assessment of
arguments upon the observation of an argumentation theory.
PAUpdateOperator(PASemantics, RealVectorNorm, SimpleRealValuedFunction) PAUpdateOperator
Creates a new change operator for the given semantics that uses the specified norm
for distance measuring and the given function for optimizing.
PclBeliefSet net.sf.tweety.logics.pcl
This class models a belief set on probabilistic conditional logic, i.e.
PclBeliefSet() PclBeliefSet
Creates a new (empty) conditional belief set.
PclBeliefSet(Collection<? extends ProbabilisticConditional>) PclBeliefSet
Creates a new conditional belief set with the given collection of
conditionals.
PclBeliefSetQuadraticErrorMinimizationMachineShop net.sf.tweety.logics.pcl.analysis
This class is capable of restoring consistency of a possible inconsistent probabilistic
conditional belief set.
PclBeliefSetQuadraticErrorMinimizationMachineShop(CulpabilityMeasure<ProbabilisticConditional, PclBeliefSet>) PclBeliefSetQuadraticErrorMinimizationMachineShop
Creates a new machine shop based on the given culpability measure.
PclDefaultConsistencyTester net.sf.tweety.logics.pcl.analysis
This class is capable of checking whether a given conditional knowledge base
is consistent by searching for the root of some equivalent multi-dimensional function.
PclDefaultConsistencyTester() PclDefaultConsistencyTester
PclParser net.sf.tweety.logics.pcl.parser
This class implements a parser for probabilistic conditional logic.
PclParser() PclParser
peekNode() JJTASPParserState
PenalizingCreepingMachineShop net.sf.tweety.logics.pcl.analysis
This class is capable of restoring consistency of a possible inconsistent probabilistic
conditional belief set.
PenalizingCreepingMachineShop() PenalizingCreepingMachineShop
penalty OptimizationProblem
penalty for converted absolute values.
Perceivable net.sf.tweety.agents
A perceivable object is some event occuring in an environment and perceivable
by an agent.
PerceivableStructuredArgumentationFramework net.sf.tweety.agents.dialogues.structured
This class packs a structured argumentation framework into a
perceivable object.
PerceivableStructuredArgumentationFramework() PerceivableStructuredArgumentationFramework
percentageVirtualArguments T3Configuration
The percentage of virtual arguments in the
view of an agent.
percentageVirtualAttacks T3Configuration
The percentage of attacks a virtual argument
retains from the original attacks.
permutations(Set<Set<E>>) SetTools
Computes all permutations of elements in partitions as follows.
pfg AspicTest
PingService net.sf.tweety.web.services
Provides a simple ping service that always returns the request
sent to it.
PingService() PingService
PIPE ASPParserConstants
RegularExpression Id.
PlBeliefSet net.sf.tweety.logics.pl
This class represents a knowledge base of propositional formulae.
PlBeliefSet() PlBeliefSet
Creates a new (empty) knowledge base.
PlBeliefSet(Collection<? extends PropositionalFormula>) PlBeliefSet
Creates a new knowledge base with the given
set of formulas.
PlFormulaGenerator net.sf.tweety.arg.aspic.ruleformulagenerator
PlFormulaGenerator() PlFormulaGenerator
PlMusEnumerator net.sf.tweety.logics.pl.sat
This abstract class models a MUS enumerator for propositional logic, i.e.
PlMusEnumerator() PlMusEnumerator
PlParser net.sf.tweety.logics.pl.parser
This class implements a parser for propositional logic.
PlParser() PlParser
PlParserFactory net.sf.tweety.logics.pl.parser
Manages and creates different parsers for propositional logic.
PlParserFactory() PlParserFactory
PlParserFactory.Format net.sf.tweety.logics.pl.parser
An enumeration of all available knowledge base formats.
PlParserTest net.sf.tweety.logics.pl.test
PlParserTest() PlParserTest
plugin CliMain
the called plugin
PluginOutput net.sf.tweety.plugin
This class provides the output for each plugin to be used in the CLI.
PluginOutput() PluginOutput
PluginOutput(ArrayList<OutputField>) PluginOutput
PluralityScoringPreferenceAggregator T > - Class in net.sf.tweety.preferences.aggregation
Creates an aggregator with plurality scoring
PluralityScoringPreferenceAggregator() PluralityScoringPreferenceAggregator
calls the super-constructor with argument used for plurality scoring aggregation
PLUS ASPParserConstants
RegularExpression Id.
PlWindowInconsistencyMeasurementProcess net.sf.tweety.logics.pl.analysis
A window inconsistency measurement process for propositional logic
(this class needs to be there as no generics are allowed when instantiating
a DefaultStreamBasedInconsistencyMeasure.
PlWindowInconsistencyMeasurementProcess() PlWindowInconsistencyMeasurementProcess
PmInconsistencyMeasure net.sf.tweety.logics.pl.analysis
This class implements the inconsistency measure I_{P_m} proposed in
[Jabbour, Raddaoui.
PmInconsistencyMeasure() PmInconsistencyMeasure
PmInconsistencyMeasure net.sf.tweety.lp.asp.analysis
This class implements the inconsistency measure $I_\pm$ from
[Ulbricht, Thimm, Brewka.
PmInconsistencyMeasure(Solver) PmInconsistencyMeasure
Creates a new inconsistency measure based on the given
solver.
PmMeasureTest net.sf.tweety.logics.pl.test
PmMeasureTest() PmMeasureTest
PNorm net.sf.tweety.math.norm
The p-norm.
PNorm(int) PNorm
Creates a new p-norm with the given parameter.
PNormDistanceFunction net.sf.tweety.logics.ml.analysis
This class implement the p-norm distance function.
PNormDistanceFunction(int, boolean) PNormDistanceFunction
Creates a new p-norm distance function.
POChanger T > - Class in net.sf.tweety.preferences.io
This class is meant to provide a structure to change preference orders and compare the results between changes
POChanger(Triple<PreferenceOrder<T>, T, Integer>) POChanger
PodlaszewskiCaminadaDungTheoryGenerator net.sf.tweety.arg.dung.util
This generator generates abstract argumentation frameworks following the schema
described in "String Admissibility Revisited" (COMMA2014) by Martin Caminda, following
and idea by Mikolay Podlaszewski.
PodlaszewskiCaminadaDungTheoryGenerator(int) PodlaszewskiCaminadaDungTheoryGenerator
Creates a new generator that generates frameworks of the
given numComponents >= 0.
POLICY_CREDOLOUS AnswerSetList
constant id for the credolous policy for operations of the AnswerSetList object.
POLICY_SKEPTICAL AnswerSetList
constant id for the skeptical policy for operations of the AnswerSetList object.
POParser net.sf.tweety.preferences.io
POParser() POParser
POParser(InputStream) POParser
Constructor with InputStream.
POParser(InputStream, String) POParser
Constructor with InputStream and supplied encoding
POParser(Reader) POParser
Constructor.
POParser(POParserTokenManager) POParser
Constructor with generated Token Manager.
POParserConstants net.sf.tweety.preferences.io
Token literal values and constants.
POParserTokenManager net.sf.tweety.preferences.io
Token Manager.
POParserTokenManager(SimpleCharStream) POParserTokenManager
Constructor.
POParserTokenManager(SimpleCharStream, int) POParserTokenManager
Constructor.
popNode() JJTASPParserState
populationIncreaseCrossOver SimpleGeneticOptimizationSolver
How many new individuals are created by cross-over (per pair of individuals)
populationIncreaseMutation SimpleGeneticOptimizationSolver
How many new individuals are created by mutation (per individual)
populationSize ApacheCommonsCMAESOptimizer
population size
populationSize SimpleGeneticOptimizationSolver
The size of the population
pos_votes SocialAbstractArgumentationFramework
The number of positive votes of arguments
positiveMinimum KappaValue
This minimum contains those kappa sums of conditionals that are falsified in a world, that is verified by the
Conditional of this kappa value.
Possibility net.sf.tweety.logics.el.syntax
This class models the possibility modality.
Possibility(RelationalFormula) Possibility
Creates a new possibility formula with the
given inner formula
possibleAttacks EnumeratingDungTheoryGenerator
The set of possible attacks.
PossibleWorld net.sf.tweety.logics.pl.semantics
This class represents a possible world of propositional logic, i.e.
PossibleWorld() PossibleWorld
Creates a new empty possible world.
PossibleWorld(Collection<? extends Proposition>) PossibleWorld
Creates a new possible world with the given set of propositions.
PossibleWorldDistance net.sf.tweety.logics.pl.analysis
This class refines interpretation distances to distance on possible worlds.
PossibleWorldDistance() PossibleWorldDistance
PossibleWorldIterator net.sf.tweety.logics.pl.semantics
Iterates effectively over all interpretation sets worlds of a given signature.
PossibleWorldIterator() PossibleWorldIterator
Creates new iterator for the given signature.
PossibleWorldIterator(PropositionalSignature) PossibleWorldIterator
Creates new iterator for the given signature.
possibleWorlds KripkeModel
The possible worlds of this model.
Power net.sf.tweety.math.term
This class represents a term raised to some power.
Power(Term, Term) Power
Creates a new power term with the given term and power.
power Power
The power.
POWriter T > - Class in net.sf.tweety.preferences.io
POWriter() POWriter
pre DefaultRule
The prerequisite of the default rule
pre CredibilityTest
precision SimpleProductSemantics
Precision of comparisons between values.
precision SimpleSamplingMlnReasoner
The computation is aborted when the given precision is reached for at least
numOfPositive number of consecutive tests.
PRECISION AbstractCreepingMachineShop
The precision for finding the minimal consistent knowledge base.
precision GradientDescentRootFinder
The precision of the approximation.
PRECISION NewtonRootFinder
The precision of the approximation.
PRECISION RootFinder
The precision for finding roots.
precision ApacheCommonsCMAESOptimizer
the precision of the optimization
precision ApacheCommonsNonLinearConjugateGradientOptimizer
The precision
PRECISION BfgsSolver
precision GradientDescent
The precision of the approximation.
PRECISION HessianGradientDescent
precision SimpleGeneticOptimizationSolver
If an iteration improves less than this value the algorithm ends.
PRECISION Probability
The precision for probabilities.
PRECISIONCULP BalancedMachineShop
The precision for comparing culpability values.
PRECISIONOPT BalancedMachineShop
The precision for comparing culpability values.
pred DLPAtom
the predicate identifying the atom
predCredibilityPrefix CredibilityRevision
a prefix used to mark the prioritzed version of predicates
predicate LdoArgument
The name of the proposition
Predicate net.sf.tweety.logics.commons.syntax
A general predicate which contains an identifier that describes its meaning,
an argument count referred as arity and a list of sorts defining the types for
the arguments of the predicate.
Predicate() Predicate
Predicate(String) Predicate
Initializes a predicate of arity zero with the given name;
Predicate(String, int) Predicate
Initializes a predicate with the given name and of the given arity.
Predicate(String, List<Sort>) Predicate
Initializes a predicate with the given name and the given list
of argument sorts.
predicate FOLAtom
The predicate of this atom
predicate Proposition
The name of the proposition
predicate InstanceAssignment
The predicate of this instance assignment.
predicates FolSignature
predicates ReferenceWorld
The set of predicates this reference world bases on.
PREF__AGGR_DESCRIPTION PreferencesPlugin
PREF__AGGR_IDENTIFIER PreferencesPlugin
PREF__AGGR_RULES PreferencesPlugin
PREF__CALL_PARAMETER PreferencesPlugin
PREF__DYN_DESCRIPTION PreferencesPlugin
PREF__DYN_IDENTIFIER PreferencesPlugin
PREF__DYN_RULES PreferencesPlugin
PREF__UP_DESCRIPTION PreferencesPlugin
PREF__UP_IDENTIFIER PreferencesPlugin
PreferenceAggregator T > - Interface in net.sf.tweety.preferences.aggregation
This interface is meant to be used for the aggregation of some generic preference orders
PreferenceHandling net.sf.tweety.lp.asp.beliefdynamics.revision
The implementation orients on the diploma thesis of Mirja Boehmer
in this class a variant of the approach
"A Preference-Based Framework for Updating Logic Programs" by James P.
PreferenceHandling(Solver) PreferenceHandling
PreferenceHandling(Solver, int) PreferenceHandling
PreferenceOrder T > - Class in net.sf.tweety.preferences
This class extends the BinaryRelation-class with a check for totality and
transitivity
PreferenceOrder() PreferenceOrder
Creates an empty HashSet of preference order.
PreferenceOrder(Collection<? extends Triple<T, T, Relation>>) PreferenceOrder
generates a preference order with a given set of elements
PreferencesIntegerBugExample net.sf.tweety.preferences
PreferencesIntegerBugExample() PreferencesIntegerBugExample
PreferencesPlugin net.sf.tweety.preferences.plugin
The CLI-Plugin for the Preferences-Package
PreferencesPlugin(String[]) PreferencesPlugin
non-empty constructur in case of errors in JSPF
PreferencesPlugin() PreferencesPlugin
Default empty constructor initializing this plugins parameter
PREFERRED_SEMANTICS Semantics
PreferredReasoner T extends Formula > - Class in net.sf.tweety.arg.aba
PreferredReasoner(BeliefBase, int) PreferredReasoner
Creates a new preferred reasoner for the given knowledge base.
PreferredReasoner net.sf.tweety.arg.dung
This reasoner for Dung theories performs inference on the preferred extensions.
PreferredReasoner(BeliefBase, int) PreferredReasoner
Creates a new preferred reasoner for the given knowledge base.
PreferredReasoner(BeliefBase) PreferredReasoner
Creates a new preferred reasoner for the given knowledge base using sceptical inference.
premise Conditional
The premise of this conditional.
premise RelationalConditional
The premise of the conditional.
premise NLPRule
premise AssociationRule
The premise of the rule.
premises InferenceRule
The rule's premises
premset_comp LastLinkOrder
premset_comp WeakestLinkOrder
prepare() RuleBasedCReasoner
prepareOptimizationProblem(PartialProbabilityAssignment, DungTheory, OptimizationProblem, Map<Collection<Argument>, FloatVariable>, Map<Collection<Argument>, FloatVariable>, Vector<Term>, Vector<Term>) AbstractPAChangeOperator
prettyPrint() ArgumentTree
Returns a string representation of this argument tree.
prettyPrint(DeductiveArgumentNode, Set<DeductiveArgumentNode>, int) ArgumentTree
Returns a string representation of the subtree rooted at
the given node.
prettyPrint() DungTheory
Pretty print of the theory.
prevCharIsCR SimpleCharStream
prevCharIsCR SimpleCharStream
prevCharIsCR SimpleCharStream
prevCharIsCR SimpleCharStream
prevCharIsCR SimpleCharStream
prevCharIsCR SimpleCharStream
prevCharIsCR SimpleCharStream
prevCharIsLF SimpleCharStream
prevCharIsLF SimpleCharStream
prevCharIsLF SimpleCharStream
prevCharIsLF SimpleCharStream
prevCharIsLF SimpleCharStream
prevCharIsLF SimpleCharStream
prevCharIsLF SimpleCharStream
previousMaxLength SyntacticEnumeratingPlBeliefSetSampler
previousMinLength SyntacticEnumeratingPlBeliefSetSampler
previousValue WindowInconsistencyMeasurementProcess
The previous value of the measure.
PriestWorld net.sf.tweety.logics.pl.semantics
A three-valued interpretation for propositional logic from
Priest's three valued logic (3VL) [Priest, G.: Logic of paradox.
PriestWorld() PriestWorld
Creates a new world where all propositions get the truth value FALSE.
PriestWorld.TruthValue net.sf.tweety.logics.pl.semantics
The three truth values.
PrInconsistencyMeasure S extends Formula > - Class in net.sf.tweety.logics.commons.analysis
This class models the P inconsistency measure from e.g.
PrInconsistencyMeasure(MusEnumerator<S>) PrInconsistencyMeasure
Creates a new drastic inconsistency measure.
printAntecedenceVerificationMatrix(PrintStream, PclBeliefSet, Set<PossibleWorld>) MatlabUtils
Print antecedence verification matrix (1 if antecedence is satisfied, 0 otherwise)
printBase(FolBeliefSet) FolWriter
Prints formatted representation of a knowledge base.
printBase(FolBeliefSet) Prover9Writer
printBase(FolBeliefSet) TptpWriter
printConditionalVerificationMatrix(PrintStream, PclBeliefSet, Set<PossibleWorld>) MatlabUtils
Print conditional verification matrix (1 if antecedence and consequence are satisfied, 0 otherwise)
printConfiguration() CliMain
This function allows to print the content of the current configuration
file.
printConstraintMatrix(PrintStream, PclBeliefSet, Set<PossibleWorld>) MatlabUtils
Print constraint matrix for belief set and possible worlds to output stream.
printDescription() ReasonerCompare
printEquivalence(FolFormula, FolFormula) FolWriter
Prints an Equivalence
printEquivalence(FolFormula, FolFormula) Prover9Writer
printEquivalence(FolFormula, FolFormula) TptpWriter
printer Prover9Test
printer TPTPTest
printFormula(RelationalFormula) Prover9Writer
Creates a representation of a formula in prover9 format.
printFormula(RelationalFormula) TptpWriter
Creates a TPTP representation of a formula.
printHelpText() CliMain
prints help text if cli is called with parameter "--help" or empty
argument array
printMEConsolidationProblem(PrintStream, int, String) MatlabUtils
Print optimization problem corresponding to ME consolidation.
printMinimumViolationProblem(PrintStream, int, String) MatlabUtils
Print optimization problem corresponding to minimal violation measure.
printNode(PrintStream, DigraphNode<T>, int) Digraph
prints a node
printQuery(FolFormula) FolWriter
Prints formatted representation of a Query.
printQuery(FolFormula) Prover9Writer
printQuery(FolFormula) TptpWriter
printStatus() ReasonerCompare
printTree(OutputStream, DigraphNode<T>) Digraph
prints a tree
printTrees(OutputStream) Digraph
prints a tree for every root node in the graph
printUsage(CmdLineParser, PrintStream) DefeasibleLogicProgram
printVar(Variable) Prover9Writer
Crates a type check or type def for a variable
printVar(Variable) TptpWriter
Crates a type check or type def for a variable
prob ProbabilisticLotteryAgent
Uncertainty on sub graphs.
prob T2BeliefState
The probability function on opponent models
prob T3BeliefState
The probability function on opponent models
prob ArgumentationLottery
Maps divisions to probabilities
prob LdoArgumentationLottery
Maps LdoFormulas to probabilities
prob ApproximateNaiveMlnReasoner
The approximated model of the MLN (saved for avoid double
computation).
prob SyntacticRandomPlBeliefSetSampler
The probability function modeling the random decisions.
ProbabilisticAggregatingDistanceFunction net.sf.tweety.logics.ml.analysis
This distance function uses an aggregator on a probabilistically normalized distance
for probabilities of each value.
ProbabilisticAggregatingDistanceFunction(AggregationFunction, int) ProbabilisticAggregatingDistanceFunction
Creates a new distance function with the given aggregator.
ProbabilisticArgumentationFramework net.sf.tweety.arg.prob
This class implements the probabilistic argumentation framework approach
of [Li, Oren, Norman.
ProbabilisticArgumentationFramework() ProbabilisticArgumentationFramework
Default constructor; initializes empty sets of arguments and attacks
ProbabilisticArgumentationFramework(Graph<Argument>) ProbabilisticArgumentationFramework
Creates a new PAF from the given graph, all arguments
and attacks have probability 1.
ProbabilisticConditional net.sf.tweety.logics.pcl.syntax
This class represents a probabilistic conditional of the form (B|A)[p]
with formulas A,B and a probability p.
ProbabilisticConditional(PropositionalFormula, Probability) ProbabilisticConditional
Creates a new probabilistic conditional with a tautological premise
and given conclusion and probability.
ProbabilisticConditional(PropositionalFormula, PropositionalFormula, Probability) ProbabilisticConditional
Creates a new probabilistic conditional with the given premise,
conclusion, and probability.
ProbabilisticConditional(Conditional, Probability) ProbabilisticConditional
Creates a new probabilistic conditional using the given conditional
and probability.
ProbabilisticExtension net.sf.tweety.arg.prob.semantics
This class implements a probabilistic interpretation for Dung argumentation frameworks, cf.
ProbabilisticExtension() ProbabilisticExtension
Creates a new probabilistic extension for the given theory.
ProbabilisticLotteryAgent net.sf.tweety.agents.dialogues.lotteries
An agent in a game of argumentation lotteries.
ProbabilisticLotteryAgent(String, DungTheory, SubgraphProbabilityFunction, UtilityFunction, Semantics) ProbabilisticLotteryAgent
Creates a new lottery agent
ProbabilisticLotteryAgent(String, DungTheory, SubgraphProbabilityFunction, UtilityFunction, Semantics, byte) ProbabilisticLotteryAgent
Creates a new lottery agent
ProbabilisticLotteryAgent(String, DungTheory, SubgraphProbabilityFunction, UtilityFunction, Semantics, byte, double) ProbabilisticLotteryAgent
Creates a new lottery agent
ProbabilisticLotteryAgentGenerator net.sf.tweety.agents.dialogues.lotteries.sim
Generates lottery agents.
ProbabilisticLotteryAgentGenerator(String) ProbabilisticLotteryAgentGenerator
ProbabilisticLotteryAgentGenerator(String, byte) ProbabilisticLotteryAgentGenerator
ProbabilisticLotteryAgentGenerator(String, byte, double) ProbabilisticLotteryAgentGenerator
ProbabilisticPNormDistanceFunction net.sf.tweety.logics.ml.analysis
This class implement the p-norm distance function where distances are normalized
corresponding to their distance to 0.5.
ProbabilisticPNormDistanceFunction(int, int) ProbabilisticPNormDistanceFunction
Creates a new p-norm distance function where distances are normalized.
ProbabilisticSum net.sf.tweety.math.func.fuzzy
Represents the probabilistic sum in fuzzy logic, i.e., S(x,y)=x+y-xy
ProbabilisticSum() ProbabilisticSum
probabilities ProbabilityDistribution
The probabilities of the interpretations.
probabilities ProbabilityFunction
The probabilities of the objects.
probability(Argument) ProbabilisticExtension
Computes the probability of the given argument.
probability(Interpretation) ProbabilityDistribution
Gets the probability of the given Herbrand interpretation (this is just an
alias for get(Object o).
probability(Formula) ProbabilityDistribution
Returns the probability of the given formula
probability ProbabilisticConditional
The probability of this conditional.
probability(FolFormula) CondensedProbabilityDistribution
PROBABILITY RpclCondensedProbabilityDistributionParserConstants
RegularExpression Id.
PROBABILITY RpclProbabilityDistributionParserConstants
RegularExpression Id.
probability(FolFormula) RpclProbabilityDistribution
Gets the probability of the given closed formula, i.e.
probability(RelationalConditional) RpclProbabilityDistribution
Gets the probability of the given closed relational conditional "re", i.e.
probability RelationalProbabilisticConditional
The probability of the formula.
Probability net.sf.tweety.math.probability
This class represents a probability, i.e.
Probability(Double) Probability
Creates a new probability with the given value
Probability(Probability) Probability
Creates a new probability from the given probability
probability(T) ProbabilityFunction
Gets the probability of the given object.
probability(Collection<? extends T>) ProbabilityFunction
Gets the probability of the given object.
ProbabilityAssignment(FolSignature) RpclCondensedProbabilityDistributionParser
ProbabilityAssignment(FolSignature) RpclProbabilityDistributionParser
probabilityAssignments DeductiveProbabilisticKnowledgebase
Probability assignments for formulas.
ProbabilityAware net.sf.tweety.logics.commons.syntax.interfaces
ProbabilityDistribution T extends Interpretation > - Class in net.sf.tweety.logics.pcl.semantics
This class represents a probability distribution on some logical language
ProbabilityDistribution(Signature) ProbabilityDistribution
Creates a new probability distribution.
ProbabilityFunction T extends java.lang.Comparable<T >> - Class in net.sf.tweety.math.probability
This class represents a probability distribution over some set of objects
ProbabilityFunction() ProbabilityFunction
Creates a new probability function.
ProbabilityFunction(ProbabilityFunction<T>) ProbabilityFunction
Creates a new probability function by copying the given one.
probabilityTerm(Argument, Map<Collection<Argument>, FloatVariable>) AbstractPASemantics
Constructs the term expressing the probability of the given argument
wrt.
probabilityTerm(FolFormula, Map<? extends Interpretation, FloatVariable>) AbstractRpclSemantics
Constructs the term expressing the probability of the given formula "f"
wrt.
probInputFiles RPCLPlugin
Problem net.sf.tweety.arg.dung.semantics
This enum contains all supported problems.
Problem(Problem.SubProblem, Semantics) Problem
Creates a new problem.
Problem.SubProblem net.sf.tweety.arg.dung.semantics
The actual computational sub-problem.
ProblemInconsistentException net.sf.tweety.math.opt
This exception is thrown when a problem cannot be solved due to its inconsistency.
ProblemInconsistentException() ProblemInconsistentException
ProboSolver net.sf.tweety.arg.dung.prover
ProboSolver(String, Shell) ProboSolver
Constructs a new instance of ProboSolver
probOutFile RPCLPlugin
probOutWriter RPCLPlugin
probParser RPCLPlugin
probProp SyntacticRandomPlBeliefSetSampler
The probability function used to sample propositions
probRecursionDecay BeliefStateConfiguration
The probability that an argument appearing in depth n does not appear
in depth n+1.
ProbTest net.sf.tweety.logics.ml.test
ProbTest() ProbTest
process() RuleBasedCReasoner
Processes the kappa values using the rules stored in the prioritzed rule list.
process InconsistencyUpdateEvent
process DefaultSequence
true if the sequence is a process
process(List<Program>, AnswerSetList) CredibilityRevision.AnswersetProcessing
The method takes the list of ordered programs and the answer set of the
credibility logic program and calculates a revided program
process(List<Program>, AnswerSetList) CredibilityRevision.DefaultBehavior
processes DefaultProcessTree
all processes of the process tree
processing CredibilityRevision
processResults(List<String>) DLVComplex
processTreeTest() RDLTest
Product net.sf.tweety.math.term
This class models a product of two terms.
Product() Product
Creates a new (empty) product.
Product(Term, Term) Product
Creates a new product with the given terms.
Product(Collection<? extends Term>) Product
Creates a new product with the given list of terms.
ProductAggregator net.sf.tweety.logics.ml.analysis
This aggregation function models the product function.
ProductAggregator() ProductAggregator
ProductNorm net.sf.tweety.math.func.fuzzy
Represents the product-norm in fuzzy logic, i.e., T(x,y)=xy
ProductNorm() ProductNorm
prog ArgumentationReasonerTest
program ArgumentationKnowledgeBase
program ScreenedRemainderSets
Program() ASPParser
Program net.sf.tweety.lp.asp.syntax
this class models an disjunctive logical program, which is
a collection of rules.
Program() Program
Default Ctor: Does nothing
Program(Program) Program
Copy Ctor: Used by clone method
Program(Collection<Rule>) Program
Add all rules from base to this program.
progressMap EvaluateRule
stores the old values of the kappa and is used to realize if some progress in calculation occured
projectAnswerSet() CredibilityRevision
Projects the answer set of the credibility program to the original alphabet
projectToT2BeliefState() T3BeliefState
Returns a T2-belief state that is a projection of this belief state,
i.e.
PROP SyntacticRandomPlBeliefSetSampler
properDefeater() TestDTree
propertyChange(PropertyChangeEvent) RevisionCompareView
Reacts to property change events to keep the view up to date.
propertyChange(PropertyChangeEvent) SimpleRevisionCompareView
Reacts to property change events to keep the view up to date.
PROPLOGIC__CALL_PARAMETER PropositionalLogicPlugin
PROPLOGIC__QUERY_DESCRIPTION PropositionalLogicPlugin
PROPLOGIC__QUERY_IDENTIFIER PropositionalLogicPlugin
PROPLOGIC__REASONER_DESCRIPTION PropositionalLogicPlugin
PROPLOGIC__REASONER_IDENTIFIER PropositionalLogicPlugin
PROPLOGIC__REASONER_SOLVERENUM PropositionalLogicPlugin
Proposition net.sf.tweety.logics.pl.syntax
This class represents a simple proposition in propositional logic.
Proposition() Proposition
Default-Ctor for dynamic instantiation
Proposition(String) Proposition
Creates a new proposition of the given name.
Proposition(Proposition) Proposition
PropositionalException net.sf.tweety.logics.pl.error
An Exception for the propositional language, it is thrown if a developer
tries to create illegal propositional statements like a predicate with an
arity greater than zero.
PropositionalException(LanguageException.LanguageExceptionReason) PropositionalException
PropositionalException(LanguageException.LanguageExceptionReason, String) PropositionalException
PropositionalFormula net.sf.tweety.logics.pl.syntax
This class represents the common ancestor for propositional formulae.
PropositionalFormula() PropositionalFormula
PropositionalFormulaGeneratorTest() AspicTest
PropositionalLanguage net.sf.tweety.logics.pl.lang
This class models a propositional language for a given signature.
PropositionalLanguage(Signature) PropositionalLanguage
Creates a new language on the given first-order signature.
PropositionalLogicPlugin net.sf.tweety.logics.pl.plugin
This class provides the JSPF-Plugin for the propositional logic library
Currently plugin is loadable but not executed
PropositionalLogicPlugin(String[]) PropositionalLogicPlugin
non-empty constructor in case of problems concerning jspf
PropositionalLogicPlugin() PropositionalLogicPlugin
actually used constructor, initializing start parameters for this plugin
PropositionalPredicate net.sf.tweety.logics.pl.syntax
A specialized predicate for propositional logic that only allows an identifier
but has no arguments and therefore has an arity of zero.
PropositionalPredicate() PropositionalPredicate
Default-Ctor for dynamic instantiation
PropositionalPredicate(String) PropositionalPredicate
Ctor: Creates a new propositional predicate with the given
name.
PropositionalSignature net.sf.tweety.logics.pl.syntax
This class captures the signature of a specific
propositional language.
PropositionalSignature(Collection<? extends Proposition>) PropositionalSignature
Creates a new propositional signature with the given set
of propositions.
PropositionalSignature() PropositionalSignature
Creates a new (empty) propositional signature.
PropositionalSignature(int) PropositionalSignature
Creates a new propositional signature with the given number
of propositions (named "A0"..."Anumvars".
protGenerator GameSimulator
The protocol generator.
Protocol net.sf.tweety.agents
A protocol gives instructions in which order agents have to be asked
for actions in a multi-agent system.
ProtocolGenerator T extends Protocol ,S extends Agent ,R extends MultiAgentSystem <S >> - Interface in net.sf.tweety.agents.sim
Generates protocols for simulation.
ProtocolListener net.sf.tweety.agents
A protocol listener listens on a protocol and is notified whenever an action is executed.
protocolTerminated() ProtocolListener
This method is called when the protocol terminates.
ProtocolTerminatedException net.sf.tweety.agents
A ProtocolTerminatedException is thrown when
a protocol is asked to perform a step but has already terminated.
ProtocolTerminatedException() ProtocolTerminatedException
Creates a new ProtocolTerminatedException.
Prover9 net.sf.tweety.logics.fol.prover
Invokes Prover9 (https://www.cs.unm.edu/~mccune/mace4/) and returns its
results.
Prover9(String, Shell) Prover9
Constructs a new instance pointing to a specific prover 9
Prover9(String) Prover9
Constructs a new instance pointing to a specific prover9
Prover9Test net.sf.tweety.logics.fol.test
Prover9Test() Prover9Test
Prover9Writer net.sf.tweety.logics.fol.writer
Prints single fol formulas and full knowledge bases to Porver9 format
(https://www.cs.unm.edu/~mccune/mace4/manual/2009-11A/)
Prover9Writer(Writer) Prover9Writer
creates new Prover9Writer
Prover9Writer() Prover9Writer
creates new Prover9Writer
pushNode(Node) JJTASPParserState
put(Argument, ArgumentStatus) Labeling
put(Argument, Double) NumericalArgumentRanking
put(Argument, Integer) StratifiedLabeling
put(Argument, L) SocialMapping
Sets the social value of the given argument
put(T, Probability) ProbabilityDistribution
put(Proposition, Double) FuzzyInterpretation
put(Collection<? extends Constant>, Integer) InstanceAssignment
put(Predicate, InstanceAssignment) ReferenceWorld
put(T, Probability) ProbabilityFunction
putAll(Map<? extends Argument, ? extends ArgumentStatus>) Labeling
putAll(Map<? extends Argument, ? extends Double>) NumericalArgumentRanking
putAll(Map<? extends Argument, ? extends Integer>) StratifiedLabeling
putAll(Map<? extends T, ? extends Probability>) ProbabilityDistribution
putAll(Map<? extends Proposition, ? extends Double>) FuzzyInterpretation
putAll(Map<? extends Predicate, ? extends InstanceAssignment>) ReferenceWorld
putAll(Map<? extends T, ? extends Probability>) ProbabilityFunction
putGenerator(NicePossibleWorld, Conditional) ConditionalStructure
Processes the generator of the given Conditional cond for the PossibleWorld
npw and saves it in the worldData data structure if it is not equal CG_ONE.