c RevisionComparePresenter.MockFormula
c MultiClassRbfTrainer
The c parameter for learning
c ProbabilisticPNorm
The parameter of the normalization.
C_PARAMETER MultiClassRbfTrainer
The c parameter for learning
CActionDescription net.sf.tweety.action.description.syntax
This class represents an action description for the action language C as a
set of causal rules, and provides some basic functionality such as grounding.
CActionDescription() CActionDescription
Creates a new empty action description.
CActionDescription(Collection<? extends CausalLaw>) CActionDescription
Creates a new belief set with the given collection of formulae.
CActionDescriptionConsistencyTester net.sf.tweety.action.description.analysis
This class is able to check, whether a given action description in the action
language C is consistent with regards to one simple consistency requirement:
The transition system described by the action description has at least one
state.
CActionDescriptionConsistencyTester(AspInterface) CActionDescriptionConsistencyTester
Creates a new consistency tester which will use the given answer set
solver.
calcSignature() Program
calculate SolveTime
nanoseconds to perform answer set calculation
calculateRemainderSetCandidates(Program) ScreenedRemainderSets
Recursively calculates consistent subsets of p.
calculateResultingAnswersets() SimpleRevisionCompareModel
calculateStates(CActionDescription, ActionSignature) CTransitionSystemCalculator
calculates the set of all states of the transition system described by an
action description.
calculateTransitionSystem(CActionDescription, ActionSignature) CTransitionSystemCalculator
Calculates a transition system as described by the given action description
using all symbols in the given action signature.
call() InconsistencyMeasurementProcess.UpdateCallee
call() InconsistencyMeasurementService.MeasurementCallee
cannotRead() TestDeLP
CanonicalIterator net.sf.tweety.logics.pl.util
Provides an iterator on all syntactically equivalent knowledge bases.
CanonicalIterator() CanonicalIterator
Default constructor.
CanonicalIterator(Long) CanonicalIterator
Creates a new enumerator that enumerates
knowledge bases starting from the given index
CanonicalIterator(Integer) CanonicalIterator
Creates a new enumerator that enumerates
knowledge bases starting from the given index
CanonicalIterator(BigInteger) CanonicalIterator
Creates a new enumerator that enumerates
knowledge bases starting from the given index
CanonicalIterator(Long, Long) CanonicalIterator
Creates a new enumerator that enumerates
knowledge bases starting from the given start
index up to the given end index (including)
CanonicalIterator(Integer, Integer) CanonicalIterator
Creates a new enumerator that enumerates
knowledge bases starting from the given start
index up to the given end index (including)
CanonicalIterator(BigInteger, BigInteger) CanonicalIterator
Creates a new enumerator that enumerates
knowledge bases starting from the given start
index up to the given end index (including)
CanonicalUndercut net.sf.tweety.arg.deductive.semantics.attacks
This attack notion models the canonical undercut relation; A is defeated by B iff claim(B) =- \neg support(A).
CanonicalUndercut() CanonicalUndercut
Private constructor.
capabilities() FirstOrderLogicPlugin
capabilities() PropositionalLogicPlugin
capabilities() RPCLPlugin
capabilities() PreferencesPlugin
cat BooleanCategory
The value of this category.
cat DoubleCategory
The value of the category.
categorize(ArgumentTree) Categorizer
This method categorizes the given argument tree.
categorize(ArgumentTree) ClassicalCategorizer
categorize(ArgumentTree, DeductiveArgumentNode, DeductiveArgumentNode) ClassicalCategorizer
Performs the bottom-up search.
categorize(ArgumentTree) HCategorizer
categorize(ArgumentTree, DeductiveArgumentNode, DeductiveArgumentNode) HCategorizer
Categorizes the node in the given tree.
categorize(ArgumentTree) CredibilityCategorizer
categorize(ArgumentTree, DeductiveArgumentNode, DeductiveArgumentNode) CredibilityCategorizer
Performs the bottom-up search.
Categorizer net.sf.tweety.arg.deductive.categorizer
Classes implementing this interface represent categorizer in the sense
of Definition 8.10 in
categorizer AbstractDeductiveArgumentationReasoner
The categorizer used for reasoning.
categorizer ArgumentativeTransformationFunction
The categorizer used by this transformation function.
Category net.sf.tweety.machinelearning
A category within the space of observations.
CausalLaw net.sf.tweety.action.description.syntax
A basic interface representing a causal law.
CautiousArgumentationAgent net.sf.tweety.agents.dialogues.structured
This class models a cautious argumentation agent, i.e.
CautiousArgumentationAgent(StructuredArgumentationFramework, UtilityFunction, Proposition) CautiousArgumentationAgent
Creates a new (non-single-step) agent with the given (local) view and utility function.
CautiousArgumentationAgent(StructuredArgumentationFramework, UtilityFunction, boolean, Proposition) CautiousArgumentationAgent
Creates a new agent with the given (local) view and utility function.
cbOperatorLeft RevisionCompareView
cbOperatorLeft SimpleRevisionCompareView
cbOperatorRight RevisionCompareView
cbOperatorRight SimpleRevisionCompareView
CcInconsistencyMeasure S extends Formula > - Class in net.sf.tweety.logics.commons.analysis
This class implements the inconsistency measure I_CC from
[Said Jabbour and Yue Ma and Badran Raddaoui.
CcInconsistencyMeasure(MusEnumerator<S>, Solver) CcInconsistencyMeasure
Creates a new measure that uses the given MUS enumerator and
Integer programming solver
CF2_SEMANTICS Semantics
CF2Example net.sf.tweety.arg.dung.examples
Example code for CF2 semantics
CF2Example() CF2Example
change(PartialProbabilityAssignment, DungTheory) AbstractPAChangeOperator
change(ProbabilisticExtension, DungTheory) AbstractPAChangeOperator
change(PartialProbabilityAssignment, DungTheory) ChangeOperator
Given a partial probability assignment ppa and an argumentation theory, compute
the closest probabilistic extension that is adequate for observing the theory in
the state ppa.
change(ProbabilisticExtension, DungTheory) ChangeOperator
Given a probabilistic extension and an argumentation theory, compute
the closest probabilistic extension that is adequate for observing the theory in
the state p.
change(PartialProbabilityAssignment, DungTheory) PARevisionOperator
change(PartialProbabilityAssignment, DungTheory) PAUpdateOperator
change RevisionCompareModel
delegator for the implementation of the PropertyChange
change SimpleRevisionCompareModel
delegator for the implementation of the PropertyChange
changeOccurred() EvaluateRule
Updates the progressMap and also checks if a change to one kappa value is occurred sicnge the last application of
this rule.
ChangeOperator net.sf.tweety.arg.prob.dynamics
This interface provides common methods for change operators
for probabilistic argumentation.
changeOrder() POChanger
characteristicFunction(PclBeliefSet, Map<ProbabilisticConditional, Probability>) AbstractCreepingMachineShop
Returns a modified belief base that replaces each conditionals probability
by the one given by "values".
check1Norm() MinimalViolationInconsistencyMeasureLPSolveTest
checkedFormulaType(T) AssociativeFormulaSupport
checkErrors() Clingo
checkErrors() SolverBase
Default implementation of error checking (should work for DLV package)
checkFeasableCount ApacheCommonsCMAESOptimizer
Determines how often new random objective variables are generated in case they are out of bounds.
checkFormula(FolFormula) NLPRule
Helper methods checks if the given FOL formula is supported by the nested logic
program language, that means it checks if it contains quantifiers and if that
is the case it throws a LanguageException
checkIterativeLeft RevisionCompareView
checkIterativeRight RevisionCompareView
checkMaxNorm() MinimalViolationInconsistencyMeasureLPSolveTest
checkSolver(String) SolverBase
Checks if the solver in the given path is an existing file with
execute permission.
checkSubsetCondition(Collection<T>, Collection<Collection<T>>) AprioriMiner
Checks whether all subsets of set obtained by removing
exactly one element, are contained in the given sets.
checkValid() Argument
An argument may only contain nonempty ground rules (i.e.
children DialecticalTree
The children of this node; size=0 indicates a leaf
children DungTheory
children SimpleNode
childrenAccept(ASPParserVisitor, Object) SimpleNode
Accept the visitor.
claim DeductiveArgument
The claim of this argument.
claim SimplePlLogicArgument
claim SimplePlRule
claim BasicArgument
The claim of this basic argument.
classical_negation LogicalSymbols
CLASSICAL_NEGATION() LogicalSymbols
ClassicalCategorizer net.sf.tweety.arg.deductive.categorizer
This class implements a simple categorizer that does
an bottom-up marking of the tree; leafs are marked
undefeated and an inner node is marked defeated
if at least one child is marked undefeated and
defeated otherwise.
ClassicalCategorizer() ClassicalCategorizer
ClassicalFormula net.sf.tweety.logics.commons.syntax.interfaces
This interface models a classical formula, i.e.
ClassificationTester S extends Observation ,T extends Category > - Class in net.sf.tweety.machinelearning
Classes implementing this interface provide the means to test a training mechanism
for performance.
ClassificationTester() ClassificationTester
Classifier net.sf.tweety.machinelearning
A classifier classifies observations into categories.
classify(Observation) Classifier
Classifies the given observation.
classify(Observation) SupportVectorMachine
CLaw net.sf.tweety.action.description.syntax
The action description language C consists of two distinct expressions:
static laws and dynamic laws.
CLaw() CLaw
Creates an empty causal law.
CLaw(FolFormula) CLaw
Creates a causal law of the form caused headFormula if True
CLaw(FolFormula, Set<GroundingRequirement>) CLaw
Creates a causal law of the form caused headFormula if True requires
requirements
CLaw(FolFormula, FolFormula, Set<GroundingRequirement>) CLaw
Creates a causal law of the form caused headFormula if ifFormula requires
requirements
CLaw(FolFormula, FolFormula) CLaw
Creates a causal law of the form caused headFormula if ifFormula
CLawParser net.sf.tweety.action.description.parser
This class implements a parser for causal laws in C.
CLawParser(ActionSignature) CLawParser
This parser needs a valid action signature to parse causal laws.
clazz DefaultStreamBasedInconsistencyMeasure
The class of inconsistency measurement processes.
ClBeliefSet net.sf.tweety.logics.cl.syntax
This class models a belief set on conditional logic, i.e.
ClBeliefSet() ClBeliefSet
Creates a new (empty) conditional belief set.
ClBeliefSet(Collection<? extends Conditional>) ClBeliefSet
Creates a new conditional belief set with the given collection of
conditionals.
clear() MultiAgentSystem
clear() AbaExtension
clear() LdoAssociativeFormula
clear() Extension
clear() Labeling
clear() NumericalArgumentRanking
clear() StratifiedLabeling
clear() ArgumentStructure
clear() BeliefSet
clear() InterpretationSet
clear() SetSignature
clear() ConditionalStructure
Clears the ConditionalStructure, after calling this method the
Structure is empty.
clear() AssociativeFormulaSupport
clear() AssociativeFOLFormula
clear() ProbabilityDistribution
clear() FuzzyInterpretation
clear() AssociativePropositionalFormula
clear() Extension
clear() ReferenceWorld
clear() RpclProbabilityDistribution
clear() DLPHead
clear() Interval
clear() ProbabilityFunction
clear() PreferenceOrder
clears the current preference order element set
clearNodeScope(Node) JJTASPParserState
CliMain net.sf.tweety.cli.plugins
skeleton of the new main method of this CLI using plugins.
CliMain() CliMain
Clingo net.sf.tweety.lp.asp.reasoner
Invokes Clingo (Part of the
Potassco project ),
an ASP system that grounds and solves logic programs, and returns computed
answer sets.
Clingo(String) Clingo
ClingoTest net.sf.tweety.lp.asp.analysis
Test class for Clingo.
ClingoTest() ClingoTest
ClNLPTranslator net.sf.tweety.logics.translators.clnlp
Translates between propositional Conditionals and NLP.
ClNLPTranslator() ClNLPTranslator
clone() BeliefState
clone() T1BeliefState
clone() T2BeliefState
clone() T3BeliefState
clone() DefeasibleRule
clone() DelpFact
clone() StrictRule
clone() AbstractGraphLdoModality
clone() AbstractLdoModality
clone() LdoArgument
clone() LdoBoxModality
clone() LdoConjunction
clone() LdoDiamondModality
clone() LdoDisjunction
clone() LdoFormula
clone() LdoGraphBoxModality
clone() LdoGraphDiamondModality
clone() LdoNegation
clone() LdoRelation
clone() ClBeliefSet
clone() Conditional
clone() AssociativeFormulaSupport
clone() ComplexLogicalFormulaAdapter
clone() Constant
clone() FunctionalTerm
clone() Functor
clone() ComplexLogicalFormula
clone() SimpleLogicalFormula
Creates a deep copy of this formula
clone() Term
Creates a deep copy of the term
clone() TypedStructure
Creates a deep copy of this object
clone() NumberTerm
clone() Predicate
clone() RelationalFormula
clone() Sort
clone() TermAdapter
clone() TypedStructureAdapter
clone() Variable
clone() Conjunction
clone() Contradiction
clone() Disjunction
clone() Equivalence
clone() ExistsQuantifiedFormula
clone() FOLAtom
clone() FolFormula
clone() ForallQuantifiedFormula
clone() Implication
clone() Negation
clone() Tautology
clone() Necessity
clone() Possibility
clone() MlnFormula
clone() Conjunction
clone() Contradiction
clone() Disjunction
clone() Negation
clone() Proposition
clone() PropositionalFormula
clone() PropositionalPredicate
clone() Tautology
clone() RelationalConditional
clone() DefaultRule
clone() AnswerSet
clone() AnswerSetList
clone() Aggregate
clone() Arithmetic
clone() Comparative
clone() DLPAtom
clone() DLPElement
clone() DLPElementAdapter
clone() DLPHead
clone() DLPNeg
clone() DLPNot
clone() ListTerm
clone() ListTermValue
clone() Program
clone() Rule
clone() SetTerm
clone() SymbolicSet
clone() AnswerSet
clone() AnswerSetList
clone() NLPNot
clone() NLPRule
clone() ConstraintSatisfactionProblem
clone() OptimizationProblem
clone() CustomStringListCommandParameter
method to clone this object for instantiation
clone() FileListCommandParameter
clone() IntegerCommandParameter
clone() SelectionCommandParameter
clone() StringListCommandParameter
method to clone this object for instantiation
cloneWithAddedTerm(Term<?>) DLPAtom
cloneWithAddedTerm(Term<?>) DLPLiteral
Creates a copy of the literal and adds the
given term as argument to the end of the argument
list.
cloneWithAddedTerm(Term<?>) DLPNeg
close() FolWriter
Closes the Writer.
close() Prover9Writer
close() SPASSWriter
close() TPTPWriter
close() MleanCoPWriter
Closes the Writer.
close() SPASSWriter
closeNodeScope(Node, int) JJTASPParserState
closeNodeScope(Node, boolean) JJTASPParserState
ClosureTest() ABATest
ClParser net.sf.tweety.logics.cl.parser
This class implements a parser for conditional logic.
ClParser() ClParser
cmdOptions SpassFolReasoner
Command line options that will be used by SPASS when executing the query.
cmdOptions SPASSModalReasoner
Command line options that will be used by SPASS when executing the query.
CNF_RATIO StreamInconsistencyEvaluationExample
CNF_RATIO StreamInconsistencyEvaluationExample2
CnfParser net.sf.tweety.arg.dung.parser
Parses abstract argumentation frameworks in the CNF/Dimacs Format used for the
SAT solver competition (see also http://people.sc.fsu.edu/~jburkardt/data/cnf/cnf.html).
CnfParser() CnfParser
CnfSampler net.sf.tweety.logics.pl.util
A simple sampler for propositional belief bases.
CnfSampler(Signature, double) CnfSampler
Creates a new sampler for the given signature.
CnfSampler(Signature, double, int, int) CnfSampler
Creates a new sampler for the given signature.
CnfWriter net.sf.tweety.arg.dung.writer
Writes an abstract argumentation framework into a file of the
CNF format.
CnfWriter() CnfWriter
cntArguments IsoSafeEnumeratingDungTheoryGenerator
The number of arguments in the theory that is to be generated next.
cntAttacks IsoSafeEnumeratingDungTheoryGenerator
The number of attacks in the theory that is to be generated next.
coherence(MarkovLogicNetwork, AbstractMlnReasoner, FolSignature) AbstractCoherenceMeasure
Measures the coherence of the given MLN using the given reasoner.
coherence(MarkovLogicNetwork, AbstractMlnReasoner, FolSignature) AggregatingCoherenceMeasure
coherenceMeasure DefaultCompatibilityMeasure
The coherence measure used for computing compatibility.
CoherentPASemantics net.sf.tweety.arg.prob.semantics
P is coherent wrt.
CoherentPASemantics() CoherentPASemantics
cohSemantics JustifiablePASemantics
The semantics this semantics is based upon.
collapseAssociativeFormulas() Conjunction
collapseAssociativeFormulas() Disjunction
collapseAssociativeFormulas() Equivalence
collapseAssociativeFormulas() ExistsQuantifiedFormula
collapseAssociativeFormulas() FOLAtom
collapseAssociativeFormulas() FolFormula
This method collapses all associative operations appearing
in this term, e.g.
collapseAssociativeFormulas() ForallQuantifiedFormula
collapseAssociativeFormulas() Implication
collapseAssociativeFormulas() Negation
collapseAssociativeFormulas() SpecialFormula
collapseAssociativeFormulas() Necessity
collapseAssociativeFormulas() Possibility
collapseAssociativeFormulas() Conjunction
collapseAssociativeFormulas() Disjunction
collapseAssociativeFormulas() Negation
collapseAssociativeFormulas() Proposition
collapseAssociativeFormulas() PropositionalFormula
This method collapses all associative operations appearing
in this term, e.g.
collapseAssociativeFormulas() SpecialFormula
collapseAssociativeFormulas() NLPNot
collapseAssociativeOperations() Statement
This method collapses all associative operations appearing
in this statement, e.g.
collapseAssociativeOperations() ConstraintSatisfactionProblem
This method collapses all associative operations appearing
in the target function and the constraints, e.g.
collapseAssociativeOperations() OptimizationProblem
collapseAssociativeOperations() AssociativeOperation
collapseAssociativeOperations() Constant
collapseAssociativeOperations() Difference
collapseAssociativeOperations() Fraction
collapseAssociativeOperations() FunctionalTerm
collapseAssociativeOperations() Term
This method collapses all associative operations appearing
in this term, e.g.
collapseAssociativeOperations() Variable
column SimpleCharStream
column SimpleCharStream
column SimpleCharStream
column SimpleCharStream
column SimpleCharStream
combine(Set<Map<E, F>>) MapTools
Combines all maps in singleMaps to one maps containing
every assignment of each map in singleMaps.
combineWithAnd(Conjuctable) DelpRule
combineWithAnd(Conjuctable) LdoFormula
combineWithAnd(Conjuctable) Conditional
combineWithAnd(Conjuctable) Conjuctable
Returns a conjunction of this and the given formula.
combineWithAnd(Conjuctable) RelationalFormula
combineWithAnd(Conjuctable) FolFormula
combineWithAnd(Conjuctable) ModalFormula
combineWithAnd(Conjuctable) MlnFormula
combineWithAnd(Conjuctable) PropositionalFormula
combineWithAnd(Conjuctable) RelationalConditional
combineWithAnd(Conjuctable) DefaultRule
combineWithOr(Disjunctable) DelpRule
combineWithOr(Disjunctable) LdoFormula
combineWithOr(Disjunctable) Conditional
combineWithOr(Disjunctable) Disjunctable
combineWithOr(Disjunctable) RelationalFormula
combineWithOr(Disjunctable) FolFormula
combineWithOr(Disjunctable) ModalFormula
combineWithOr(Disjunctable) MlnFormula
combineWithOr(Disjunctable) PropositionalFormula
combineWithOr(Disjunctable) RelationalConditional
combineWithOr(Disjunctable) DefaultRule
combineWithOr(Disjunctable) DLPHead
COMMA ASPParserConstants
RegularExpression Id.
CommandParameter net.sf.tweety.plugin.parameter
This is the abstract basics class for CommandParameter
Never leave identifier and description arguments for the constructor
empty, they can not be changed afterwards
CommandParameter(String, String) CommandParameter
non-empty constructor (member variables cannot be changed after construction)
COMMENT ASPParserConstants
RegularExpression Id.
comment ASTComment
CommonColdExample(int) MlnExample
commonView SasAgent
The current state of the argumentation as perceived by all agents.
commonView StructuredArgumentationSystem.SasEnvironment
The common view of all agents.
comp SetComparator
A comparator for single elements of type T
Comparative() ASPParser
Comparative net.sf.tweety.lp.asp.syntax
This class implements comparative predicates as described in
the DLV manual.
Comparative(Comparative) Comparative
Comparative(String, Term<?>, Term<?>) Comparative
compare(AspicArgument<T>, AspicArgument<T>) LastLinkOrder
compare(InferenceRule<T>, InferenceRule<T>) RuleComparator
compare(Collection<T>, Collection<T>) SetComparator
compare(AspicArgument<T>, AspicArgument<T>) SimpleAspicOrder
compare(AspicArgument<T>, AspicArgument<T>) WeakestLinkOrder
compare(AspicArgument<T>, AspicArgument<T>) SimpleAspicOrder
compare(DelpArgument, DelpArgument, DefeasibleLogicProgram) ComparisonCriterion
This method returns the relation of argument1 to argument2
given context .
compare(DelpArgument, DelpArgument, DefeasibleLogicProgram) EmptyCriterion
compare(DelpArgument, DelpArgument, DefeasibleLogicProgram) GeneralizedSpecificity
compare(Argument, Argument) ArgumentRanking
compare(Double, Double) AbstractSocialSemantics
compare(Double, Double) SimpleProductSemantics
compare ReasonerExample
compare(NicePossibleWorld, NicePossibleWorld) ConditionalStructure
compare(Pair<Proposition, Boolean>, Pair<Proposition, Boolean>) NicePossibleWorld
compare(Program, Program) ELPLexicographicalComparator
compare(Map<FloatVariable, Term>, Map<FloatVariable, Term>) SimpleGeneticOptimizationSolver.FitnessComparator
compareEqualityWith(PreferenceOrder<T>) PreferenceOrder
compares this preference order to another given one whether each relation
is contained in both
compareLiterals Utilities
Compare DeLP literals as they arise in rules, i.e.,
~B < A (negation is always smaller)
A < B (atoms = predicates are sorted by predicate name first...
CompareOperator() ASPParser
compareRules Utilities
Compare DeLP rules:
1) compare heads (conclusion) as literals
2) if the same, then
a) DelpFact < StrictRule < DefeasibleRule
b) within same subclass, compare set of literals...
compareTo(T2BeliefState) T2BeliefState
compareTo(T3BeliefState) T3BeliefState
compareTo(LdoArgument) LdoArgument
compareTo(Extension) Extension
compareTo(DungTheory) DungTheory
compareTo(TypedStructureAdapter) TypedStructureAdapter
compareTo(ApproximateNaiveMlnReasoner.WeightedHerbrandInterpretation) ApproximateNaiveMlnReasoner.WeightedHerbrandInterpretation
compareTo(PossibleWorld) PossibleWorld
compareTo(Proposition) Proposition
compareTo(DLPLiteral) DLPAtom
compareTo(DLPLiteral) DLPNeg
compareTo(Rule) Rule
comparisonCriterion DelpReasoner
The comparison criterion is initialized with the "empty criterion"
ComparisonCriterion net.sf.tweety.arg.delp.semantics
This class is the superclass for all comparison criteria between two arguments in defeasible logic programming.
ComparisonCriterion() ComparisonCriterion
ComparisonCriterion.Factory net.sf.tweety.arg.delp.semantics
To select a subclass and create an instance throw a static factory method.
ComparisonCriterion.Result net.sf.tweety.arg.delp.semantics
compatibility(List<MarkovLogicNetwork>, AbstractMlnReasoner, List<FolSignature>) CompatibilityMeasure
Measures the compatibility of the given MLNs wrt.
compatibility(List<MarkovLogicNetwork>, AbstractMlnReasoner, List<FolSignature>) DefaultCompatibilityMeasure
CompatibilityMeasure net.sf.tweety.logics.mln.analysis
This interface represents a compatibility measure for MLNs.
Compilation net.sf.tweety.arg.deductive.semantics
Instances of this class are compilations in the sense of
Definition 8 in
Compilation(DeductiveKnowledgeBase) Compilation
Creates the compilation of the given knowledge base.
CompilationNode net.sf.tweety.arg.deductive.semantics
Instances of this class represent nodes in the compilation of
a knowledge base, i.e.
CompilationNode(Collection<? extends PropositionalFormula>) CompilationNode
Creates a new compilation node with the given
set of formulas.
CompilationReasoner net.sf.tweety.arg.deductive.reasoner
This class implements the approach of knowledge base compilation as proposed in
CompilationReasoner(Categorizer, Accumulator) CompilationReasoner
Creates a new compilation reasoner for the given belief base,
categorizer, and accumulator.
complement() DelpRule
complement() LdoFormula
complement() Conditional
complement() Invertable
complement() RelationalFormula
complement() FolFormula
complement() ModalFormula
complement() MlnFormula
complement() ProbabilisticConditional
complement() PropositionalFormula
complement() RelationalConditional
complement() DefaultRule
complement() RelationalProbabilisticConditional
complement() DLPAtom
complement() DLPLiteral
complement() DLPNeg
complement() Probability
Returns the complement of this probability, i.e.
ComplementTest() AspicTest
COMPLETE_SEMANTICS Semantics
CompleteReasoner T extends Formula > - Class in net.sf.tweety.arg.aba.reasoner
CompleteReasoner() CompleteReasoner
completion ArgumentCompletion
The completion of the argument, i.e., the set of strict rules used in the derivation
of the conclusion of the argument.
ComplexLogicalFormula net.sf.tweety.logics.commons.syntax.interfaces
A complex logical formula can contain arguments referred as terms, this
interface provides methods to substitute and exchange those terms.
ComplexLogicalFormulaAdapter net.sf.tweety.logics.commons.syntax
Abstract base class for ComplexLogicalFormula, that are formulas which
implement substitute(), exchange(), getTerms(), isGround() and isWellFormed()
and therefore use terms to describe themself.
ComplexLogicalFormulaAdapter() ComplexLogicalFormulaAdapter
ComplexNumber net.sf.tweety.math
A complex number.
ComplexNumber(double, double) ComplexNumber
Constructs a new complex number with the given real
and imaginary parts.
ComplexQueryTest() MleanCoPTest
ComplexQueryTest() SPASSTest
computeExtensionsViaSccs(DungTheory, List<Collection<Argument>>, int, Collection<Argument>, Collection<Argument>, Collection<Argument>) SimpleSccCompleteReasoner
Computes extensions recursively following the SCC structure.
computeModel(MarkovLogicNetwork, FolSignature) ApproximateNaiveMlnReasoner
Computes the model of the given MLN wrt.
computeModel(MarkovLogicNetwork, FolSignature) NaiveMlnReasoner
Computes the model of the given MLN.
computeModels(Program, int) Clingo
computeModels(String, int) Clingo
computeModels(List<String>, int) Clingo
computeModels(Program, int) DLV
computeModels(String, int) DLV
computeModels(List<String>, int) DLV
computeModels(Program, int) DLVComplex
computeModels(String, int) DLVComplex
computeModels(List<String>, int) DLVComplex
computeModels(Program, int) Solver
This method computes at most maxModels answer sets for a given program.
computeModels(String, int) Solver
This method computes at most maxModels answer sets for a given program as a flat string.
computeModels(List<String>, int) Solver
This method computes at most maxModels for a given program, a collection of facts,
and an arbitrary number of additional programs as a file resource.
computeWeight(MarkovLogicNetwork, HerbrandInterpretation, FolSignature) AbstractMlnReasoner
Computes the (unnormalized) weight of the given Herbrand interpretation
with respect to the formulas in this reasoner's MLN.
conc AspicArgument
The conclusion of the argument's top rule
conc DefaultRule
The conclusion of the default rule
Concept net.sf.tweety.logics.commons.syntax
This class models concepts used in description logics
Concept() Concept
Concept(String) Concept
Concept(String, int) Concept
Concept(String, Set<Individual>) Concept
concepts DlSignature
conclusion InferenceRule
The rule's conclusion
conclusion DelpArgument
The conclusion of this argument (must be a literal)
conclusion Conditional
The conclusion of this conditional.
conclusion RelationalConditional
The conclusion of the conditional.
conclusion NLPRule
conclusion AssociationRule
The conclusion of the rule.
cond KappaValue
The Conditional that generates this kappa value
condensedEntropy() CondensedProbabilityDistribution
Returns the condensed entropy of this distribution (neglecting multiplicators of
reference worlds.
CondensedProbabilityDistribution net.sf.tweety.logics.rpcl.semantics
Instances of this class represent condensed probability distributions, rf.
CondensedProbabilityDistribution(RpclSemantics, FolSignature) CondensedProbabilityDistribution
Creates a new condensed probability distribution for the given signature.
Conditional net.sf.tweety.logics.cl.syntax
This class represents a basic conditional (B|A) with formulas A,B.
Conditional(PropositionalFormula) Conditional
Creates a new conditional with a tautological premise
and given conclusion.
Conditional(PropositionalFormula, PropositionalFormula) Conditional
Creates a new conditional with the given premise
and conclusion.
conditionalData ConditionalStructure
This maps saves the same data as worldData but uses another mapping allowing fast
access to the Generators using Conditionals.
conditionalProbability(Conditional) ProbabilityDistribution
Returns the probability of the given conditional
conditionalStructure RuleAdapter
the conditional structure the rule works on
ConditionalStructure net.sf.tweety.logics.cl.semantics
Represents a conditional structure as introduced in Section 3.5
"Conditionals in Nonmonotonic Reasoning and Belief Revision" of
Gabrielle Kern-Isberner
Internally it saves the data to two nested Maps.
ConditionalStructure() ConditionalStructure
Default-Ctor generates empty Conditional structure
ConditionalStructure(Comparator<NicePossibleWorld>) ConditionalStructure
Ctor: Generates an empty ConditionalStructure that uses the given
Comparator to sort its worldData map.
ConditionalStructure(Collection<Conditional>) ConditionalStructure
Ctor: generates a conditional structure containing the given conditionals
ConditionalStructure(Collection<Conditional>, Comparator<NicePossibleWorld>) ConditionalStructure
Ctor: Generates a ConditionalStructure containing the given conditionals and
using the given comparator to sort the worldData map.
ConditionalStructure.Generator net.sf.tweety.logics.cl.semantics
The possible values of a conditional for a possible world
ConditionalStructureKappaBuilder net.sf.tweety.logics.cl.kappa
This class builds the initial kappa value list for a given conditional
structure.
ConditionalStructureKappaBuilder() ConditionalStructureKappaBuilder
Default-Ctor: Generates a builder that does not uses fast evaluation
ConditionalStructureKappaBuilder(boolean) ConditionalStructureKappaBuilder
Ctor: Generates a builder that uses fast evaluation depending on the given parameter
confidence(Collection<Collection<T>>) AssociationRule
Returns the confidence of this rule wrt.
ConfidentAttack net.sf.tweety.arg.lp.semantics.attack
This notion of attack models the confident attack relation.
ConfidentAttack() ConfidentAttack
Private constructor.
confidentAttack StrongConfidentAttack
confidentRebut ConfidentAttack
ConfidentRebut net.sf.tweety.arg.lp.semantics.attack
This notion of attack models the strong rebut relation.
ConfidentRebut() ConfidentRebut
Private constructor.
config GroundedGameT1AgentGenerator
The configuration for generating agents.
config GroundedGameT2AgentGenerator
The configuration for generating agents.
config GroundedGameT3AgentGenerator
The configuration for generating agents.
config DefaultStreamBasedInconsistencyMeasure
Configuration options for to be given to the inconsistency measurement process.
CONFIG_AGGREGATIONFUNCTION WindowInconsistencyMeasurementProcess
Key for the configuration map that points to the aggregation function used.
CONFIG_KEY_NUMBEROFPOPULATIONS ContensionInconsistencyMeasurementProcess
Configuration key for the number of populations tried out.
CONFIG_KEY_NUMBEROFPOPULATIONS HsInconsistencyMeasurementProcess
Configuration key for the number of populations tried out.
CONFIG_KEY_SIGNATURE ContensionInconsistencyMeasurementProcess
Configuration key for the signature.
CONFIG_KEY_SIGNATURE HsInconsistencyMeasurementProcess
Configuration key for the signature.
CONFIG_KEY_WITNESSPROVIDER ContensionInconsistencyMeasurementProcess
Configuration key for the consistency tester.
CONFIG_MEASURE WindowInconsistencyMeasurementProcess
Key for the configuration map that points to the inconsistency measure to be used.
CONFIG_NAME WindowInconsistencyMeasurementProcess
Key for the configuration map that points to the name to be used.
CONFIG_SMOOTHINGFACTOR ContensionInconsistencyMeasurementProcess
Key for the configuration map that points to the smoothing factor to be used.
CONFIG_SMOOTHINGFACTOR HsInconsistencyMeasurementProcess
Key for the configuration map that points to the smoothing factor to be used.
CONFIG_TIMEOUT InconsistencyMeasurementProcess
Key for the configuration map that gives a time out (given in seconds)
for a single update operation Default value is -1 which means no time out.
CONFIG_WINDOWSIZE WindowInconsistencyMeasurementProcess
Key for the configuration map that points to the window size to be used.
configCLI() CliMain
This method is meant to load the tweety plugin pathes on startup
CONFLICTFREE_SEMANTICS Semantics
CONJ SyntacticRandomSampler
Conjuctable net.sf.tweety.logics.commons.syntax.interfaces
Formulas implementing this interface can be connected by using
AND.
CONJUNCTION() LogicalSymbols
Conjunction net.sf.tweety.logics.fol.syntax
The classical conjunction of first-order logic.
Conjunction(Collection<? extends RelationalFormula>) Conjunction
Creates a new conjunction with the given inner formulas.
Conjunction() Conjunction
Creates a new (empty) conjunction.
Conjunction(RelationalFormula, RelationalFormula) Conjunction
Creates a new conjunction with the two given formulae
Conjunction net.sf.tweety.logics.pl.syntax
This class represents a conjunction in propositional logic.
Conjunction(Collection<? extends PropositionalFormula>) Conjunction
Creates a new conjunction with the given inner formulas.
Conjunction() Conjunction
Creates a new (empty) conjunction.
Conjunction(PropositionalFormula, PropositionalFormula) Conjunction
Creates a new conjunction with the two given formulae
conjunctions SymbolicSet
ConjunctionTest() PlParserTest
ConsistencyTester T extends BeliefBase > - Interface in net.sf.tweety.logics.commons.analysis
Classes implementing this interface are capable of testing
whether a given belief base is consistent.
ConsistencyWitnessProvider B extends BeliefBase ,S extends Formula > - Interface in net.sf.tweety.logics.commons.analysis
Provides methods for returning some model (if it exists) of
a set of formulas.
consolidate(Collection<T>) ConsolidationOperator
Returns a consolidation of set p, i.e.
consolidate(Program) ScreenedMaxichoiceConsolidation
Calculates the screened consolidation !r of program p using a maxi-choice selection
function s, i.e.
consolidate(Collection<Rule>) ScreenedMaxichoiceConsolidation
ConsolidationOperator T extends Formula > - Interface in net.sf.tweety.lp.asp.beliefdynamics.baserevision
This interface represents an consolidation operator for belief bases
as defined in [KKI12].
constant VarConstNeqRequirement
Constant net.sf.tweety.logics.commons.syntax
A Constant represents an constant object in the world of
a logical language.
Constant(String) Constant
Ctor: Creates a new Constant with the given name, uses "Thing"
as sort.
Constant(String, Sort) Constant
Ctor: Creates a new Constant with the given name and sort
Constant(Constant) Constant
Copy-Ctor: Creates a deep copy of the given Constant
CONSTANT ASPParserConstants
RegularExpression Id.
Constant net.sf.tweety.math.term
This class models an abstract constant, e.g.
Constant() Constant
constantPrefix CredibilityRevision
a prefix used to mark constants which represents the id of positive literals.
constants Sort
The set of constants of this sort
constants FolSignature
ConstantSet(FolSignature) RpclCondensedProbabilityDistributionParser
consTester DrasticInconsistencyMeasure
The consistency tester used for measuring.
ConstraintSatisfactionProblem net.sf.tweety.math.opt
This class models a general constraint satisfaction problem.
ConstraintSatisfactionProblem() ConstraintSatisfactionProblem
Creates a new and empty csp.
ConstraintSatisfactionProblem(Collection<? extends Statement>) ConstraintSatisfactionProblem
Creates a new csp with the given statements
constructAndSolveProblem(Collection<PropositionalFormula>, Map<Proposition, Variable>) FuzzyInconsistencyMeasure
Utility method
constructRankingFunction(ClBeliefSet, Integer[]) BruteForceCReasoner
Constructs a ranking function with the given kappa values [k1+,k1-,...,kn+,kn-], i.e.
constructRankingFunction(Integer[], Map<Integer, RelationalConditional>, FolSignature) RelationalBruteForceCReasoner
Constructs a ranking function with the given kappa values [k1+,k1-,...,kn+,kn-], i.e.
consumeToken(Stack<Object>, int) ActionQueryParser
This method reads one token from the given reader and appropriately
constructs a propositional formula from the stream.
consumeToken(Stack<Object>, int) FolParser
This method reads one token from the given reader and appropriately
constructs a fol formula from the stream.
consumeToken(Stack<Object>, int) TPTPParser
This method reads one token from the given reader and appropriately
constructs a fol formula from the stream.
consumeToken(Stack<Object>, int) ModalParser
This method reads one token from the given reader and appropriately
constructs a modal formula from the stream.
consumeToken(Stack<Object>, int) PlParser
This method reads one token from the given reader and appropriately
constructs a propositional formula from the stream.
containedKeywords(String) CLawParser
Returns the set of forbidden keywords, that are contained in a string.
contains(Object) MultiAgentSystem
contains(Object) AbaExtension
contains(Object) LdoAssociativeFormula
contains(Object) Extension
contains(Argument) Attack
Return true if the given argument is in this attack relation.
contains(Object) DungTheory
contains(Object) ArgumentStructure
contains(Object) BeliefSet
contains(Object) InterpretationSet
contains(Object) SetSignature
contains(Object) DefaultGraph
contains(Object) Graph
Returns "true" when this graph contains the given
node or edge.
contains(Object) AssociativeFormulaSupport
contains(Object) AssociativeFOLFormula
contains(Object) AssociativePropositionalFormula
contains(Object) Extension
contains(Object) DLPHead
contains(Object) Interval
contains(Object) PreferenceOrder
checks whether this preference order contains a given pair
containsActionName(String) ActionSignature
Returns true iff the given actionName is contained in this action
signature.
containsActionName(FolActionName) ActionSignature
Returns true iff the given actionName is contained in this signature.
containsAll(Collection<?>) MultiAgentSystem
containsAll(Collection<?>) AbaExtension
containsAll(Collection<?>) LdoAssociativeFormula
containsAll(Collection<?>) Extension
containsAll(Collection<?>) DungTheory
containsAll(Collection<?>) ArgumentStructure
containsAll(Collection<?>) BeliefSet
containsAll(Collection<?>) InterpretationSet
containsAll(Collection<?>) SetSignature
containsAll(Collection<?>) AssociativeFormulaSupport
containsAll(Collection<?>) AssociativeFOLFormula
containsAll(Collection<?>) AssociativePropositionalFormula
containsAll(Collection<?>) Extension
containsAll(Collection<?>) DLPHead
containsAll(Collection<?>) Interval
containsAll(Collection<?>) PreferenceOrder
checks, whether all of the given elements are contained in the preference
order
containsAttack(Attack) DungTheory
Checks whether this theory contains the given attack.
containsConstant(String) FolSignature
containsFluentName(String) ActionSignature
Returns true iff the given fluentName is contained in this action
signature.
containsFluentName(FolFluentName) ActionSignature
Returns true iff the given fluentName is contained in this signature.
containsFunctionalTerms() LogicStructure
Checks whether this structure contains any functional terms.
containsFunctor(String) FolSignature
containsKey(Object) Labeling
containsKey(Object) NumericalArgumentRanking
containsKey(Object) StratifiedLabeling
containsKey(Argument) SocialMapping
Returns "true" iff the given argument has a value.
containsKey(Object) ProbabilityDistribution
containsKey(Object) FuzzyInterpretation
containsKey(Object) ReferenceWorld
containsKey(Object) RpclProbabilityDistribution
containsKey(Object) ProbabilityFunction
containsKey(Object) Functions
checks whether the key is present in the entry-set of the map
containsModalityOperator() ModalFormula
containsParameter(TrainingParameter) ParameterSet
Checks whether this set contains a parameter with the same
name as the given parameter.
containsPredicate(Predicate) ActionSignature
Returns true iff the given predicate is contained in this signature.
containsPredicate(String) FolSignature
containsQuantifier() DelpRule
containsQuantifier() QuantifiedFormula
Checks whether this formula contains any quantification.
containsQuantifier() QuantifiedFormulaSupport
containsQuantifier() AssociativeFOLFormula
containsQuantifier() Equivalence
containsQuantifier() ExistsQuantifiedFormula
containsQuantifier() FOLAtom
containsQuantifier() ForallQuantifiedFormula
containsQuantifier() Implication
containsQuantifier() Negation
containsQuantifier() SpecialFormula
containsQuantifier() ModalFormula
containsQuantifier() MlnFormula
containsQuantifier() RelationalConditional
containsQuantifier() DefaultRule
containsQuantifier() NLPNot
containsRelation(T, T) PreferenceOrder
checks whether this preference order contains a pair of given elements
containsSort(String) FolSignature
containsTermsOfType(Class<C>) ComplexLogicalFormulaAdapter
containsTermsOfType(Class<C>) LogicStructure
Checks if this logical structure contains at least one term of type C.
containsTermsOfType(Class<C>) RelationalFormula
containsTermsOfType(Class<C>) Sort
containsTermsOfType(Class<C>) TermAdapter
containsTriple(T, T, Relation) PreferenceOrder
containsValue(Object) Labeling
containsValue(Object) NumericalArgumentRanking
containsValue(Object) StratifiedLabeling
containsValue(Object) ProbabilityDistribution
containsValue(Object) FuzzyInterpretation
containsValue(Object) ReferenceWorld
containsValue(Object) RpclProbabilityDistribution
containsValue(Object) ProbabilityFunction
containsValue(Object) Functions
checks whether the value is present in the entry-set of the map
ContensionExample net.sf.tweety.logics.pl.examples
Example code illustrating the contension inconsistency measure.
ContensionExample() ContensionExample
ContensionInconsistencyMeasure net.sf.tweety.logics.pl.analysis
This class implements the contension inconsistency measure, cf.
ContensionInconsistencyMeasure() ContensionInconsistencyMeasure
ContensionInconsistencyMeasurementProcess net.sf.tweety.logics.pl.analysis
Implements an approximation algorithm for the Contension inconsistency measure on streams.
ContensionInconsistencyMeasurementProcess() ContensionInconsistencyMeasurementProcess
ContensionSampler net.sf.tweety.logics.pl.util
Generates random propositional belief base with a given
inconsistency measure (for the contension inconsistency measure)
and of a given size.
ContensionSampler(PropositionalSignature, int) ContensionSampler
Creates a new sample for the given signature
which generates propositional belief sets with the
given inconsistency value (wrt.
ContensionSampler(PropositionalSignature, int, int, int) ContensionSampler
Creates a new sample for the given signature
which generates propositional belief sets with the
given inconsistency value (wrt.
contol OpenOptRootFinder
contol OpenOptSolver
contract(Collection<T>, T) BaseContractionOperator
Contracts the given collection of formulas by the given formula.
contract(Collection<T>, Collection<T>) KernelContractionOperator
contract(Collection<T>, T) MultipleBaseContractionOperator
contract(Collection<T>, Collection<T>) MultipleBaseContractionOperator
Contracts the first collection of formulas by the second collection of formulas.
contraction LeviBaseRevisionOperator
The contraction operator of this Levi revision.
contraction LeviMultipleBaseRevisionOperator
The contraction operator of this Levi revision.
contradiction LogicalSymbols
CONTRADICTION() LogicalSymbols
Contradiction net.sf.tweety.logics.fol.syntax
A contradictory formula.
Contradiction() Contradiction
Creates a new contradiction.
Contradiction net.sf.tweety.logics.pl.syntax
A contradictory formula.
Contradiction() Contradiction
Creates a new contradiction.
ContradictionAsQueryTest() ModalReasonerTest
ContradictionTest() FolParserTest
ContradictionTest() PlParserTest
ConversionTools net.sf.tweety.commons.util
This class provides some utility methods for converting different
data types.
ConversionTools() ConversionTools
convertToCplexLpFormat() OptimizationProblem
Converts the this optimization problem into a string in the commonly
used CPLEX LP-format for mixed integer linear programming.
convertToDimacs(Collection<PropositionalFormula>, List<Proposition>) SatSolver
Converts the given set of formulas to their string representation in
Dimacs CNF.
convertToDimacs(Collection<PropositionalFormula>) SatSolver
Converts the given set of formulas to their string representation in
Dimacs CNF.
convertToLpFormat() OptimizationProblem
Converts the this optimization problem into a string in the commonly
used LP-format for mixed integer linear programming.
ConvexAggregatingMaxConsMeMachineShop net.sf.tweety.logics.pcl.analysis
This consistency restorer determines the new probabilities of conditionals
by computing the ME-distribution of each maximal consistent subset of the
knowledge base, then convex combining those yielding a distribution P,
and extracting the new probabilities from P.
ConvexAggregatingMaxConsMeMachineShop() ConvexAggregatingMaxConsMeMachineShop
ConvexAggregatingMeMachineShop net.sf.tweety.logics.pcl.analysis
This consistency restorer determines the new probabilities of conditionals
by computing the ME-distribution of each single conditional, then convex
combining those yielding a distribution P, and extracting the new probabilities
from P.
ConvexAggregatingMeMachineShop() ConvexAggregatingMeMachineShop
convexCombination(double, ProbabilityDistribution<T>) ProbabilityDistribution
Computes the convex combination of this P1 and the
given probability distribution P2 with parameter d, i.e.
convexCombination(double[], ProbabilityDistribution<S>[]) ProbabilityDistribution
Computes the convex combination of the
given probability distributions P1,...,PN with parameters factors, i.e.
convexCombination(double, RpclProbabilityDistribution<T>) RpclProbabilityDistribution
Computes the convex combination of this P1 and the
given probability distribution P2 with parameter d, i.e.
convexCombination(double, ProbabilityFunction<T>) ProbabilityFunction
Computes the convex combination of this P1 and the
given probability distribution P2 with parameter d, i.e.
convexCombination(double[], ProbabilityFunction<S>[]) ProbabilityFunction
Computes the convex combination of the
given probability distributions P1,...,PN with parameters factors, i.e.
copyArgumentTypes() TypedStructureAdapter
copyHelper(Collection<T>) AssociativeFormulaSupport
This method generates a deep copy of the given collection of RelationalFormula
CorsResponseFilter net.sf.tweety.web
For enabling cross-origin resource sharing
CorsResponseFilter() CorsResponseFilter
counter DeductiveArgumentNode
A global counter for IDs.
counterarguments() TestQueries
countering() TestArguments
CountingUtilityFunction net.sf.tweety.agents.dialogues.structured
This class represents a counting utility function, i.e.
CountingUtilityFunction(Collection<? extends Proposition>) CountingUtilityFunction
Creates a new counting utility function for the given focal set.
CPAR_CLOSE ASPParserConstants
RegularExpression Id.
CPAR_OPEN ASPParserConstants
RegularExpression Id.
CParser net.sf.tweety.action.description.parser
This class implements a parser for an Action Description in C.
CParser() CParser
CReasoner net.sf.tweety.logics.cl.reasoner
This class models a c-reasoner for conditional logic.
CReasoner() CReasoner
CReasonerExample net.sf.tweety.logics.cl.examples
CReasonerExample() CReasonerExample
create(String) ComparisonCriterion.Factory
createBatchFile(List<String>) TestDeLP
createBeliefbaseControl() RevisionCompareView
Helper method: Creates the belief base control panel, there one can change the ordering
of the belief bases for the revision and add or remove belief bases.
createCompareView() RevisionCompareView
Helper method: Creates the controls to show the comparison between the two selected revision methods
it is located at the center of this view.
createConstant(String, DefeasibleLogicProgram, FolSignature) DelpParser
createConstraintMatrix(PclBeliefSet, Set<PossibleWorld>) OjAlgoPclUtils
Create constraint matrix for a set of PCL conditionals over a set of possible worlds.
createEmptyFormula() LdoConjunction
createEmptyFormula() LdoDisjunction
createEmptyFormula() AssociativeFormulaSupport.AssociativeSupportBridge
createEmptyFormula() Conjunction
createEmptyFormula() Disjunction
createEmptyFormula() Conjunction
createEmptyFormula() Disjunction
createEmptyFormula() DLPHead
createEmptySignature() LdoAssociativeFormula
createEmptySignature() AssociativeFormulaSupport.AssociativeSupportBridge
createEmptySignature() AssociativeFOLFormula
createEmptySignature() AssociativePropositionalFormula
createEmptySignature() DLPHead
createInstance(Class<T>) Translator
createTestSet(RdlParser, String...) RdlExample
createTmpDimacsFile(Collection<PropositionalFormula>, List<Proposition>) SatSolver
Creates a temporary file in Dimacs format with the given proposition2variable mapping.
createTmpDimacsFile(Collection<PropositionalFormula>) SatSolver
Creates a temporary file in Dimacs format and also returns a mapping between formulas and clauses.
createTranslateMap() AspFolTranslator
createTranslateMap() AspNlpTranslator
createTranslateMap() ClNLPTranslator
createTranslateMap() FOLPropTranslator
createTranslateMap() Translator
createUpperBar() RevisionCompareView
Helper method: Creates the control bar at the top of this view which allows the
user to change the revision operators used for comparison.
createVariables(int) OjAlgoPclUtils
Create (non-negative) variables for the probabilities of possible worlds.
createWithNullArg() TestDTree
createWithNullConclusion1() TestArguments
createWithNullConclusion2() TestArguments
creation() TestDTree
creation() TestNicePossibleWorld
creationFailure() TestNicePossibleWorld
CredibilityCategorizer net.sf.tweety.beliefdynamics.mas
This class implements a credibility-based categorizer that works like
the classical categorizer but dismisses arguments where
the least credible agent which uttered a formula in that argument
is not as least as credible as the least credible agent which uttered
a formula of the parent argument.
CredibilityCategorizer(Collection<InformationObject<PropositionalFormula>>, Order<Agent>) CredibilityCategorizer
Creates a new credibility categorizer that is guided by the giving information which
agents uttered the formulas and the credibility order.
CredibilityComparer(Collection<InformationObject<PropositionalFormula>>, Order<Agent>) CrMasSimpleRevisionOperator.CredibilityComparer
credibilityOrder CrMasBeliefSet
The subjective credibility order of the agent who owns this belief set.
CredibilityRevision T extends Formula > - Class in net.sf.tweety.beliefdynamics
Abstract base class for a revision process on belief bases of type TBeliefBase, it
provides a method to revise one belief base with another and a method
to revise a ordered list of belief bases.
CredibilityRevision() CredibilityRevision
CredibilityRevision net.sf.tweety.lp.asp.beliefdynamics.revision
Implements the credibility revision approach for ASP described in
Kruempelmann et al.
CredibilityRevision() CredibilityRevision
Default Ctor: Do not forget to set the solver
CredibilityRevision(Solver) CredibilityRevision
Ctor: setting the solver at construction time
CredibilityRevision(Solver, int) CredibilityRevision
CredibilityRevision.AnswersetProcessing net.sf.tweety.lp.asp.beliefdynamics.revision
interface defines a method to process the extended answer sets of the
credibility revision to generate the new ELP.
CredibilityRevision.DefaultBehavior net.sf.tweety.lp.asp.beliefdynamics.revision
This class implements a default behavior for the processing of the answer sets
of the credibility logic programs.
CredibilityRevisionIterative T extends Formula > - Class in net.sf.tweety.beliefdynamics
Implements the list based method of the Revision interface by iterative calling
the revision method which revise two belief bases.
CredibilityRevisionIterative() CredibilityRevisionIterative
CredibilityRevisionNonIterative T extends Formula > - Class in net.sf.tweety.beliefdynamics
Implements the revision method with two belief bases by delegating the processing
to the revision method bases on an ordered list of belief bases.
CredibilityRevisionNonIterative() CredibilityRevisionNonIterative
CredibilityTest net.sf.tweety.lp.asp.beliefdynamics.revision
Tests the revision method described in Kruempelmann et al.
CredibilityTest() CredibilityTest
credOrder AbstractCredibilityComparer
The credibility order used to guide the comparison.
CREDULOUS_INFERENCE Semantics
inference types to be used wtih different semantics
criteria CustomStringListCommandParameter
the (regular expression) validation criteria a given input string needs to fulfill
e.g.:
"(/?([a-zA-Z0-9])(/[a-zA-Z0-9_\\-\\.])*(.[a-z]+))"
criterion DefeasibleLogicProgram.DelpOptions
CriterionOptionHandler net.sf.tweety.arg.delp.semantics
CriterionOptionHandler(CmdLineParser, OptionDef, Setter<? super ComparisonCriterion>) CriterionOptionHandler
CrMasArgumentativeRevisionOperator net.sf.tweety.beliefdynamics.operators
This class is an exemplary instantiation of a revision operator based on deductive argumentation and credibilities where
several parameters have been fixed:
- the inner revision is a Levi revision which bases on the random kernel contraction
- the transformation function is credulous
- the accumulator used for deductive argumentation is the simple accumulator
- the categorizer used for deductive argumentation is the credibility categorizer
CrMasArgumentativeRevisionOperator() CrMasArgumentativeRevisionOperator
CrMasBeliefSet T extends Formula > - Class in net.sf.tweety.beliefdynamics.mas
This class represents belief sets for credibility-based agents multi-agent systems.
CrMasBeliefSet(Order<Agent>) CrMasBeliefSet
Creates a new belief set with the given credibility order.
CrMasExample net.sf.tweety.beliefdynamics.examples
Example code on using belief operators in multi-agent settings.
CrMasExample() CrMasExample
CrMasRevisionWrapper T extends Formula > - Class in net.sf.tweety.beliefdynamics.mas
This class is a wrapper for a revision for formulas of type T that is
used to revise information objects.
CrMasRevisionWrapper(MultipleBaseRevisionOperator<T>) CrMasRevisionWrapper
Creates a new revision with the given wrapped revision.
CrMasSimpleRevisionOperator net.sf.tweety.beliefdynamics.operators
This revision operator accepts only those pieces of information for revision where the credibility
of the source is at least as high as the credibility of the agent which proves the complement.
CrMasSimpleRevisionOperator() CrMasSimpleRevisionOperator
CrMasSimpleRevisionOperator.CredibilityComparer net.sf.tweety.beliefdynamics.operators
Private extension of credibility comparer
crossover(Map<FloatVariable, Term>, Map<FloatVariable, Term>) SimpleGeneticOptimizationSolver
Makes a crossover of the two individuals
CrossValidator S extends Observation ,T extends Category > - Class in net.sf.tweety.machinelearning
Performs cross-validation in a classifier, i.e.
CrossValidator(int) CrossValidator
Creates a new cross-validator with the given number of partitions.
CspInconsistencyMeasure S extends Formula > - Class in net.sf.tweety.logics.commons.analysis
This class implements the inconsistency measure I_CSP from
[Said Jabbour, Yue Ma, Badran Raddaoui, Lakhdar Sais, Yakoub Salhi.
CspInconsistencyMeasure(SimpleFunction<Double, Double>, MusEnumerator<S>, Solver) CspInconsistencyMeasure
Creates a new measure that uses the given measure function, MUS enumerator, and
Integer programming solver
CspInconsistencyMeasure(MusEnumerator<S>, Solver) CspInconsistencyMeasure
Creates a new measure that uses the given MUS enumerator and
Integer programming solver.
CspInconsistencyMeasureTest net.sf.tweety.logics.pl.test
CspInconsistencyMeasureTest() CspInconsistencyMeasureTest
csvDisplay() SimulationResult
Returns a CSV representation of the result.
CTransitionSystemCalculator net.sf.tweety.action.description.reasoner
This class calculates the transition system as it is described by an action
description in the action language C using extended logic programming with an
approach from: Representing Transition Systems by Logic Programs.
CTransitionSystemCalculator(AspInterface) CTransitionSystemCalculator
Creates a new transition system calculator with the given interface to an
answer set solver.
CulpabilityMeasure S extends Formula ,T extends BeliefSet <S >> - Interface in net.sf.tweety.logics.commons.analysis
Classes implementing this interface represent culpability measures, i.e.
culpabilityMeasure(T, S) CulpabilityMeasure
Returns the degree of responsibility of the given formula to cause
inconsistency in the given belief set (NOTE: the formula should be
in the given belief set).
culpabilityMeasure(T, S) ShapleyCulpabilityMeasure
culpabilityMeasure BalancedMachineShop
The culpability measure used by this machine shop.
culpabilityMeasure(PclBeliefSet, ProbabilisticConditional) MeanDistanceCulpabilityMeasure
culpabilityMeasure PclBeliefSetQuadraticErrorMinimizationMachineShop
The culpability measure this machine shop bases on.
culpabilityMeasure(PclBeliefSet, ProbabilisticConditional) SignedCulpabilityMeasure
culpabilityMeasure SmoothedPenalizingCreepingMachineShop
The culpability measure used by this machine shop.
culpVector PenalizingCreepingMachineShop
The culpability vector.
cumulativeTime EvaluationInconsistencyListener
Sum of all steps.
curChar DelpParserTokenManager
curChar RpclCondensedProbabilityDistributionParserTokenManager
curChar RpclProbabilityDistributionParserTokenManager
curChar ASPParserTokenManager
curChar POParserTokenManager
curChar UPParserTokenManager
curLexState DelpParserTokenManager
curLexState RpclCondensedProbabilityDistributionParserTokenManager
curLexState RpclProbabilityDistributionParserTokenManager
curLexState ASPParserTokenManager
curLexState POParserTokenManager
curLexState UPParserTokenManager
currendIdx RoundRobinProtocol
The index of the agent who may perform the next action.
currentItem DefaultSubsetIterator
The number of the current item as a bit set.
currentLength EnumeratingIterator
The current length
currentSize EnumeratingDungTheoryGenerator
The size of the currently generated theories.
currentSize IncreasingSubsetIterator
The current size of the subsets generated.
currentTheories IsoSafeEnumeratingDungTheoryGenerator
The set of all Dung theories with cntArguments arguments and cntAttacks attacks.
currentToken ParseException
This is the last token that has been consumed successfully.
currentToken ParseException
This is the last token that has been consumed successfully.
currentToken ParseException
This is the last token that has been consumed successfully.
currentToken ParseException
This is the last token that has been consumed successfully.
currentToken ParseException
This is the last token that has been consumed successfully.
currentValue ContensionInconsistencyMeasurementProcess
Current inconsistency value.
currentValue HsInconsistencyMeasurementProcess
Current inconsistency value.
CustomStringListCommandParameter net.sf.tweety.plugin.parameter
This class extends the string list command parameter with functionality
to define valid strings with regular expressions.
CustomStringListCommandParameter(String, String) CustomStringListCommandParameter
constructor for the custom string list parameter with id and description
CustomStringListCommandParameter(String, String, String) CustomStringListCommandParameter
constructor for the custom string list parameter with id, description and criteria
CygwinShell net.sf.tweety.commons.util
Cygwin shell.
CygwinShell(String) CygwinShell