A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
All Classes All Packages
All Classes All Packages
All Classes All Packages
C
- C_PARAMETER - Static variable in class net.sf.tweety.machinelearning.svm.MultiClassRbfTrainer
-
The c parameter for learning
- CacheMap<K,V> - Class in net.sf.tweety.arg.adf.util
-
Uses the provided function to compute absent values on access, theses values are memorized for future access to avoid further computations.
- CacheMap(Function<K, V>) - Constructor for class net.sf.tweety.arg.adf.util.CacheMap
-
Creates an empty cache
- CActionDescription - Class in 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() - Constructor for class net.sf.tweety.action.description.syntax.CActionDescription
-
Creates a new empty action description.
- CActionDescription(Collection<? extends CausalLaw>) - Constructor for class net.sf.tweety.action.description.syntax.CActionDescription
-
Creates a new belief set with the given collection of formulae.
- CActionDescriptionConsistencyTester - Class in 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(ASPSolver) - Constructor for class net.sf.tweety.action.description.analysis.CActionDescriptionConsistencyTester
-
Creates a new consistency tester which will use the given answer set solver.
- CadetSolver - Class in net.sf.tweety.logics.qbf.reasoner
-
A wrapper for the Cadet (https://markusrabe.github.io/cadet/) solver.
- CadetSolver(String) - Constructor for class net.sf.tweety.logics.qbf.reasoner.CadetSolver
-
Constructs a new instance pointing to a specific CadetSolver
- CadetSolver(String, Shell) - Constructor for class net.sf.tweety.logics.qbf.reasoner.CadetSolver
-
Constructs a new instance pointing to a specific CadetSolver.
- calculateResultingAnswersets() - Method in class net.sf.tweety.lp.asp.beliefdynamics.gui.SimpleRevisionCompareModel
- calculateStates(CActionDescription, ActionSignature) - Method in class net.sf.tweety.action.description.reasoner.CTransitionSystemCalculator
-
calculates the set of all states of the transition system described by an action description.
- calculateTransitionSystem(CActionDescription, ActionSignature) - Method in class net.sf.tweety.action.description.reasoner.CTransitionSystemCalculator
-
Calculates a transition system as described by the given action description using all symbols in the given action signature.
- Cancel - net.sf.tweety.logics.bpm.syntax.EventType
- CandidateGenerator - Interface in net.sf.tweety.arg.adf.reasoner.sat.generator
- cannotRead() - Method in class net.sf.tweety.arg.delp.TestDeLP
- CanonicalIterator - Class in net.sf.tweety.logics.pl.util
-
Provides an iterator on all syntactically equivalent knowledge bases.
- CanonicalIterator() - Constructor for class net.sf.tweety.logics.pl.util.CanonicalIterator
-
Default constructor.
- CanonicalIterator(Integer) - Constructor for class net.sf.tweety.logics.pl.util.CanonicalIterator
-
Creates a new enumerator that enumerates knowledge bases starting from the given index
- CanonicalIterator(Integer, Integer) - Constructor for class net.sf.tweety.logics.pl.util.CanonicalIterator
-
Creates a new enumerator that enumerates knowledge bases starting from the given start index up to the given end index (including)
- CanonicalIterator(Long) - Constructor for class net.sf.tweety.logics.pl.util.CanonicalIterator
-
Creates a new enumerator that enumerates knowledge bases starting from the given index
- CanonicalIterator(Long, Long) - Constructor for class net.sf.tweety.logics.pl.util.CanonicalIterator
-
Creates a new enumerator that enumerates knowledge bases starting from the given start index up to the given end index (including)
- CanonicalIterator(BigInteger) - Constructor for class net.sf.tweety.logics.pl.util.CanonicalIterator
-
Creates a new enumerator that enumerates knowledge bases starting from the given index
- CanonicalIterator(BigInteger, BigInteger) - Constructor for class net.sf.tweety.logics.pl.util.CanonicalIterator
-
Creates a new enumerator that enumerates knowledge bases starting from the given start index up to the given end index (including)
- CanonicalUndercut - Class in 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).
- capabilities() - Method in class net.sf.tweety.logics.fol.plugin.FirstOrderLogicPlugin
- capabilities() - Method in class net.sf.tweety.logics.pl.plugin.PlPlugin
- capabilities() - Method in class net.sf.tweety.logics.rpcl.plugin.RPCLPlugin
- capabilities() - Method in class net.sf.tweety.preferences.plugin.PreferencesPlugin
- CaqeSolver - Class in net.sf.tweety.logics.qbf.reasoner
-
A wrapper for the Caqe (https://www.react.uni-saarland.de/tools/caqe/ solver.
- CaqeSolver(String) - Constructor for class net.sf.tweety.logics.qbf.reasoner.CaqeSolver
-
Constructs a new instance pointing to a specific CaqeSolver
- CaqeSolver(String, Shell) - Constructor for class net.sf.tweety.logics.qbf.reasoner.CaqeSolver
-
Constructs a new instance pointing to a specific CaqeSolver.
- CARDINALITYPRECEDENCE - Static variable in class net.sf.tweety.arg.rankings.postulates.RankingPostulate
-
The CARDINALITYPRECEDENCE postulate
- categorize(ArgumentTree) - Method in interface net.sf.tweety.arg.deductive.categorizer.Categorizer
-
This method categorizes the given argument tree.
- categorize(ArgumentTree) - Method in class net.sf.tweety.arg.deductive.categorizer.ClassicalCategorizer
- categorize(ArgumentTree) - Method in class net.sf.tweety.arg.deductive.categorizer.HCategorizer
- categorize(ArgumentTree) - Method in class net.sf.tweety.beliefdynamics.mas.CredibilityCategorizer
- Categorizer - Interface in net.sf.tweety.arg.deductive.categorizer
-
Classes implementing this interface represent categorizer in the sense of Definition 8.10 in
Philippe Besnard and Anthony Hunter. - CategorizerExample() - Static method in class net.sf.tweety.arg.rankings.examples.RaPostulateExample
- CategorizerRankingReasoner - Class in net.sf.tweety.arg.rankings.reasoner
-
This class implements the "h-categorizer" argument ranking approach that was originally proposed by [Besnard, Hunter.
- CategorizerRankingReasoner() - Constructor for class net.sf.tweety.arg.rankings.reasoner.CategorizerRankingReasoner
-
Create a new CountingRankingReasoner with default parameters.
- CategorizerRankingReasoner(double) - Constructor for class net.sf.tweety.arg.rankings.reasoner.CategorizerRankingReasoner
-
Create a new CategorizerRankingReasoner with the given parameters.
- Category - Interface in net.sf.tweety.machinelearning
-
A category within the space of observations.
- CausalLaw - Interface in net.sf.tweety.action.description.syntax
-
A basic interface representing a causal law.
- CautiousArgumentationAgent - Class in net.sf.tweety.agents.dialogues.structured
-
This class models a cautious argumentation agent, i.e.
- CautiousArgumentationAgent(StructuredArgumentationFramework, UtilityFunction, boolean, Proposition) - Constructor for class net.sf.tweety.agents.dialogues.structured.CautiousArgumentationAgent
-
Creates a new agent with the given (local) view and utility function.
- CautiousArgumentationAgent(StructuredArgumentationFramework, UtilityFunction, Proposition) - Constructor for class net.sf.tweety.agents.dialogues.structured.CautiousArgumentationAgent
-
Creates a new (non-single-step) agent with the given (local) view and utility function.
- CC - net.sf.tweety.logics.pl.analysis.InconsistencyMeasureFactory.Measure
- 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) - Constructor for class net.sf.tweety.logics.commons.analysis.CcInconsistencyMeasure
-
Creates a new measure that uses the given MUS enumerator and Integer programming solver
- CF - net.sf.tweety.arg.dung.semantics.OrderingSemantics
- CF - net.sf.tweety.arg.dung.semantics.Semantics
- CF2 - net.sf.tweety.arg.dung.semantics.Semantics
- CF2_SEMANTICS - Static variable in enum net.sf.tweety.arg.dung.semantics.Semantics
- CF2Example - Class in net.sf.tweety.arg.dung.examples
-
Example code for CF2 semantics
- CF2Example() - Constructor for class net.sf.tweety.arg.dung.examples.CF2Example
- CG_MINUS - net.sf.tweety.logics.cl.semantics.ConditionalStructure.Generator
-
The possible world falsifies the conditional
- CG_ONE - net.sf.tweety.logics.cl.semantics.ConditionalStructure.Generator
-
The possible world neither verifies nor falsifies the conditional because the premise is false
- CG_PLUS - net.sf.tweety.logics.cl.semantics.ConditionalStructure.Generator
-
The possible world verifies the conditional
- change(ProbabilisticExtension, DungTheory) - Method in class net.sf.tweety.arg.prob.dynamics.AbstractPAChangeOperator
- change(ProbabilisticExtension, DungTheory) - Method in interface net.sf.tweety.arg.prob.dynamics.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) - Method in class net.sf.tweety.arg.prob.dynamics.AbstractPAChangeOperator
- change(PartialProbabilityAssignment, DungTheory) - Method in interface net.sf.tweety.arg.prob.dynamics.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(PartialProbabilityAssignment, DungTheory) - Method in class net.sf.tweety.arg.prob.dynamics.PARevisionOperator
- change(PartialProbabilityAssignment, DungTheory) - Method in class net.sf.tweety.arg.prob.dynamics.PAUpdateOperator
- ChangeOperator - Interface in net.sf.tweety.arg.prob.dynamics
-
This interface provides common methods for change operators for probabilistic argumentation.
- changeOrder() - Method in class net.sf.tweety.preferences.io.POChanger
- check1Norm() - Method in class net.sf.tweety.logics.pcl.test.MinimalViolationInconsistencyMeasureLPSolveTest
- checkMaxNorm() - Method in class net.sf.tweety.logics.pcl.test.MinimalViolationInconsistencyMeasureLPSolveTest
- checkValid() - Method in class net.sf.tweety.arg.lp.syntax.Argument
-
An argument may only contain nonempty ground rules (i.e.
- children(Argument) - Method in interface net.sf.tweety.arg.adf.syntax.adf.AbstractDialecticalFramework
- children(Argument) - Method in class net.sf.tweety.arg.adf.syntax.adf.ExtendedAbstractDialecticalFramework
- children(Argument) - Method in class net.sf.tweety.arg.adf.syntax.adf.GraphAbstractDialecticalFramework
- childrenAccept(ASPCore2ParserVisitor, Object) - Method in class net.sf.tweety.lp.asp.parser.SimpleNode
- Choice() - Method in class net.sf.tweety.lp.asp.parser.ASPCore2Parser
- ChoiceElement() - Method in class net.sf.tweety.lp.asp.parser.ASPCore2Parser
- ChoiceElements() - Method in class net.sf.tweety.lp.asp.parser.ASPCore2Parser
- chooseANeighbor(Map<Variable, Term>, int, int, double) - Method in class net.sf.tweety.math.opt.solver.SimulatedAnnealingOnConstrProb
- chooseANeighbor(Map<Variable, Term>, int, int, double) - Method in class net.sf.tweety.math.opt.solver.TabuSearchOnConstrProb
- CLASSICAL_NEGATION() - Static method in class net.sf.tweety.logics.commons.LogicalSymbols
- ClassicalCategorizer - Class in 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.
The method "categorize" returns "1" if the root node is undefeated and "0" if it is defeated. - ClassicalCategorizer() - Constructor for class net.sf.tweety.arg.deductive.categorizer.ClassicalCategorizer
- ClassicalFormula - Interface in net.sf.tweety.logics.commons.syntax.interfaces
-
This interface models a classical formula, i.e.
- ClassicalLiteral() - Method in class net.sf.tweety.lp.asp.parser.ASPCore2Parser
- 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() - Constructor for class net.sf.tweety.machinelearning.ClassificationTester
- Classifier - Interface in net.sf.tweety.machinelearning
-
A classifier classifies observations into categories.
- classify(Observation) - Method in interface net.sf.tweety.machinelearning.Classifier
-
Classifies the given observation.
- classify(Observation) - Method in class net.sf.tweety.machinelearning.svm.SupportVectorMachine
- ClauseSplittingProcessor - Class in net.sf.tweety.arg.adf.transform.processor
- ClauseSplittingProcessor(int) - Constructor for class net.sf.tweety.arg.adf.transform.processor.ClauseSplittingProcessor
- CLaw - Class in net.sf.tweety.action.description.syntax
-
The action description language C consists of two distinct expressions: static laws and dynamic laws.
- CLaw() - Constructor for class net.sf.tweety.action.description.syntax.CLaw
-
Creates an empty causal law.
- CLaw(FolFormula) - Constructor for class net.sf.tweety.action.description.syntax.CLaw
-
Creates a causal law of the form caused headFormula if True
- CLaw(FolFormula, Set<GroundingRequirement>) - Constructor for class net.sf.tweety.action.description.syntax.CLaw
-
Creates a causal law of the form caused headFormula if True requires requirements
- CLaw(FolFormula, FolFormula) - Constructor for class net.sf.tweety.action.description.syntax.CLaw
-
Creates a causal law of the form caused headFormula if ifFormula
- CLaw(FolFormula, FolFormula, Set<GroundingRequirement>) - Constructor for class net.sf.tweety.action.description.syntax.CLaw
-
Creates a causal law of the form caused headFormula if ifFormula requires requirements
- CLawParser - Class in net.sf.tweety.action.description.parser
-
This class implements a parser for causal laws in C.
- CLawParser(ActionSignature) - Constructor for class net.sf.tweety.action.description.parser.CLawParser
-
This parser needs a valid action signature to parse causal laws.
- ClBeliefSet - Class in net.sf.tweety.logics.cl.syntax
-
This class models a belief set on conditional logic, i.e.
- ClBeliefSet() - Constructor for class net.sf.tweety.logics.cl.syntax.ClBeliefSet
-
Creates a new (empty) conditional belief set.
- ClBeliefSet(Collection<? extends Conditional>) - Constructor for class net.sf.tweety.logics.cl.syntax.ClBeliefSet
-
Creates a new conditional belief set with the given collection of conditionals.
- clear() - Method in class net.sf.tweety.agents.MultiAgentSystem
- clear() - Method in class net.sf.tweety.arg.aba.semantics.AbaExtension
- clear() - Method in class net.sf.tweety.arg.adf.util.AbstractUnmodifiableSet
- clear() - Method in class net.sf.tweety.arg.adf.util.CacheMap
- clear() - Method in class net.sf.tweety.arg.adf.util.LazyMap
- clear() - Method in class net.sf.tweety.arg.bipolar.syntax.ArgumentSet
- clear() - Method in class net.sf.tweety.arg.dung.ldo.syntax.LdoAssociativeFormula
- clear() - Method in class net.sf.tweety.arg.dung.semantics.Extension
- clear() - Method in class net.sf.tweety.arg.dung.semantics.Labeling
- clear() - Method in class net.sf.tweety.arg.dung.semantics.StratifiedLabeling
- clear() - Method in class net.sf.tweety.arg.rankings.semantics.NumericalArgumentRanking
- clear() - Method in class net.sf.tweety.arg.saf.syntax.ArgumentStructure
- clear() - Method in class net.sf.tweety.commons.BeliefSet
- clear() - Method in class net.sf.tweety.commons.DualSetSignature
- clear() - Method in class net.sf.tweety.commons.InterpretationSet
- clear() - Method in class net.sf.tweety.commons.QuadrupleSetSignature
- clear() - Method in interface net.sf.tweety.commons.Signature
-
Removes all elements of this signature.
- clear() - Method in class net.sf.tweety.commons.SingleSetSignature
- clear() - Method in class net.sf.tweety.commons.TripleSetSignature
- clear() - Method in class net.sf.tweety.logics.bpm.syntax.BpmnSignature
- clear() - Method in class net.sf.tweety.logics.cl.semantics.ConditionalStructure
-
Clears the ConditionalStructure, after calling this method the Structure is empty.
- clear() - Method in class net.sf.tweety.logics.commons.syntax.AssociativeFormulaSupport
- clear() - Method in class net.sf.tweety.logics.dl.syntax.AssociativeDlFormula
- clear() - Method in class net.sf.tweety.logics.fol.syntax.AssociativeFolFormula
- clear() - Method in class net.sf.tweety.logics.pcl.semantics.ProbabilityDistribution
- clear() - Method in class net.sf.tweety.logics.pl.semantics.FuzzyInterpretation
- clear() - Method in class net.sf.tweety.logics.pl.syntax.AssociativePlFormula
- clear() - Method in class net.sf.tweety.logics.rdl.semantics.Extension
- clear() - Method in class net.sf.tweety.logics.rpcl.semantics.ReferenceWorld
- clear() - Method in class net.sf.tweety.logics.rpcl.semantics.RpclProbabilityDistribution
- clear() - Method in class net.sf.tweety.lp.asp.syntax.ASPHead
- clear() - Method in class net.sf.tweety.math.Interval
- clear() - Method in class net.sf.tweety.math.probability.ProbabilityFunction
- clear() - Method in class net.sf.tweety.preferences.PreferenceOrder
-
clears the current preference order element set
- clear(int) - Method in class net.sf.tweety.arg.adf.util.ThreeValuedBitSet
-
Sets the value at position to undecided resp.
- clearNodeScope(Node) - Method in class net.sf.tweety.lp.asp.parser.JJTASPCore2ParserState
- CliMain - Class in net.sf.tweety.cli.plugins
-
skeleton of the new main method of this CLI using plugins.
- CliMain() - Constructor for class net.sf.tweety.cli.plugins.CliMain
- CLINGO_SHOW - Static variable in interface net.sf.tweety.lp.asp.parser.ASPCore2ParserConstants
-
RegularExpression Id.
- ClingoMetaStatement() - Method in class net.sf.tweety.lp.asp.parser.ASPCore2Parser
- ClingoSolver - Class in 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.
- ClingoSolver(String) - Constructor for class net.sf.tweety.lp.asp.reasoner.ClingoSolver
-
Constructs a new instance pointing to specific a Clingo solver.
- ClingoSolver(String, Shell) - Constructor for class net.sf.tweety.lp.asp.reasoner.ClingoSolver
-
Constructs a new instance pointing to a specific Clingo solver.
- ClingoTest - Class in net.sf.tweety.lp.asp.analysis
-
Test class for Clingo.
- ClingoTest() - Constructor for class net.sf.tweety.lp.asp.analysis.ClingoTest
- ClingoTest() - Method in class net.sf.tweety.lp.asp.parser.ASPCore2ParserTest
- ClingoWriter - Class in net.sf.tweety.lp.asp.writer
-
Prints ASP programs and single rules to the Clingo input format (https://potassco.org/clingo/).
- ClingoWriter() - Constructor for class net.sf.tweety.lp.asp.writer.ClingoWriter
- ClingoWriter(Writer) - Constructor for class net.sf.tweety.lp.asp.writer.ClingoWriter
-
Create a new ClingoWriter with the given writer.
- ClingoWriter(Writer, boolean) - Constructor for class net.sf.tweety.lp.asp.writer.ClingoWriter
- ClNLPTranslator - Class in net.sf.tweety.logics.translators.clnlp
-
Translates between propositional Conditionals and NLP.
- ClNLPTranslator() - Constructor for class net.sf.tweety.logics.translators.clnlp.ClNLPTranslator
- clone() - Method in class net.sf.tweety.agents.dialogues.oppmodels.BeliefState
- clone() - Method in class net.sf.tweety.agents.dialogues.oppmodels.T1BeliefState
- clone() - Method in class net.sf.tweety.agents.dialogues.oppmodels.T2BeliefState
- clone() - Method in class net.sf.tweety.agents.dialogues.oppmodels.T3BeliefState
- clone() - Method in class net.sf.tweety.arg.aba.syntax.AbaElement
- clone() - Method in class net.sf.tweety.arg.aba.syntax.Assumption
- clone() - Method in class net.sf.tweety.arg.aba.syntax.InferenceRule
- clone() - Method in class net.sf.tweety.arg.aba.syntax.Negation
- clone() - Method in class net.sf.tweety.arg.adf.syntax.adf.AbstractDialecticalFramework.Signature
- clone() - Method in class net.sf.tweety.arg.aspic.syntax.DefeasibleInferenceRule
- clone() - Method in class net.sf.tweety.arg.aspic.syntax.InferenceRule
- clone() - Method in class net.sf.tweety.arg.aspic.syntax.StrictInferenceRule
- clone() - Method in class net.sf.tweety.arg.delp.syntax.DefeasibleRule
- clone() - Method in class net.sf.tweety.arg.delp.syntax.DelpFact
- clone() - Method in class net.sf.tweety.arg.delp.syntax.StrictRule
- clone() - Method in class net.sf.tweety.arg.dung.ldo.syntax.AbstractGraphLdoModality
- clone() - Method in class net.sf.tweety.arg.dung.ldo.syntax.AbstractLdoModality
- clone() - Method in class net.sf.tweety.arg.dung.ldo.syntax.LdoArgument
- clone() - Method in class net.sf.tweety.arg.dung.ldo.syntax.LdoBoxModality
- clone() - Method in class net.sf.tweety.arg.dung.ldo.syntax.LdoConjunction
- clone() - Method in class net.sf.tweety.arg.dung.ldo.syntax.LdoDiamondModality
- clone() - Method in class net.sf.tweety.arg.dung.ldo.syntax.LdoDisjunction
- clone() - Method in class net.sf.tweety.arg.dung.ldo.syntax.LdoFormula
- clone() - Method in class net.sf.tweety.arg.dung.ldo.syntax.LdoGraphBoxModality
- clone() - Method in class net.sf.tweety.arg.dung.ldo.syntax.LdoGraphDiamondModality
- clone() - Method in class net.sf.tweety.arg.dung.ldo.syntax.LdoNegation
- clone() - Method in class net.sf.tweety.arg.dung.ldo.syntax.LdoRelation
- clone() - Method in class net.sf.tweety.arg.dung.syntax.DungSignature
- clone() - Method in class net.sf.tweety.commons.DualSetSignature
- clone() - Method in class net.sf.tweety.commons.QuadrupleSetSignature
- clone() - Method in interface net.sf.tweety.commons.Signature
- clone() - Method in class net.sf.tweety.commons.SingleSetSignature
- clone() - Method in class net.sf.tweety.commons.TripleSetSignature
- clone() - Method in class net.sf.tweety.logics.bpm.syntax.BpmnSignature
- clone() - Method in class net.sf.tweety.logics.cl.syntax.ClBeliefSet
- clone() - Method in class net.sf.tweety.logics.cl.syntax.Conditional
- clone() - Method in class net.sf.tweety.logics.commons.syntax.AssociativeFormulaSupport
- clone() - Method in class net.sf.tweety.logics.commons.syntax.ComplexLogicalFormulaAdapter
- clone() - Method in class net.sf.tweety.logics.commons.syntax.Constant
- clone() - Method in class net.sf.tweety.logics.commons.syntax.FunctionalTerm
- clone() - Method in class net.sf.tweety.logics.commons.syntax.Functor
- clone() - Method in interface net.sf.tweety.logics.commons.syntax.interfaces.ComplexLogicalFormula
- clone() - Method in interface net.sf.tweety.logics.commons.syntax.interfaces.SimpleLogicalFormula
-
Creates a deep copy of this formula
- clone() - Method in interface net.sf.tweety.logics.commons.syntax.interfaces.Term
-
Creates a deep copy of the term
- clone() - Method in interface net.sf.tweety.logics.commons.syntax.interfaces.TypedStructure
-
Creates a deep copy of this object
- clone() - Method in class net.sf.tweety.logics.commons.syntax.NumberTerm
- clone() - Method in class net.sf.tweety.logics.commons.syntax.Predicate
- clone() - Method in class net.sf.tweety.logics.commons.syntax.RelationalFormula
- clone() - Method in class net.sf.tweety.logics.commons.syntax.Sort
- clone() - Method in class net.sf.tweety.logics.commons.syntax.TermAdapter
- clone() - Method in class net.sf.tweety.logics.commons.syntax.TypedStructureAdapter
- clone() - Method in class net.sf.tweety.logics.commons.syntax.Variable
- clone() - Method in class net.sf.tweety.logics.dl.syntax.AtomicConcept
- clone() - Method in class net.sf.tweety.logics.dl.syntax.AtomicRole
- clone() - Method in class net.sf.tweety.logics.dl.syntax.BottomConcept
- clone() - Method in class net.sf.tweety.logics.dl.syntax.Complement
- clone() - Method in class net.sf.tweety.logics.dl.syntax.ComplexConcept
-
Creates a deep copy of this formula
- clone() - Method in class net.sf.tweety.logics.dl.syntax.ConceptAssertion
- clone() - Method in class net.sf.tweety.logics.dl.syntax.DlAxiom
- clone() - Method in class net.sf.tweety.logics.dl.syntax.DlSignature
- clone() - Method in class net.sf.tweety.logics.dl.syntax.EquivalenceAxiom
- clone() - Method in class net.sf.tweety.logics.dl.syntax.ExistentialRestriction
- clone() - Method in class net.sf.tweety.logics.dl.syntax.Intersection
- clone() - Method in class net.sf.tweety.logics.dl.syntax.RoleAssertion
- clone() - Method in class net.sf.tweety.logics.dl.syntax.TopConcept
- clone() - Method in class net.sf.tweety.logics.dl.syntax.Union
- clone() - Method in class net.sf.tweety.logics.dl.syntax.UniversalRestriction
- clone() - Method in class net.sf.tweety.logics.fol.syntax.Conjunction
- clone() - Method in class net.sf.tweety.logics.fol.syntax.Contradiction
- clone() - Method in class net.sf.tweety.logics.fol.syntax.Disjunction
- clone() - Method in class net.sf.tweety.logics.fol.syntax.Equivalence
- clone() - Method in class net.sf.tweety.logics.fol.syntax.ExclusiveDisjunction
- clone() - Method in class net.sf.tweety.logics.fol.syntax.ExistsQuantifiedFormula
- clone() - Method in class net.sf.tweety.logics.fol.syntax.FolAtom
- clone() - Method in class net.sf.tweety.logics.fol.syntax.FolFormula
- clone() - Method in class net.sf.tweety.logics.fol.syntax.FolSignature
- clone() - Method in class net.sf.tweety.logics.fol.syntax.ForallQuantifiedFormula
- clone() - Method in class net.sf.tweety.logics.fol.syntax.Implication
- clone() - Method in class net.sf.tweety.logics.fol.syntax.Negation
- clone() - Method in class net.sf.tweety.logics.fol.syntax.Tautology
- clone() - Method in class net.sf.tweety.logics.ml.syntax.Necessity
- clone() - Method in class net.sf.tweety.logics.ml.syntax.Possibility
- clone() - Method in class net.sf.tweety.logics.mln.syntax.MlnFormula
- clone() - Method in class net.sf.tweety.logics.pl.syntax.Conjunction
- clone() - Method in class net.sf.tweety.logics.pl.syntax.Contradiction
- clone() - Method in class net.sf.tweety.logics.pl.syntax.Disjunction
- clone() - Method in class net.sf.tweety.logics.pl.syntax.Equivalence
- clone() - Method in class net.sf.tweety.logics.pl.syntax.ExclusiveDisjunction
- clone() - Method in class net.sf.tweety.logics.pl.syntax.Implication
- clone() - Method in class net.sf.tweety.logics.pl.syntax.Negation
- clone() - Method in class net.sf.tweety.logics.pl.syntax.PlFormula
- clone() - Method in class net.sf.tweety.logics.pl.syntax.PlPredicate
- clone() - Method in class net.sf.tweety.logics.pl.syntax.PlSignature
- clone() - Method in class net.sf.tweety.logics.pl.syntax.Proposition
- clone() - Method in class net.sf.tweety.logics.pl.syntax.Tautology
- clone() - Method in class net.sf.tweety.logics.qbf.syntax.ExistsQuantifiedFormula
- clone() - Method in class net.sf.tweety.logics.qbf.syntax.ForallQuantifiedFormula
- clone() - Method in class net.sf.tweety.logics.rcl.syntax.RelationalConditional
- clone() - Method in class net.sf.tweety.logics.rdl.syntax.DefaultRule
- clone() - Method in class net.sf.tweety.lp.asp.semantics.AnswerSet
- clone() - Method in class net.sf.tweety.lp.asp.syntax.AggregateAtom
- clone() - Method in class net.sf.tweety.lp.asp.syntax.AggregateElement
- clone() - Method in class net.sf.tweety.lp.asp.syntax.ArithmeticTerm
- clone() - Method in class net.sf.tweety.lp.asp.syntax.ASPAtom
- clone() - Method in class net.sf.tweety.lp.asp.syntax.ASPElement
- clone() - Method in class net.sf.tweety.lp.asp.syntax.ASPHead
- clone() - Method in class net.sf.tweety.lp.asp.syntax.ASPRule
- clone() - Method in class net.sf.tweety.lp.asp.syntax.ComparativeAtom
- clone() - Method in class net.sf.tweety.lp.asp.syntax.DefaultNegation
- clone() - Method in class net.sf.tweety.lp.asp.syntax.Program
- clone() - Method in class net.sf.tweety.lp.asp.syntax.StrictNegation
- clone() - Method in class net.sf.tweety.lp.nlp.syntax.NLPNot
- clone() - Method in class net.sf.tweety.lp.nlp.syntax.NLPRule
- clone() - Method in class net.sf.tweety.math.opt.problem.ConstraintSatisfactionProblem
- clone() - Method in class net.sf.tweety.math.opt.problem.OptimizationProblem
- clone() - Method in class net.sf.tweety.plugin.parameter.CustomStringListCommandParameter
-
method to clone this object for instantiation
- clone() - Method in class net.sf.tweety.plugin.parameter.FileListCommandParameter
- clone() - Method in class net.sf.tweety.plugin.parameter.IntegerCommandParameter
-
Clones the object
- clone() - Method in class net.sf.tweety.plugin.parameter.SelectionCommandParameter
- clone() - Method in class net.sf.tweety.plugin.parameter.StringListCommandParameter
-
method to clone this object for instantiation
- cloneWithAddedTerm(Term<?>) - Method in class net.sf.tweety.lp.asp.syntax.ASPAtom
- cloneWithAddedTerm(Term<?>) - Method in class net.sf.tweety.lp.asp.syntax.ASPLiteral
-
Creates a copy of the literal and adds the given term as argument to the end of the argument list.
- cloneWithAddedTerm(Term<?>) - Method in class net.sf.tweety.lp.asp.syntax.StrictNegation
- close() - Method in class net.sf.tweety.arg.adf.sat.AsynchronousCloseSatSolverState
- close() - Method in class net.sf.tweety.arg.adf.sat.AsynchronousSatSolverState
- close() - Method in interface net.sf.tweety.arg.adf.sat.SatSolverState
- close() - Method in class net.sf.tweety.arg.adf.sat.SimpleSatSolverState
- close() - Method in interface net.sf.tweety.logics.fol.writer.FolWriter
-
Closes the Writer.
- close() - Method in class net.sf.tweety.logics.fol.writer.Prover9Writer
- close() - Method in class net.sf.tweety.logics.fol.writer.SPASSWriter
- close() - Method in class net.sf.tweety.logics.fol.writer.StandardFolWriter
- close() - Method in class net.sf.tweety.logics.fol.writer.TPTPWriter
- close() - Method in class net.sf.tweety.logics.ml.writer.MleanCoPWriter
-
Closes the Writer.
- close() - Method in class net.sf.tweety.logics.ml.writer.SPASSWriter
- close() - Method in class net.sf.tweety.logics.pl.util.TextfileIterator
-
Close file reader (in case no more belief bases should be read)
- close() - Method in class net.sf.tweety.logics.qbf.writer.QdimacsWriter
- close() - Method in class net.sf.tweety.lp.asp.writer.ClingoWriter
- closeNodeScope(Node, boolean) - Method in class net.sf.tweety.lp.asp.parser.JJTASPCore2ParserState
- closeNodeScope(Node, int) - Method in class net.sf.tweety.lp.asp.parser.JJTASPCore2ParserState
- ClosureReasoner - Class in net.sf.tweety.arg.bipolar.reasoner.deductive
-
a set of arguments S is closed under the support relation iff all arguments supported by an element of S are in S.
- ClosureReasoner() - Constructor for class net.sf.tweety.arg.bipolar.reasoner.deductive.ClosureReasoner
- ClosureTest() - Method in class net.sf.tweety.arg.aba.AbaTest
- ClParser - Class in net.sf.tweety.logics.cl.parser
-
This class implements a parser for conditional logic.
- ClParser() - Constructor for class net.sf.tweety.logics.cl.parser.ClParser
- CNF - net.sf.tweety.arg.dung.parser.FileFormat
- CNF_RATIO - Static variable in class net.sf.tweety.logics.pl.examples.StreamInconsistencyEvaluationExample
- CNF_RATIO - Static variable in class net.sf.tweety.logics.pl.examples.StreamInconsistencyEvaluationExample2
- CnfParser - Class in 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() - Constructor for class net.sf.tweety.arg.dung.parser.CnfParser
- CnfSampler - Class in net.sf.tweety.logics.pl.util
-
A simple sampler for propositional belief bases.
- CnfSampler(Signature, double) - Constructor for class net.sf.tweety.logics.pl.util.CnfSampler
-
Creates a new sampler for the given signature.
- CnfSampler(Signature, double, int, int) - Constructor for class net.sf.tweety.logics.pl.util.CnfSampler
-
Creates a new sampler for the given signature.
- CnfWriter - Class in net.sf.tweety.arg.dung.writer
-
Writes an abstract argumentation framework into a file of the CNF format.
- CnfWriter() - Constructor for class net.sf.tweety.arg.dung.writer.CnfWriter
- CO - net.sf.tweety.arg.dung.semantics.Semantics
- coherence(MarkovLogicNetwork, AbstractMlnReasoner, FolSignature) - Method in class net.sf.tweety.logics.mln.analysis.AbstractCoherenceMeasure
-
Measures the coherence of the given MLN using the given reasoner.
- coherence(MarkovLogicNetwork, AbstractMlnReasoner, FolSignature) - Method in class net.sf.tweety.logics.mln.analysis.AggregatingCoherenceMeasure
- CoherentPASemantics - Class in net.sf.tweety.arg.prob.semantics
-
P is coherent wrt.
- CoherentPASemantics() - Constructor for class net.sf.tweety.arg.prob.semantics.CoherentPASemantics
- collapseAssociativeFormulas() - Method in class net.sf.tweety.logics.dl.syntax.AtomicConcept
- collapseAssociativeFormulas() - Method in class net.sf.tweety.logics.dl.syntax.AtomicRole
- collapseAssociativeFormulas() - Method in class net.sf.tweety.logics.dl.syntax.BottomConcept
- collapseAssociativeFormulas() - Method in class net.sf.tweety.logics.dl.syntax.Complement
- collapseAssociativeFormulas() - Method in class net.sf.tweety.logics.dl.syntax.ComplexConcept
-
This method collapses all associative operations appearing in this term, e.g.
- collapseAssociativeFormulas() - Method in class net.sf.tweety.logics.dl.syntax.ExistentialRestriction
- collapseAssociativeFormulas() - Method in class net.sf.tweety.logics.dl.syntax.Intersection
- collapseAssociativeFormulas() - Method in class net.sf.tweety.logics.dl.syntax.TopConcept
- collapseAssociativeFormulas() - Method in class net.sf.tweety.logics.dl.syntax.Union
- collapseAssociativeFormulas() - Method in class net.sf.tweety.logics.dl.syntax.UniversalRestriction
- collapseAssociativeFormulas() - Method in class net.sf.tweety.logics.fol.syntax.Conjunction
- collapseAssociativeFormulas() - Method in class net.sf.tweety.logics.fol.syntax.Disjunction
- collapseAssociativeFormulas() - Method in class net.sf.tweety.logics.fol.syntax.Equivalence
- collapseAssociativeFormulas() - Method in class net.sf.tweety.logics.fol.syntax.ExclusiveDisjunction
- collapseAssociativeFormulas() - Method in class net.sf.tweety.logics.fol.syntax.ExistsQuantifiedFormula
- collapseAssociativeFormulas() - Method in class net.sf.tweety.logics.fol.syntax.FolAtom
- collapseAssociativeFormulas() - Method in class net.sf.tweety.logics.fol.syntax.FolFormula
-
This method collapses all associative operations appearing in this term, e.g.
- collapseAssociativeFormulas() - Method in class net.sf.tweety.logics.fol.syntax.ForallQuantifiedFormula
- collapseAssociativeFormulas() - Method in class net.sf.tweety.logics.fol.syntax.Implication
- collapseAssociativeFormulas() - Method in class net.sf.tweety.logics.fol.syntax.Negation
- collapseAssociativeFormulas() - Method in class net.sf.tweety.logics.fol.syntax.SpecialFormula
- collapseAssociativeFormulas() - Method in class net.sf.tweety.logics.ml.syntax.Necessity
- collapseAssociativeFormulas() - Method in class net.sf.tweety.logics.ml.syntax.Possibility
- collapseAssociativeFormulas() - Method in class net.sf.tweety.logics.pl.syntax.Conjunction
- collapseAssociativeFormulas() - Method in class net.sf.tweety.logics.pl.syntax.Disjunction
- collapseAssociativeFormulas() - Method in class net.sf.tweety.logics.pl.syntax.Equivalence
- collapseAssociativeFormulas() - Method in class net.sf.tweety.logics.pl.syntax.ExclusiveDisjunction
- collapseAssociativeFormulas() - Method in class net.sf.tweety.logics.pl.syntax.Implication
- collapseAssociativeFormulas() - Method in class net.sf.tweety.logics.pl.syntax.Negation
- collapseAssociativeFormulas() - Method in class net.sf.tweety.logics.pl.syntax.PlFormula
-
This method collapses all associative operations appearing in this term, e.g.
- collapseAssociativeFormulas() - Method in class net.sf.tweety.logics.pl.syntax.Proposition
- collapseAssociativeFormulas() - Method in class net.sf.tweety.logics.pl.syntax.SpecialFormula
- collapseAssociativeFormulas() - Method in class net.sf.tweety.logics.qbf.syntax.ExistsQuantifiedFormula
- collapseAssociativeFormulas() - Method in class net.sf.tweety.logics.qbf.syntax.ForallQuantifiedFormula
- collapseAssociativeFormulas() - Method in class net.sf.tweety.lp.nlp.syntax.NLPNot
- collapseAssociativeOperations() - Method in class net.sf.tweety.math.equation.Statement
-
This method collapses all associative operations appearing in this statement, e.g.
- collapseAssociativeOperations() - Method in class net.sf.tweety.math.opt.problem.ConstraintSatisfactionProblem
-
This method collapses all associative operations appearing in the target function and the constraints, e.g.
- collapseAssociativeOperations() - Method in class net.sf.tweety.math.opt.problem.OptimizationProblem
- collapseAssociativeOperations() - Method in class net.sf.tweety.math.term.AssociativeOperation
- collapseAssociativeOperations() - Method in class net.sf.tweety.math.term.Constant
- collapseAssociativeOperations() - Method in class net.sf.tweety.math.term.Difference
- collapseAssociativeOperations() - Method in class net.sf.tweety.math.term.Fraction
- collapseAssociativeOperations() - Method in class net.sf.tweety.math.term.FunctionalTerm
- collapseAssociativeOperations() - Method in class net.sf.tweety.math.term.Term
-
This method collapses all associative operations appearing in this term, e.g.
- collapseAssociativeOperations() - Method in class net.sf.tweety.math.term.Variable
- collect(AcceptanceCondition, Collection<D>) - Method in interface net.sf.tweety.arg.adf.transform.Collector
-
Traverses through the given
AcceptanceCondition
and adds all the collected data to the provided collection. - collect(AcceptanceCondition, Consumer<D>) - Method in class net.sf.tweety.arg.adf.transform.AbstractCollector
- collect(AcceptanceCondition, Consumer<D>) - Method in interface net.sf.tweety.arg.adf.transform.Collector
-
Traverses through the given
AcceptanceCondition
and calls the provided consumer on all the collected data. - Collector<U,D> - Interface in net.sf.tweety.arg.adf.transform
-
The concept of a collector is similar to its sibling
Transformer
, we want to transform anAcceptanceCondition
into a different structure. - COLON - Static variable in interface net.sf.tweety.lp.asp.parser.ASPCore2Constants
-
RegularExpression Id.
- COLON - Static variable in interface net.sf.tweety.lp.asp.parser.ASPCore2ParserConstants
-
RegularExpression Id.
- CombinatoricsProblem - Class in net.sf.tweety.math.opt.problem
-
This class implements a combinatorial optimization problem
- CombinatoricsProblem(List<ElementOfCombinatoricsProb>) - Constructor for class net.sf.tweety.math.opt.problem.CombinatoricsProblem
- combine(Set<Map<E, F>>) - Method in class net.sf.tweety.commons.util.MapTools
-
Combines all maps in singleMaps to one maps containing every assignment of each map in singleMaps.
- combineWithAnd(Conjunctable) - Method in class net.sf.tweety.arg.delp.syntax.DelpRule
- combineWithAnd(Conjunctable) - Method in class net.sf.tweety.arg.dung.ldo.syntax.LdoFormula
- combineWithAnd(Conjunctable) - Method in class net.sf.tweety.logics.cl.syntax.Conditional
- combineWithAnd(Conjunctable) - Method in interface net.sf.tweety.logics.commons.syntax.interfaces.Conjunctable
-
Returns a conjunction of this and the given formula.
- combineWithAnd(Conjunctable) - Method in class net.sf.tweety.logics.commons.syntax.RelationalFormula
- combineWithAnd(Conjunctable) - Method in class net.sf.tweety.logics.dl.syntax.ComplexConcept
- combineWithAnd(Conjunctable) - Method in class net.sf.tweety.logics.fol.syntax.FolFormula
- combineWithAnd(Conjunctable) - Method in class net.sf.tweety.logics.ml.syntax.MlFormula
- combineWithAnd(Conjunctable) - Method in class net.sf.tweety.logics.mln.syntax.MlnFormula
- combineWithAnd(Conjunctable) - Method in class net.sf.tweety.logics.pl.syntax.PlFormula
- combineWithAnd(Conjunctable) - Method in class net.sf.tweety.logics.rcl.syntax.RelationalConditional
- combineWithAnd(Conjunctable) - Method in class net.sf.tweety.logics.rdl.syntax.DefaultRule
- combineWithOr(Disjunctable) - Method in class net.sf.tweety.arg.delp.syntax.DelpRule
- combineWithOr(Disjunctable) - Method in class net.sf.tweety.arg.dung.ldo.syntax.LdoFormula
- combineWithOr(Disjunctable) - Method in class net.sf.tweety.logics.cl.syntax.Conditional
- combineWithOr(Disjunctable) - Method in interface net.sf.tweety.logics.commons.syntax.interfaces.Disjunctable
- combineWithOr(Disjunctable) - Method in class net.sf.tweety.logics.commons.syntax.RelationalFormula
- combineWithOr(Disjunctable) - Method in class net.sf.tweety.logics.dl.syntax.ComplexConcept
- combineWithOr(Disjunctable) - Method in class net.sf.tweety.logics.fol.syntax.FolFormula
- combineWithOr(Disjunctable) - Method in class net.sf.tweety.logics.ml.syntax.MlFormula
- combineWithOr(Disjunctable) - Method in class net.sf.tweety.logics.mln.syntax.MlnFormula
- combineWithOr(Disjunctable) - Method in class net.sf.tweety.logics.pl.syntax.PlFormula
- combineWithOr(Disjunctable) - Method in class net.sf.tweety.logics.rcl.syntax.RelationalConditional
- combineWithOr(Disjunctable) - Method in class net.sf.tweety.logics.rdl.syntax.DefaultRule
- combineWithOr(Disjunctable) - Method in class net.sf.tweety.lp.asp.syntax.ASPHead
- COMMA - Static variable in interface net.sf.tweety.lp.asp.parser.ASPCore2Constants
-
RegularExpression Id.
- COMMA - Static variable in interface net.sf.tweety.lp.asp.parser.ASPCore2ParserConstants
-
RegularExpression Id.
- CommandLineInterface - Class in net.sf.tweety.arg.adf.cli
- CommandLineInterface() - Constructor for class net.sf.tweety.arg.adf.cli.CommandLineInterface
- CommandParameter - Class in 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) - Constructor for class net.sf.tweety.plugin.parameter.CommandParameter
-
non-empty constructor (member variables cannot be changed after construction)
- COMMENT - Static variable in interface net.sf.tweety.lp.asp.parser.ASPCore2Constants
-
RegularExpression Id.
- COMMENT - Static variable in interface net.sf.tweety.lp.asp.parser.ASPCore2ParserConstants
-
RegularExpression Id.
- CommonColdExample(int) - Static method in class net.sf.tweety.logics.mln.examples.MlnExample
- ComparativeAtom - Class in net.sf.tweety.lp.asp.syntax
-
This class represents a comparative atom, meaning an expression of the form t x u where t,u are terms and x is in {<, <=, ==, !=, >, >=}.
- ComparativeAtom(ASPOperator.BinaryOperator, Term<?>, Term<?>) - Constructor for class net.sf.tweety.lp.asp.syntax.ComparativeAtom
- ComparativeAtom(ComparativeAtom) - Constructor for class net.sf.tweety.lp.asp.syntax.ComparativeAtom
-
Copy-Constructor
- ComparativeTest() - Method in class net.sf.tweety.lp.asp.parser.ASPCore2ParserTest
- compare(double[], double[]) - Method in class net.sf.tweety.arg.rankings.util.LexicographicDoubleTupleComparator
- compare(int[], int[]) - Method in class net.sf.tweety.arg.rankings.util.LexicographicIntTupleComparator
- compare(Double, Double) - Method in class net.sf.tweety.arg.social.semantics.AbstractSocialSemantics
- compare(Double, Double) - Method in class net.sf.tweety.arg.social.semantics.SimpleProductSemantics
- compare(Collection<T>, Collection<T>) - Method in class net.sf.tweety.arg.aspic.order.SetComparator
- compare(AspicArgument<T>, AspicArgument<T>) - Method in class net.sf.tweety.arg.aspic.order.LastLinkOrder
- compare(AspicArgument<T>, AspicArgument<T>) - Method in class net.sf.tweety.arg.aspic.order.SimpleAspicOrder
- compare(AspicArgument<T>, AspicArgument<T>) - Method in class net.sf.tweety.arg.aspic.order.WeakestLinkOrder
- compare(AspicArgument<T>, AspicArgument<T>) - Method in class net.sf.tweety.arg.aspic.semantics.SimpleAspicOrder
- compare(InferenceRule<T>, InferenceRule<T>) - Method in class net.sf.tweety.arg.aspic.order.RuleComparator
- compare(DelpArgument, DelpArgument, DefeasibleLogicProgram) - Method in class net.sf.tweety.arg.delp.semantics.ComparisonCriterion
-
This method returns the relation of
argument1
toargument2
givencontext
. - compare(DelpArgument, DelpArgument, DefeasibleLogicProgram) - Method in class net.sf.tweety.arg.delp.semantics.EmptyCriterion
- compare(DelpArgument, DelpArgument, DefeasibleLogicProgram) - Method in class net.sf.tweety.arg.delp.semantics.GeneralizedSpecificity
- compare(Argument, Argument) - Method in class net.sf.tweety.arg.rankings.semantics.ArgumentRanking
- compare(Pair<Proposition, Boolean>, Pair<Proposition, Boolean>) - Method in class net.sf.tweety.logics.pl.semantics.NicePossibleWorld
- compare(NicePossibleWorld, NicePossibleWorld) - Method in class net.sf.tweety.logics.cl.semantics.ConditionalStructure
- compare(Program, Program) - Method in class net.sf.tweety.lp.asp.beliefdynamics.baserevision.ELPLexicographicalComparator
- compareEqualityWith(PreferenceOrder<T>) - Method in class net.sf.tweety.preferences.PreferenceOrder
-
compares this preference order to another given one whether each relation is contained in both
- compareTo(T2BeliefState) - Method in class net.sf.tweety.agents.dialogues.oppmodels.T2BeliefState
- compareTo(T3BeliefState) - Method in class net.sf.tweety.agents.dialogues.oppmodels.T3BeliefState
- compareTo(ArgumentSet) - Method in class net.sf.tweety.arg.bipolar.syntax.ArgumentSet
- compareTo(DeductiveArgumentationFramework) - Method in class net.sf.tweety.arg.bipolar.syntax.DeductiveArgumentationFramework
- compareTo(EvidentialArgumentationFramework) - Method in class net.sf.tweety.arg.bipolar.syntax.EvidentialArgumentationFramework
- compareTo(NecessityArgumentationFramework) - Method in class net.sf.tweety.arg.bipolar.syntax.NecessityArgumentationFramework
- compareTo(LdoArgument) - Method in class net.sf.tweety.arg.dung.ldo.syntax.LdoArgument
- compareTo(Extension) - Method in class net.sf.tweety.arg.dung.semantics.Extension
- compareTo(DungTheory) - Method in class net.sf.tweety.arg.dung.syntax.DungTheory
- compareTo(TypedStructureAdapter) - Method in class net.sf.tweety.logics.commons.syntax.TypedStructureAdapter
- compareTo(PossibleWorld) - Method in class net.sf.tweety.logics.pl.semantics.PossibleWorld
- compareTo(PossibleWorld) - Method in class net.sf.tweety.logics.qbf.semantics.QbPossibleWorld
- compareTo(Proposition) - Method in class net.sf.tweety.logics.pl.syntax.Proposition
- compareTo(ASPLiteral) - Method in class net.sf.tweety.lp.asp.syntax.ASPAtom
- compareTo(ASPLiteral) - Method in class net.sf.tweety.lp.asp.syntax.StrictNegation
- compareTo(ASPRule) - Method in class net.sf.tweety.lp.asp.syntax.ASPRule
- ComparisonCriterion - Class in net.sf.tweety.arg.delp.semantics
-
This class is the superclass for all comparison criteria between two arguments in defeasible logic programming.
- ComparisonCriterion() - Constructor for class net.sf.tweety.arg.delp.semantics.ComparisonCriterion
- ComparisonCriterion.Factory - Enum in net.sf.tweety.arg.delp.semantics
-
To select a subclass and create an instance throw a static factory method.
- ComparisonCriterion.Result - Enum in net.sf.tweety.arg.delp.semantics
- compatibility(List<MarkovLogicNetwork>, AbstractMlnReasoner, List<FolSignature>) - Method in interface net.sf.tweety.logics.mln.analysis.CompatibilityMeasure
-
Measures the compatibility of the given MLNs wrt.
- compatibility(List<MarkovLogicNetwork>, AbstractMlnReasoner, List<FolSignature>) - Method in class net.sf.tweety.logics.mln.analysis.DefaultCompatibilityMeasure
- CompatibilityMeasure - Interface in net.sf.tweety.logics.mln.analysis
-
This interface represents a compatibility measure for MLNs.
- Compensation - net.sf.tweety.logics.bpm.syntax.EventType
- Compilation - Class in net.sf.tweety.arg.deductive.semantics
-
Instances of this class are compilations in the sense of Definition 8 in
Philippe Besnard and Anthony Hunter. - Compilation(DeductiveKnowledgeBase) - Constructor for class net.sf.tweety.arg.deductive.semantics.Compilation
-
Creates the compilation of the given knowledge base.
- CompilationNode - Class in net.sf.tweety.arg.deductive.semantics
-
Instances of this class represent nodes in the compilation of a knowledge base, i.e.
- CompilationNode(Collection<? extends PlFormula>) - Constructor for class net.sf.tweety.arg.deductive.semantics.CompilationNode
-
Creates a new compilation node with the given set of formulas.
- CompilationReasoner - Class in net.sf.tweety.arg.deductive.reasoner
-
This class implements the approach of knowledge base compilation as proposed in
Philippe Besnard and Anthony Hunter. - CompilationReasoner(Categorizer, Accumulator) - Constructor for class net.sf.tweety.arg.deductive.reasoner.CompilationReasoner
-
Creates a new compilation reasoner for the given belief base, categorizer, and accumulator.
- complement() - Method in class net.sf.tweety.arg.delp.syntax.DelpRule
- complement() - Method in class net.sf.tweety.arg.dung.ldo.syntax.LdoFormula
- complement() - Method in class net.sf.tweety.logics.cl.syntax.Conditional
- complement() - Method in interface net.sf.tweety.logics.commons.syntax.interfaces.Invertable
- complement() - Method in class net.sf.tweety.logics.commons.syntax.RelationalFormula
- complement() - Method in class net.sf.tweety.logics.dl.syntax.ComplexConcept
- complement() - Method in class net.sf.tweety.logics.fol.syntax.FolFormula
- complement() - Method in class net.sf.tweety.logics.ml.syntax.MlFormula
- complement() - Method in class net.sf.tweety.logics.mln.syntax.MlnFormula
- complement() - Method in class net.sf.tweety.logics.pcl.syntax.ProbabilisticConditional
- complement() - Method in class net.sf.tweety.logics.pl.syntax.PlFormula
- complement() - Method in class net.sf.tweety.logics.rcl.syntax.RelationalConditional
- complement() - Method in class net.sf.tweety.logics.rdl.syntax.DefaultRule
- complement() - Method in class net.sf.tweety.logics.rpcl.syntax.RelationalProbabilisticConditional
- complement() - Method in class net.sf.tweety.lp.asp.syntax.ASPAtom
- complement() - Method in class net.sf.tweety.lp.asp.syntax.ASPLiteral
- complement() - Method in class net.sf.tweety.lp.asp.syntax.StrictNegation
- complement() - Method in class net.sf.tweety.math.probability.Probability
-
Returns the complement of this probability, i.e.
- Complement - Class in net.sf.tweety.logics.dl.syntax
-
This class models the complement (negation) in description logics.
- Complement(ComplexConcept) - Constructor for class net.sf.tweety.logics.dl.syntax.Complement
-
Create a new complement with the given DLFormula.
- ComplementTest() - Method in class net.sf.tweety.arg.aspic.AspicTest
- COMPLETE_SEMANTICS - Static variable in enum net.sf.tweety.arg.dung.semantics.Semantics
- CompleteReasoner<T extends Formula> - Class in net.sf.tweety.arg.aba.reasoner
-
This reasoner for ABA theories performs inference on the complete extensions.
- CompleteReasoner - Class in net.sf.tweety.arg.adf.reasoner
- CompleteReasoner - Class in net.sf.tweety.arg.bipolar.reasoner.evidential
-
a set of arguments S is complete iff it is admissible and all arguments acceptable wrt.
- CompleteReasoner - Class in net.sf.tweety.arg.bipolar.reasoner.necessity
-
a set of arguments S is complete iff it is admissible and all arguments defended by S are in S.
- CompleteReasoner() - Constructor for class net.sf.tweety.arg.aba.reasoner.CompleteReasoner
- CompleteReasoner() - Constructor for class net.sf.tweety.arg.bipolar.reasoner.evidential.CompleteReasoner
- CompleteReasoner() - Constructor for class net.sf.tweety.arg.bipolar.reasoner.necessity.CompleteReasoner
- CompleteReasoner(IncrementalSatSolver) - Constructor for class net.sf.tweety.arg.adf.reasoner.CompleteReasoner
- CompleteReasoning() - Method in class net.sf.tweety.arg.bipolar.EvidentialArgumentationTest
- CompleteReasoning() - Method in class net.sf.tweety.arg.bipolar.NecessityArgumentationTest
- CompleteVerifier - Class in net.sf.tweety.arg.adf.reasoner.sat.verifier
- CompleteVerifier() - Constructor for class net.sf.tweety.arg.adf.reasoner.sat.verifier.CompleteVerifier
- ComplexBeliefBaseTest() - Method in class net.sf.tweety.logics.qbf.test.QCIRTest
- ComplexBeliefBaseTest() - Method in class net.sf.tweety.logics.qbf.test.QDIMACSTest
- ComplexConcept - Class in net.sf.tweety.logics.dl.syntax
-
The common abstract class for concepts (also called concepts, complex concepts or concept descriptions) of description logics.
- ComplexConcept() - Constructor for class net.sf.tweety.logics.dl.syntax.ComplexConcept
- ComplexLogicalFormula - Interface in 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 - Class in 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() - Constructor for class net.sf.tweety.logics.commons.syntax.ComplexLogicalFormulaAdapter
- ComplexNumber - Class in net.sf.tweety.math
-
A complex number.
- ComplexNumber(double, double) - Constructor for class net.sf.tweety.math.ComplexNumber
-
Constructs a new complex number with the given real and imaginary parts.
- ComplexQueryTest() - Method in class net.sf.tweety.logics.dl.test.DlReasonerTest
- ComplexQueryTest() - Method in class net.sf.tweety.logics.ml.MleanCoPTest
- ComplexQueryTest() - Method in class net.sf.tweety.logics.ml.SPASSTest
- ComplexTermTest() - Method in class net.sf.tweety.lp.asp.parser.ASPCore2ParserTest
- compute(Argument, AcceptanceCondition) - Method in interface net.sf.tweety.arg.adf.semantics.link.LinkStrategy
- compute(Argument, AcceptanceCondition) - Method in class net.sf.tweety.arg.adf.semantics.link.SatLinkStrategy
- computeDegreeOfAcceptability(Collection<Argument>, Collection<Argument>, DungTheory) - Method in class net.sf.tweety.arg.rankings.reasoner.MTRankingReasoner
-
Computes the degree of acceptability of the strategy A wrt.
- computeModel(MarkovLogicNetwork, FolSignature) - Method in class net.sf.tweety.logics.mln.reasoner.ApproximateNaiveMlnReasoner
-
Computes the model of the given MLN wrt.
- computeRewards(Collection<Argument>, Collection<Argument>, DungTheory) - Method in class net.sf.tweety.arg.rankings.reasoner.MTRankingReasoner
-
Computes the rewards of the given strategy (set of arguments).
- computeStrengthOfArgument(Argument, DungTheory, Set<Set<Argument>>) - Method in class net.sf.tweety.arg.rankings.reasoner.MTRankingReasoner
-
Computes the value of the zero-sum game for the given argument.
- computeTupledValue(Argument, DungTheory) - Method in class net.sf.tweety.arg.rankings.reasoner.TuplesRankingReasoner
-
Computes the tupled value for the given argument.
- ConceptAssertion - Class in net.sf.tweety.logics.dl.syntax
-
This class models a concept assertion in description logic, i.e.
- ConceptAssertion() - Constructor for class net.sf.tweety.logics.dl.syntax.ConceptAssertion
-
Empty default constructor.
- ConceptAssertion(Individual, AtomicConcept) - Constructor for class net.sf.tweety.logics.dl.syntax.ConceptAssertion
-
Initializes a role assertion with the given atomic concept and Individual.
- ConceptAssertion(Individual, ComplexConcept) - Constructor for class net.sf.tweety.logics.dl.syntax.ConceptAssertion
-
Initializes a role assertion with the given concept and Individual.
- condensedEntropy() - Method in class net.sf.tweety.logics.rpcl.semantics.CondensedProbabilityDistribution
-
Returns the condensed entropy of this distribution (neglecting multiplicators of reference worlds.
- CondensedProbabilityDistribution - Class in net.sf.tweety.logics.rpcl.semantics
-
Instances of this class represent condensed probability distributions, rf.
- CondensedProbabilityDistribution(RpclSemantics, FolSignature) - Constructor for class net.sf.tweety.logics.rpcl.semantics.CondensedProbabilityDistribution
-
Creates a new condensed probability distribution for the given signature.
- Conditional - Class in net.sf.tweety.logics.cl.syntax
-
This class represents a basic conditional (B|A) with formulas A,B.
- Conditional - net.sf.tweety.logics.bpm.syntax.EventType
- Conditional(PlFormula) - Constructor for class net.sf.tweety.logics.cl.syntax.Conditional
-
Creates a new conditional with a tautological premise and given conclusion.
- Conditional(PlFormula, PlFormula) - Constructor for class net.sf.tweety.logics.cl.syntax.Conditional
-
Creates a new conditional with the given premise and conclusion.
- conditionalProbability(Conditional) - Method in class net.sf.tweety.logics.pcl.semantics.ProbabilityDistribution
-
Returns the probability of the given conditional
- ConditionalStructure - Class in 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() - Constructor for class net.sf.tweety.logics.cl.semantics.ConditionalStructure
-
Default-Ctor generates empty Conditional structure
- ConditionalStructure(Collection<Conditional>) - Constructor for class net.sf.tweety.logics.cl.semantics.ConditionalStructure
-
Ctor: generates a conditional structure containing the given conditionals
- ConditionalStructure(Collection<Conditional>, Comparator<NicePossibleWorld>) - Constructor for class net.sf.tweety.logics.cl.semantics.ConditionalStructure
-
Ctor: Generates a ConditionalStructure containing the given conditionals and using the given comparator to sort the worldData map.
- ConditionalStructure(Comparator<NicePossibleWorld>) - Constructor for class net.sf.tweety.logics.cl.semantics.ConditionalStructure
-
Ctor: Generates an empty ConditionalStructure that uses the given Comparator to sort its worldData map.
- ConditionalStructure.Generator - Enum in net.sf.tweety.logics.cl.semantics
-
The possible values of a conditional for a possible world
- ConditionalStructureKappaBuilder - Class in net.sf.tweety.logics.cl.kappa
-
This class builds the initial kappa value list for a given conditional structure.
- ConditionalStructureKappaBuilder() - Constructor for class net.sf.tweety.logics.cl.kappa.ConditionalStructureKappaBuilder
-
Default-Ctor: Generates a builder that does not uses fast evaluation
- ConditionalStructureKappaBuilder(boolean) - Constructor for class net.sf.tweety.logics.cl.kappa.ConditionalStructureKappaBuilder
-
Ctor: Generates a builder that uses fast evaluation depending on the given parameter
- confidence(Collection<Collection<T>>) - Method in class net.sf.tweety.machinelearning.assoc.AssociationRule
-
Returns the confidence of this rule wrt.
- ConfidentAttack - Class in net.sf.tweety.arg.lp.semantics.attack
-
This notion of attack models the confident attack relation.
- ConfidentRebut - Class in net.sf.tweety.arg.lp.semantics.attack
-
This notion of attack models the strong rebut relation.
- CONFIG_AGGREGATIONFUNCTION - Static variable in class net.sf.tweety.logics.commons.analysis.streams.WindowInconsistencyMeasurementProcess
-
Key for the configuration map that points to the aggregation function used.
- CONFIG_KEY_NUMBEROFPOPULATIONS - Static variable in class net.sf.tweety.logics.pl.analysis.ContensionInconsistencyMeasurementProcess
-
Configuration key for the number of populations tried out.
- CONFIG_KEY_NUMBEROFPOPULATIONS - Static variable in class net.sf.tweety.logics.pl.analysis.HsInconsistencyMeasurementProcess
-
Configuration key for the number of populations tried out.
- CONFIG_KEY_SIGNATURE - Static variable in class net.sf.tweety.logics.pl.analysis.ContensionInconsistencyMeasurementProcess
-
Configuration key for the signature.
- CONFIG_KEY_SIGNATURE - Static variable in class net.sf.tweety.logics.pl.analysis.HsInconsistencyMeasurementProcess
-
Configuration key for the signature.
- CONFIG_KEY_WITNESSPROVIDER - Static variable in class net.sf.tweety.logics.pl.analysis.ContensionInconsistencyMeasurementProcess
-
Configuration key for the consistency tester.
- CONFIG_MEASURE - Static variable in class net.sf.tweety.logics.commons.analysis.streams.WindowInconsistencyMeasurementProcess
-
Key for the configuration map that points to the inconsistency measure to be used.
- CONFIG_NAME - Static variable in class net.sf.tweety.logics.commons.analysis.streams.WindowInconsistencyMeasurementProcess
-
Key for the configuration map that points to the name to be used.
- CONFIG_SMOOTHINGFACTOR - Static variable in class net.sf.tweety.logics.pl.analysis.ContensionInconsistencyMeasurementProcess
-
Key for the configuration map that points to the smoothing factor to be used.
- CONFIG_SMOOTHINGFACTOR - Static variable in class net.sf.tweety.logics.pl.analysis.HsInconsistencyMeasurementProcess
-
Key for the configuration map that points to the smoothing factor to be used.
- CONFIG_TIMEOUT - Static variable in class net.sf.tweety.logics.commons.analysis.streams.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 - Static variable in class net.sf.tweety.logics.commons.analysis.streams.WindowInconsistencyMeasurementProcess
-
Key for the configuration map that points to the window size to be used.
- configCLI() - Static method in class net.sf.tweety.cli.plugins.CliMain
-
This method is meant to load the tweety plugin pathes on startup
- CONFLICTFREE_SEMANTICS - Static variable in enum net.sf.tweety.arg.dung.semantics.OrderingSemantics
- CONFLICTFREE_SEMANTICS - Static variable in enum net.sf.tweety.arg.dung.semantics.Semantics
- ConflictFreeGenerator - Class in net.sf.tweety.arg.adf.reasoner.sat.generator
- ConflictFreeGenerator() - Constructor for class net.sf.tweety.arg.adf.reasoner.sat.generator.ConflictFreeGenerator
- ConflictFreeInterpretationSatEncoding - Class in net.sf.tweety.arg.adf.reasoner.sat.encodings
- ConflictFreeInterpretationSatEncoding() - Constructor for class net.sf.tweety.arg.adf.reasoner.sat.encodings.ConflictFreeInterpretationSatEncoding
- ConflictFreeReasoner - Class in net.sf.tweety.arg.adf.reasoner
- ConflictFreeReasoner - Class in net.sf.tweety.arg.bipolar.reasoner.evidential
-
a set of arguments S is conflict-free iff there exists no attack between a subset of S and an element of S.
- ConflictFreeReasoner() - Constructor for class net.sf.tweety.arg.bipolar.reasoner.evidential.ConflictFreeReasoner
- ConflictFreeReasoner(IncrementalSatSolver) - Constructor for class net.sf.tweety.arg.adf.reasoner.ConflictFreeReasoner
- Conjunctable - Interface in net.sf.tweety.logics.commons.syntax.interfaces
-
Formulas implementing this interface can be connected by using AND.
- Conjunction - Class in net.sf.tweety.logics.fol.syntax
-
The classical conjunction of first-order logic.
- Conjunction - Class in net.sf.tweety.logics.pl.syntax
-
This class represents a conjunction in propositional logic.
- Conjunction() - Constructor for class net.sf.tweety.logics.fol.syntax.Conjunction
-
Creates a new (empty) conjunction.
- Conjunction() - Constructor for class net.sf.tweety.logics.pl.syntax.Conjunction
-
Creates a new (empty) conjunction.
- Conjunction(Collection<? extends RelationalFormula>) - Constructor for class net.sf.tweety.logics.fol.syntax.Conjunction
-
Creates a new conjunction with the given inner formulas.
- Conjunction(Collection<? extends PlFormula>) - Constructor for class net.sf.tweety.logics.pl.syntax.Conjunction
-
Creates a new conjunction with the given inner formulas.
- Conjunction(RelationalFormula, RelationalFormula) - Constructor for class net.sf.tweety.logics.fol.syntax.Conjunction
-
Creates a new conjunction with the two given formulae
- Conjunction(PlFormula, PlFormula) - Constructor for class net.sf.tweety.logics.pl.syntax.Conjunction
-
Creates a new conjunction with the two given formulae
- CONJUNCTION() - Static method in class net.sf.tweety.logics.commons.LogicalSymbols
- ConjunctionAcceptanceCondition - Class in net.sf.tweety.arg.adf.syntax.acc
- ConjunctionAcceptanceCondition(Collection<AcceptanceCondition>) - Constructor for class net.sf.tweety.arg.adf.syntax.acc.ConjunctionAcceptanceCondition
- ConjunctionAcceptanceCondition(AcceptanceCondition, AcceptanceCondition) - Constructor for class net.sf.tweety.arg.adf.syntax.acc.ConjunctionAcceptanceCondition
- ConjunctionTest() - Method in class net.sf.tweety.logics.pl.test.PlParserTest
- CONJUNCTS - net.sf.tweety.logics.pl.analysis.IcebergInconsistencyMeasure.ConsequenceOperation
- CONS - Static variable in interface net.sf.tweety.lp.asp.parser.ASPCore2Constants
-
RegularExpression Id.
- CONS - Static variable in interface net.sf.tweety.lp.asp.parser.ASPCore2ParserConstants
-
RegularExpression Id.
- CONSISTENCY - Static variable in class net.sf.tweety.logics.pl.postulates.ImPostulate
-
The CONSISTENCY postulate
- 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<ASPRule>) - Method in class net.sf.tweety.lp.asp.beliefdynamics.baserevision.ScreenedMaxichoiceConsolidation
- consolidate(Collection<T>) - Method in interface net.sf.tweety.lp.asp.beliefdynamics.baserevision.ConsolidationOperator
-
Returns a consolidation of set p, i.e.
- consolidate(Program) - Method in class net.sf.tweety.lp.asp.beliefdynamics.baserevision.ScreenedMaxichoiceConsolidation
-
Calculates the screened consolidation !r of program p using a maxi-choice selection function s, i.e.
- 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 - Class in net.sf.tweety.logics.commons.syntax
-
A Constant represents an constant object in the world of a logical language.
- Constant - Class in net.sf.tweety.math.term
-
This class models an abstract constant, e.g.
- Constant() - Constructor for class net.sf.tweety.math.term.Constant
- Constant(String) - Constructor for class net.sf.tweety.logics.commons.syntax.Constant
-
Ctor: Creates a new Constant with the given name, uses "Thing" as sort.
- Constant(String, Sort) - Constructor for class net.sf.tweety.logics.commons.syntax.Constant
-
Ctor: Creates a new Constant with the given name and sort
- Constant(Constant) - Constructor for class net.sf.tweety.logics.commons.syntax.Constant
-
Copy-Ctor: Creates a deep copy of the given Constant
- ConstantSet(FolSignature) - Static method in class net.sf.tweety.logics.rpcl.parser.rpclcondensedprobabilitydistributionparser.RpclCondensedProbabilityDistributionParser
- ConstraintSatisfactionProblem - Class in net.sf.tweety.math.opt.problem
-
This class models a general constraint satisfaction problem.
- ConstraintSatisfactionProblem() - Constructor for class net.sf.tweety.math.opt.problem.ConstraintSatisfactionProblem
-
Creates a new and empty csp.
- ConstraintSatisfactionProblem(Collection<? extends Statement>) - Constructor for class net.sf.tweety.math.opt.problem.ConstraintSatisfactionProblem
-
Creates a new csp with the given statements
- contains(Object) - Method in class net.sf.tweety.agents.MultiAgentSystem
- contains(Object) - Method in class net.sf.tweety.arg.aba.semantics.AbaExtension
- contains(Object) - Method in class net.sf.tweety.arg.adf.util.MinusSetView
- contains(Object) - Method in class net.sf.tweety.arg.adf.util.UnionSetView
- contains(Object) - Method in class net.sf.tweety.arg.bipolar.syntax.ArgumentSet
- contains(Object) - Method in class net.sf.tweety.arg.bipolar.syntax.BArgument
- contains(Object) - Method in class net.sf.tweety.arg.bipolar.syntax.BinaryAttack
- contains(Object) - Method in class net.sf.tweety.arg.bipolar.syntax.BinarySupport
- contains(Object) - Method in interface net.sf.tweety.arg.bipolar.syntax.BipolarEntity
- contains(Object) - Method in class net.sf.tweety.arg.bipolar.syntax.SetAttack
- contains(Object) - Method in class net.sf.tweety.arg.bipolar.syntax.SetSupport
- contains(Object) - Method in class net.sf.tweety.arg.dung.ldo.syntax.LdoAssociativeFormula
- contains(Object) - Method in class net.sf.tweety.arg.dung.semantics.Extension
- contains(Object) - Method in class net.sf.tweety.arg.dung.syntax.DungTheory
- contains(Object) - Method in class net.sf.tweety.arg.saf.syntax.ArgumentStructure
- contains(Object) - Method in class net.sf.tweety.commons.BeliefSet
- contains(Object) - Method in class net.sf.tweety.commons.InterpretationSet
- contains(Object) - Method in class net.sf.tweety.graphs.DefaultGraph
- contains(Object) - Method in interface net.sf.tweety.graphs.Graph
-
Returns "true" when this graph contains the given node or edge.
- contains(Object) - Method in class net.sf.tweety.logics.bpm.syntax.BpmnModel
- contains(Object) - Method in class net.sf.tweety.logics.commons.syntax.AssociativeFormulaSupport
- contains(Object) - Method in class net.sf.tweety.logics.dl.syntax.AssociativeDlFormula
- contains(Object) - Method in class net.sf.tweety.logics.fol.syntax.AssociativeFolFormula
- contains(Object) - Method in class net.sf.tweety.logics.fol.syntax.FolSignature
-
Returns true if this signature contains the specified constant, predicate, functor, sort or all constants, predicates, functors and sorts in the specified FolFormula.
- contains(Object) - Method in class net.sf.tweety.logics.pl.syntax.AssociativePlFormula
- contains(Object) - Method in class net.sf.tweety.logics.rdl.semantics.Extension
- contains(Object) - Method in class net.sf.tweety.lp.asp.syntax.ASPHead
- contains(Object) - Method in class net.sf.tweety.math.Interval
- contains(Object) - Method in class net.sf.tweety.preferences.PreferenceOrder
-
checks whether this preference order contains a given pair
- contains(Argument) - Method in interface net.sf.tweety.arg.adf.syntax.acc.AcceptanceCondition
- contains(Argument) - Method in enum net.sf.tweety.arg.adf.syntax.acc.ContradictionAcceptanceCondition
- contains(Argument) - Method in enum net.sf.tweety.arg.adf.syntax.acc.TautologyAcceptanceCondition
- contains(Argument) - Method in interface net.sf.tweety.arg.adf.syntax.adf.AbstractDialecticalFramework
- contains(Argument) - Method in class net.sf.tweety.arg.adf.syntax.adf.ExtendedAbstractDialecticalFramework
- contains(Argument) - Method in class net.sf.tweety.arg.adf.syntax.adf.GraphAbstractDialecticalFramework
- contains(Argument) - Method in class net.sf.tweety.arg.adf.syntax.Argument
- contains(BArgument) - Method in class net.sf.tweety.arg.bipolar.syntax.SetSupport
-
Return true if the given argument is in this support relation.
- contains(Argument) - Method in class net.sf.tweety.arg.dung.syntax.Attack
-
Return true if the given argument is in this attack relation.
- contains(T) - Method in class net.sf.tweety.commons.SingleSetSignature
-
Returns true if this signature contains the specified formula.
- containsActionName(String) - Method in class net.sf.tweety.action.signature.ActionSignature
-
Returns true iff the given actionName is contained in this action signature.
- containsActionName(FolActionName) - Method in class net.sf.tweety.action.signature.ActionSignature
-
Returns true iff the given actionName is contained in this signature.
- containsAll(Collection<?>) - Method in class net.sf.tweety.agents.MultiAgentSystem
- containsAll(Collection<?>) - Method in class net.sf.tweety.arg.aba.semantics.AbaExtension
- containsAll(Collection<?>) - Method in class net.sf.tweety.arg.adf.util.MinusSetView
- containsAll(Collection<?>) - Method in class net.sf.tweety.arg.adf.util.UnionSetView
- containsAll(Collection<?>) - Method in class net.sf.tweety.arg.bipolar.syntax.ArgumentSet
- containsAll(Collection<?>) - Method in class net.sf.tweety.arg.dung.ldo.syntax.LdoAssociativeFormula
- containsAll(Collection<?>) - Method in class net.sf.tweety.arg.dung.semantics.Extension
- containsAll(Collection<?>) - Method in class net.sf.tweety.arg.dung.syntax.DungTheory
- containsAll(Collection<?>) - Method in class net.sf.tweety.arg.saf.syntax.ArgumentStructure
- containsAll(Collection<?>) - Method in class net.sf.tweety.commons.BeliefSet
- containsAll(Collection<?>) - Method in class net.sf.tweety.commons.InterpretationSet
- containsAll(Collection<?>) - Method in class net.sf.tweety.logics.commons.syntax.AssociativeFormulaSupport
- containsAll(Collection<?>) - Method in class net.sf.tweety.logics.dl.syntax.AssociativeDlFormula
- containsAll(Collection<?>) - Method in class net.sf.tweety.logics.fol.syntax.AssociativeFolFormula
- containsAll(Collection<?>) - Method in class net.sf.tweety.logics.pl.syntax.AssociativePlFormula
- containsAll(Collection<?>) - Method in class net.sf.tweety.logics.rdl.semantics.Extension
- containsAll(Collection<?>) - Method in class net.sf.tweety.lp.asp.syntax.ASPHead
- containsAll(Collection<?>) - Method in class net.sf.tweety.math.Interval
- containsAll(Collection<?>) - Method in class net.sf.tweety.preferences.PreferenceOrder
-
checks, whether all of the given elements are contained in the preference order
- containsAll(Collection<Argument>) - Method in interface net.sf.tweety.arg.adf.semantics.interpretation.Interpretation
- containsAll(Collection<T>) - Method in class net.sf.tweety.commons.SingleSetSignature
-
Returns true if this signature contains all of the elements in the specified collection.
- containsAttack(Attack) - Method in class net.sf.tweety.arg.dung.syntax.DungTheory
-
Checks whether this theory contains the given attack.
- containsBackEdge(Node, Map<Node, Integer>, Graph<S>) - Static method in class net.sf.tweety.graphs.DefaultGraph
-
Helper method for detecting cycles using depth-first search.
- containsConcept(String) - Method in class net.sf.tweety.logics.dl.syntax.DlSignature
-
Checks whether the signature contains an atomic concept of the given name.
- containsConstant(String) - Method in class net.sf.tweety.logics.fol.syntax.FolSignature
-
Returns true if this signature contains the constant of the given name.
- containsCycle() - Method in class net.sf.tweety.arg.dung.syntax.DungTheory
-
Checks whether there is at least one cycle in this DungTheory.
- containsCycle(Graph<S>) - Static method in class net.sf.tweety.graphs.DefaultGraph
-
Checks whether there is at least one cycle in the given graph.
- containsFluentName(String) - Method in class net.sf.tweety.action.signature.ActionSignature
-
Returns true iff the given fluentName is contained in this action signature.
- containsFluentName(FolFluentName) - Method in class net.sf.tweety.action.signature.ActionSignature
-
Returns true iff the given fluentName is contained in this signature.
- containsFunctionalTerms() - Method in class net.sf.tweety.logics.fol.syntax.LogicStructure
-
Checks whether this structure contains any functional terms.
- containsFunctor(String) - Method in class net.sf.tweety.logics.fol.syntax.FolSignature
-
Returns true if this signature contains the functor of the given name.
- containsIncomparableArguments() - Method in class net.sf.tweety.arg.rankings.semantics.ArgumentRanking
- containsIncomparableArguments() - Method in class net.sf.tweety.arg.rankings.semantics.LatticeArgumentRanking
- containsIncomparableArguments() - Method in class net.sf.tweety.arg.rankings.semantics.NumericalArgumentRanking
- containsIndividual(String) - Method in class net.sf.tweety.logics.dl.syntax.DlSignature
-
Checks whether the signature contains an Individual of the given name.
- containsKey(Object) - Method in class net.sf.tweety.arg.adf.util.CacheMap
- containsKey(Object) - Method in class net.sf.tweety.arg.adf.util.LazyMap
- containsKey(Object) - Method in class net.sf.tweety.arg.dung.semantics.Labeling
- containsKey(Object) - Method in class net.sf.tweety.arg.dung.semantics.StratifiedLabeling
- containsKey(Object) - Method in class net.sf.tweety.arg.rankings.semantics.NumericalArgumentRanking
- containsKey(Object) - Method in class net.sf.tweety.logics.pcl.semantics.ProbabilityDistribution
- containsKey(Object) - Method in class net.sf.tweety.logics.pl.semantics.FuzzyInterpretation
- containsKey(Object) - Method in class net.sf.tweety.logics.rpcl.semantics.ReferenceWorld
- containsKey(Object) - Method in class net.sf.tweety.logics.rpcl.semantics.RpclProbabilityDistribution
- containsKey(Object) - Method in class net.sf.tweety.math.probability.ProbabilityFunction
- containsKey(Object) - Method in class net.sf.tweety.preferences.ranking.Functions
-
checks whether the key is present in the entry-set of the map
- containsKey(Argument) - Method in class net.sf.tweety.arg.social.semantics.SocialMapping
-
Returns "true" iff the given argument has a value.
- containsModalityOperator() - Method in class net.sf.tweety.logics.ml.syntax.MlFormula
-
Checks whether this formula contains a modal operator ("necessity" operator or "possibility" operator).
- containsParameter(TrainingParameter) - Method in class net.sf.tweety.machinelearning.ParameterSet
-
Checks whether this set contains a parameter with the same name as the given parameter.
- containsPredicate(String) - Method in class net.sf.tweety.logics.fol.syntax.FolSignature
-
Returns true if this signature contains the predicate of the given name.
- containsPredicate(Predicate) - Method in class net.sf.tweety.action.signature.ActionSignature
-
Returns true iff the given predicate is contained in this signature.
- containsQuantifier() - Method in class net.sf.tweety.arg.delp.syntax.DelpRule
- containsQuantifier() - Method in interface net.sf.tweety.logics.commons.syntax.interfaces.QuantifiedFormula
-
Checks whether this formula contains any quantification.
- containsQuantifier() - Method in class net.sf.tweety.logics.commons.syntax.QuantifiedFormulaSupport
- containsQuantifier() - Method in class net.sf.tweety.logics.fol.syntax.AssociativeFolFormula
- containsQuantifier() - Method in class net.sf.tweety.logics.fol.syntax.Equivalence
- containsQuantifier() - Method in class net.sf.tweety.logics.fol.syntax.ExistsQuantifiedFormula
- containsQuantifier() - Method in class net.sf.tweety.logics.fol.syntax.FolAtom
- containsQuantifier() - Method in class net.sf.tweety.logics.fol.syntax.ForallQuantifiedFormula
- containsQuantifier() - Method in class net.sf.tweety.logics.fol.syntax.Implication
- containsQuantifier() - Method in class net.sf.tweety.logics.fol.syntax.Negation
- containsQuantifier() - Method in class net.sf.tweety.logics.fol.syntax.SpecialFormula
- containsQuantifier() - Method in class net.sf.tweety.logics.ml.syntax.MlFormula
- containsQuantifier() - Method in class net.sf.tweety.logics.mln.syntax.MlnFormula
- containsQuantifier() - Method in class net.sf.tweety.logics.rcl.syntax.RelationalConditional
- containsQuantifier() - Method in class net.sf.tweety.logics.rdl.syntax.DefaultRule
- containsQuantifier() - Method in class net.sf.tweety.lp.nlp.syntax.NLPNot
- containsRelation(T, T) - Method in class net.sf.tweety.preferences.PreferenceOrder
-
checks whether this preference order contains a pair of given elements
- containsRole(String) - Method in class net.sf.tweety.logics.dl.syntax.DlSignature
-
Checks whether the signature contains an atomic role of the given name.
- containsSort(String) - Method in class net.sf.tweety.logics.fol.syntax.FolSignature
-
Returns true if this signature contains the sort of the given name.
- containsTermsOfType(Class<C>) - Method in class net.sf.tweety.arg.aba.syntax.AbaElement
- containsTermsOfType(Class<C>) - Method in class net.sf.tweety.arg.aspic.syntax.InferenceRule
- containsTermsOfType(Class<C>) - Method in class net.sf.tweety.logics.commons.syntax.ComplexLogicalFormulaAdapter
- containsTermsOfType(Class<C>) - Method in interface net.sf.tweety.logics.commons.syntax.interfaces.LogicStructure
-
Checks if this logical structure contains at least one term of type C.
- containsTermsOfType(Class<C>) - Method in class net.sf.tweety.logics.commons.syntax.RelationalFormula
- containsTermsOfType(Class<C>) - Method in class net.sf.tweety.logics.commons.syntax.Sort
- containsTermsOfType(Class<C>) - Method in class net.sf.tweety.logics.commons.syntax.TermAdapter
- containsTermsOfType(Class<C>) - Method in class net.sf.tweety.lp.asp.syntax.ASPElement
- containsTermsOfType(Class<C>) - Method in class net.sf.tweety.lp.asp.syntax.ASPHead
- containsTriple(T, T, Relation) - Method in class net.sf.tweety.preferences.PreferenceOrder
-
checks whether the given triple is contained
- containsValue(Object) - Method in class net.sf.tweety.arg.adf.util.CacheMap
- containsValue(Object) - Method in class net.sf.tweety.arg.adf.util.LazyMap
- containsValue(Object) - Method in class net.sf.tweety.arg.dung.semantics.Labeling
- containsValue(Object) - Method in class net.sf.tweety.arg.dung.semantics.StratifiedLabeling
- containsValue(Object) - Method in class net.sf.tweety.arg.rankings.semantics.NumericalArgumentRanking
- containsValue(Object) - Method in class net.sf.tweety.logics.pcl.semantics.ProbabilityDistribution
- containsValue(Object) - Method in class net.sf.tweety.logics.pl.semantics.FuzzyInterpretation
- containsValue(Object) - Method in class net.sf.tweety.logics.rpcl.semantics.ReferenceWorld
- containsValue(Object) - Method in class net.sf.tweety.logics.rpcl.semantics.RpclProbabilityDistribution
- containsValue(Object) - Method in class net.sf.tweety.math.probability.ProbabilityFunction
- containsValue(Object) - Method in class net.sf.tweety.preferences.ranking.Functions
-
checks whether the value is present in the entry-set of the map
- CONTENSION - net.sf.tweety.logics.pl.analysis.InconsistencyMeasureFactory.Measure
- ContensionExample - Class in net.sf.tweety.logics.pl.examples
-
Example code illustrating the contension inconsistency measure.
- ContensionExample() - Constructor for class net.sf.tweety.logics.pl.examples.ContensionExample
- ContensionInconsistencyMeasure - Class in net.sf.tweety.logics.pl.analysis
-
This class implements the contension inconsistency measure, cf.
- ContensionInconsistencyMeasure() - Constructor for class net.sf.tweety.logics.pl.analysis.ContensionInconsistencyMeasure
- ContensionInconsistencyMeasurementProcess - Class in net.sf.tweety.logics.pl.analysis
-
Implements an approximation algorithm for the Contension inconsistency measure on streams.
- ContensionInconsistencyMeasurementProcess() - Constructor for class net.sf.tweety.logics.pl.analysis.ContensionInconsistencyMeasurementProcess
- ContensionSampler - Class in 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(PlSignature, int) - Constructor for class net.sf.tweety.logics.pl.util.ContensionSampler
-
Creates a new sample for the given signature which generates propositional belief sets with the given inconsistency value (wrt.
- ContensionSampler(PlSignature, int, int, int) - Constructor for class net.sf.tweety.logics.pl.util.ContensionSampler
-
Creates a new sample for the given signature which generates propositional belief sets with the given inconsistency value (wrt.
- CONTRA - net.sf.tweety.agents.dialogues.oppmodels.GroundedGameSystem.AgentFaction
- contract(Collection<T>, Collection<T>) - Method in class net.sf.tweety.beliefdynamics.kernels.KernelContractionOperator
- contract(Collection<T>, Collection<T>) - Method in class net.sf.tweety.beliefdynamics.MultipleBaseContractionOperator
-
Contracts the first collection of formulas by the second collection of formulas.
- contract(Collection<T>, T) - Method in interface net.sf.tweety.beliefdynamics.BaseContractionOperator
-
Contracts the given collection of formulas by the given formula.
- contract(Collection<T>, T) - Method in class net.sf.tweety.beliefdynamics.MultipleBaseContractionOperator
- Contradiction - Class in net.sf.tweety.logics.fol.syntax
-
A contradictory formula.
- Contradiction - Class in net.sf.tweety.logics.pl.syntax
-
A contradictory formula.
- Contradiction() - Constructor for class net.sf.tweety.logics.fol.syntax.Contradiction
-
Creates a new contradiction.
- Contradiction() - Constructor for class net.sf.tweety.logics.pl.syntax.Contradiction
-
Creates a new contradiction.
- CONTRADICTION - Static variable in interface net.sf.tweety.arg.adf.syntax.acc.AcceptanceCondition
-
This constant is an alias for
ContradictionAcceptanceCondition.INSTANCE
, its only purpose is readability. - CONTRADICTION - Static variable in class net.sf.tweety.logics.pl.postulates.ImPostulate
-
The CONTRADICTION postulate
- CONTRADICTION() - Static method in class net.sf.tweety.logics.commons.LogicalSymbols
- ContradictionAcceptanceCondition - Enum in net.sf.tweety.arg.adf.syntax.acc
- ContradictionAsQueryTest() - Method in class net.sf.tweety.logics.ml.MlReasonerTest
- ContradictionTest() - Method in class net.sf.tweety.logics.fol.test.FolParserTest
- ContradictionTest() - Method in class net.sf.tweety.logics.pl.test.PlParserTest
- ConversionTools - Class in net.sf.tweety.commons.util
-
This class provides some utility methods for converting different data types.
- ConversionTools() - Constructor for class net.sf.tweety.commons.util.ConversionTools
- convertToCplexLpFormat() - Method in class net.sf.tweety.math.opt.problem.OptimizationProblem
-
Converts the this optimization problem into a string in the commonly used CPLEX LP-format for mixed integer linear programming.
- convertToDimacs(Collection<PlFormula>) - Static method in class net.sf.tweety.logics.pl.sat.SatSolver
-
Converts the given set of formulas to their string representation in Dimacs CNF.
- convertToDimacs(Collection<PlFormula>, List<Proposition>) - Static method in class net.sf.tweety.logics.pl.sat.SatSolver
-
Converts the given set of formulas to their string representation in Dimacs CNF.
- convertToLpFormat() - Method in class net.sf.tweety.math.opt.problem.OptimizationProblem
-
Converts the this optimization problem into a string in the commonly used LP-format for mixed integer linear programming.
- ConvexAggregatingMaxConsMeMachineShop - Class in 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(OptimizationRootFinder) - Constructor for class net.sf.tweety.logics.pcl.analysis.ConvexAggregatingMaxConsMeMachineShop
- ConvexAggregatingMeMachineShop - Class in 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(OptimizationRootFinder) - Constructor for class net.sf.tweety.logics.pcl.analysis.ConvexAggregatingMeMachineShop
- convexCombination(double[], ProbabilityDistribution<S>[]) - Static method in class net.sf.tweety.logics.pcl.semantics.ProbabilityDistribution
-
Computes the convex combination of the given probability distributions P1,...,PN with parameters factors, i.e.
- convexCombination(double[], ProbabilityFunction<S>[]) - Static method in class net.sf.tweety.math.probability.ProbabilityFunction
-
Computes the convex combination of the given probability distributions P1,...,PN with parameters factors, i.e.
- convexCombination(double, ProbabilityDistribution<T>) - Method in class net.sf.tweety.logics.pcl.semantics.ProbabilityDistribution
-
Computes the convex combination of this P1 and the given probability distribution P2 with parameter d, i.e.
- convexCombination(double, RpclProbabilityDistribution<T>) - Method in class net.sf.tweety.logics.rpcl.semantics.RpclProbabilityDistribution
-
Computes the convex combination of this P1 and the given probability distribution P2 with parameter d, i.e.
- convexCombination(double, ProbabilityFunction<T>) - Method in class net.sf.tweety.math.probability.ProbabilityFunction
-
Computes the convex combination of this P1 and the given probability distribution P2 with parameter d, i.e.
- copy(AbstractDialecticalFramework) - Static method in interface net.sf.tweety.arg.adf.syntax.adf.AbstractDialecticalFramework
-
Creates a copy of the given AbstractDialecticalFramework, which can be modified before build() is called.
- copyHelper(Collection<T>) - Method in class net.sf.tweety.logics.commons.syntax.AssociativeFormulaSupport
-
This method generates a deep copy of the given collection of RelationalFormula
- CorsResponseFilter - Class in net.sf.tweety.web
-
For enabling cross-origin resource sharing
- CorsResponseFilter() - Constructor for class net.sf.tweety.web.CorsResponseFilter
- costOf(Interpretation<PlBeliefSet, PlFormula>, Collection<PlFormula>, Map<PlFormula, Integer>) - Static method in class net.sf.tweety.logics.pl.sat.MaxSatSolver
-
Returns the cost of the given interpretation, i.e.
- COUNT - net.sf.tweety.lp.asp.syntax.ASPOperator.AggregateFunction
- counterarguments() - Method in class net.sf.tweety.arg.delp.TestQueries
- countering() - Method in class net.sf.tweety.arg.delp.TestArguments
- COUNTERTRANSITIVITY - Static variable in class net.sf.tweety.arg.rankings.postulates.RankingPostulate
-
The COUNTERTRANSITIVITY postulate
- CountingExample() - Static method in class net.sf.tweety.arg.rankings.examples.RaPostulateExample
- CountingRankingReasoner - Class in net.sf.tweety.arg.rankings.reasoner
-
This class implements the argument ranking approach of [Pu, Zhang, G.Luo, J.Luo.
- CountingRankingReasoner() - Constructor for class net.sf.tweety.arg.rankings.reasoner.CountingRankingReasoner
-
Create a new CountingRankingReasoner with default parameters.
- CountingRankingReasoner(double) - Constructor for class net.sf.tweety.arg.rankings.reasoner.CountingRankingReasoner
-
Create a new CountingRankingReasoner with the given parameters.
- CountingRankingReasoner(double, double) - Constructor for class net.sf.tweety.arg.rankings.reasoner.CountingRankingReasoner
-
Create a new CountingRankingReasoner with the given parameters.
- CountingUtilityFunction - Class in net.sf.tweety.agents.dialogues.structured
-
This class represents a counting utility function, i.e.
- CountingUtilityFunction(Collection<? extends Proposition>) - Constructor for class net.sf.tweety.agents.dialogues.structured.CountingUtilityFunction
-
Creates a new counting utility function for the given focal set.
- CParser - Class in net.sf.tweety.action.description.parser
-
This class implements a parser for an Action Description in C.
- CParser() - Constructor for class net.sf.tweety.action.description.parser.CParser
- CReasoner - Class in net.sf.tweety.logics.cl.reasoner
-
This class models a c-reasoner for conditional logic.
- CReasoner() - Constructor for class net.sf.tweety.logics.cl.reasoner.CReasoner
- CReasonerExample - Class in net.sf.tweety.logics.cl.examples
- CReasonerExample() - Constructor for class net.sf.tweety.logics.cl.examples.CReasonerExample
- create(String) - Static method in enum net.sf.tweety.arg.delp.semantics.ComparisonCriterion.Factory
- createConstraintMatrix(PclBeliefSet, Set<PossibleWorld>) - Static method in class net.sf.tweety.logics.pcl.util.OjAlgoPclUtils
-
Create constraint matrix for a set of PCL conditionals over a set of possible worlds.
- createConstraintSatProb1() - Static method in class net.sf.tweety.math.examples.ApacheCommonsCMAESOptimizerEx
- createConstraintSatProb1() - Static method in class net.sf.tweety.math.examples.ApacheCommonsNonLinearConjugateGradientOptimizerEx
- createConstraintSatProb1() - Static method in class net.sf.tweety.math.examples.ApacheCommonsSimplexEx
- createConstraintSatProb1() - Static method in class net.sf.tweety.math.examples.ApacheCommonsSimplexEx2
- createConstraintSatProb1() - Static method in class net.sf.tweety.math.examples.BfgsSolverEx
- createConstraintSatProb1() - Static method in class net.sf.tweety.math.examples.GlpkSolverEx
- createConstraintSatProb1() - Static method in class net.sf.tweety.math.examples.GradientDescentSolverEx
- createConstraintSatProb1() - Static method in class net.sf.tweety.math.examples.HessianGradientSolverEx
- createConstraintSatProb1() - Static method in class net.sf.tweety.math.examples.LagrangeSolverEx
- createConstraintSatProb1() - Static method in class net.sf.tweety.math.examples.LagrangeSolverEx2
- createConstraintSatProb1() - Static method in class net.sf.tweety.math.examples.LpSolverEx
- createConstraintSatProb1() - Static method in class net.sf.tweety.math.examples.OctaveSqpSolverEx
- createConstraintSatProb1() - Static method in class net.sf.tweety.math.examples.SimpleGeneticOptimizationSolverEx
- createConstraintSatProb1() - Static method in class net.sf.tweety.math.examples.SimulatedAnnealingOnConstrProbEx2
- createConstraintSatProb1() - Static method in class net.sf.tweety.math.examples.TabuSearchOnConstrProbEx
- createDifference(ArrayList<ElementOfCombinatoricsProb>) - Method in class net.sf.tweety.math.opt.problem.CombinatoricsProblem
- createEmptyFormula() - Method in class net.sf.tweety.arg.dung.ldo.syntax.LdoConjunction
- createEmptyFormula() - Method in class net.sf.tweety.arg.dung.ldo.syntax.LdoDisjunction
- createEmptyFormula() - Method in interface net.sf.tweety.logics.commons.syntax.AssociativeFormulaSupport.AssociativeSupportBridge
- createEmptyFormula() - Method in class net.sf.tweety.logics.dl.syntax.Intersection
- createEmptyFormula() - Method in class net.sf.tweety.logics.dl.syntax.Union
- createEmptyFormula() - Method in class net.sf.tweety.logics.fol.syntax.Conjunction
- createEmptyFormula() - Method in class net.sf.tweety.logics.fol.syntax.Disjunction
- createEmptyFormula() - Method in class net.sf.tweety.logics.fol.syntax.ExclusiveDisjunction
- createEmptyFormula() - Method in class net.sf.tweety.logics.pl.syntax.Conjunction
- createEmptyFormula() - Method in class net.sf.tweety.logics.pl.syntax.Disjunction
- createEmptyFormula() - Method in class net.sf.tweety.logics.pl.syntax.ExclusiveDisjunction
- createEmptyFormula() - Method in class net.sf.tweety.lp.asp.syntax.ASPHead
- createEmptySignature() - Method in class net.sf.tweety.arg.dung.ldo.syntax.LdoAssociativeFormula
- createEmptySignature() - Method in interface net.sf.tweety.logics.commons.syntax.AssociativeFormulaSupport.AssociativeSupportBridge
- createEmptySignature() - Method in class net.sf.tweety.logics.dl.syntax.AssociativeDlFormula
- createEmptySignature() - Method in class net.sf.tweety.logics.fol.syntax.AssociativeFolFormula
- createEmptySignature() - Method in class net.sf.tweety.logics.pl.syntax.AssociativePlFormula
- createEmptySignature() - Method in class net.sf.tweety.lp.asp.syntax.ASPHead
- createRandomNewSolution(ArrayList<ElementOfCombinatoricsProb>) - Method in class net.sf.tweety.math.examples.KnapSack
- createRandomNewSolution(ArrayList<ElementOfCombinatoricsProb>) - Method in class net.sf.tweety.math.examples.TravelingSalesman
- createRandomNewSolution(ArrayList<ElementOfCombinatoricsProb>) - Method in class net.sf.tweety.math.opt.problem.CombinatoricsProblem
- createState() - Method in class net.sf.tweety.arg.adf.sat.IncrementalSatSolver
- createState() - Method in class net.sf.tweety.arg.adf.sat.NativeLingelingSolver
- createState() - Method in class net.sf.tweety.arg.adf.sat.NativeMinisatSolver
- createState() - Method in class net.sf.tweety.arg.adf.sat.NativePicosatSolver
- createState() - Method in class net.sf.tweety.arg.adf.sat.SimpleIncrementalSatSolver
- createVariables(int) - Static method in class net.sf.tweety.logics.pcl.util.OjAlgoPclUtils
-
Create (non-negative) variables for the probabilities of possible worlds.
- createWithNullArg() - Method in class net.sf.tweety.arg.delp.TestDTree
- createWithNullConclusion1() - Method in class net.sf.tweety.arg.delp.TestArguments
- createWithNullConclusion2() - Method in class net.sf.tweety.arg.delp.TestArguments
- creation() - Method in class net.sf.tweety.arg.delp.TestDTree
- creation() - Method in class net.sf.tweety.logics.pl.test.TestNicePossibleWorld
- creationFailure() - Method in class net.sf.tweety.logics.pl.test.TestNicePossibleWorld
- CredibilityCategorizer - Class in 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<PlFormula>>, Order<Agent>) - Constructor for class net.sf.tweety.beliefdynamics.mas.CredibilityCategorizer
-
Creates a new credibility categorizer that is guided by the giving information which agents uttered the formulas and the credibility order.
- 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 - Class in net.sf.tweety.lp.asp.beliefdynamics.revision
-
Implements the credibility revision approach for ASP described in Kruempelmann et al.
- CredibilityRevision() - Constructor for class net.sf.tweety.beliefdynamics.CredibilityRevision
- CredibilityRevision() - Constructor for class net.sf.tweety.lp.asp.beliefdynamics.revision.CredibilityRevision
-
Default Ctor: Do not forget to set the solver
- CredibilityRevision(ASPSolver) - Constructor for class net.sf.tweety.lp.asp.beliefdynamics.revision.CredibilityRevision
-
Ctor: setting the solver at construction time
- CredibilityRevision(ASPSolver, int) - Constructor for class net.sf.tweety.lp.asp.beliefdynamics.revision.CredibilityRevision
- CredibilityRevision.AnswersetProcessing - Interface in 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 - Class in 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() - Constructor for class net.sf.tweety.beliefdynamics.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() - Constructor for class net.sf.tweety.beliefdynamics.CredibilityRevisionNonIterative
- CredibilityTest - Class in net.sf.tweety.lp.asp.beliefdynamics.revision
-
Tests the revision method described in Kruempelmann et al.
- CredibilityTest() - Constructor for class net.sf.tweety.lp.asp.beliefdynamics.revision.CredibilityTest
- CREDULOUS - net.sf.tweety.commons.InferenceMode
- CriterionOptionHandler - Class in net.sf.tweety.arg.delp.semantics
- CriterionOptionHandler(CmdLineParser, OptionDef, Setter<? super ComparisonCriterion>) - Constructor for class net.sf.tweety.arg.delp.semantics.CriterionOptionHandler
- CrMasArgumentativeRevisionOperator - Class in 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() - Constructor for class net.sf.tweety.beliefdynamics.operators.CrMasArgumentativeRevisionOperator
- CrMasBeliefSet<T extends Formula,S extends Signature> - Class in net.sf.tweety.beliefdynamics.mas
-
This class represents belief sets for credibility-based agents multi-agent systems.
- CrMasBeliefSet(Order<Agent>, S) - Constructor for class net.sf.tweety.beliefdynamics.mas.CrMasBeliefSet
-
Creates a new belief set with the given credibility order.
- CrMasExample - Class in net.sf.tweety.beliefdynamics.examples
-
Example code on using belief operators in multi-agent settings.
- CrMasExample() - Constructor for class net.sf.tweety.beliefdynamics.examples.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>) - Constructor for class net.sf.tweety.beliefdynamics.mas.CrMasRevisionWrapper
-
Creates a new revision with the given wrapped revision.
- CrMasSimpleRevisionOperator - Class in 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() - Constructor for class net.sf.tweety.beliefdynamics.operators.CrMasSimpleRevisionOperator
- CrossValidator<S extends Observation,T extends Category> - Class in net.sf.tweety.machinelearning
-
Performs cross-validation in a classifier, i.e.
- CrossValidator(int) - Constructor for class net.sf.tweety.machinelearning.CrossValidator
-
Creates a new cross-validator with the given number of partitions.
- CSP - net.sf.tweety.logics.pl.analysis.InconsistencyMeasureFactory.Measure
- 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(MusEnumerator<S>, Solver) - Constructor for class net.sf.tweety.logics.commons.analysis.CspInconsistencyMeasure
-
Creates a new measure that uses the given MUS enumerator and Integer programming solver.
- CspInconsistencyMeasure(SimpleFunction<Double, Double>, MusEnumerator<S>, Solver) - Constructor for class net.sf.tweety.logics.commons.analysis.CspInconsistencyMeasure
-
Creates a new measure that uses the given measure function, MUS enumerator, and Integer programming solver
- CspInconsistencyMeasureTest - Class in net.sf.tweety.logics.pl.test
- CspInconsistencyMeasureTest() - Constructor for class net.sf.tweety.logics.pl.test.CspInconsistencyMeasureTest
- csvDisplay() - Method in class net.sf.tweety.agents.sim.SimulationResult
-
Returns a CSV representation of the result.
- CTransitionSystemCalculator - Class in 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(ASPSolver) - Constructor for class net.sf.tweety.action.description.reasoner.CTransitionSystemCalculator
-
Creates a new transition system calculator with the given interface to an answer set solver.
- culpabilityMeasure(PclBeliefSet, ProbabilisticConditional) - Method in class net.sf.tweety.logics.pcl.analysis.MeanDistanceCulpabilityMeasure
- culpabilityMeasure(PclBeliefSet, ProbabilisticConditional) - Method in interface net.sf.tweety.logics.pcl.analysis.SignedCulpabilityMeasure
- culpabilityMeasure(T, S) - Method in interface net.sf.tweety.logics.commons.analysis.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) - Method in class net.sf.tweety.logics.commons.analysis.ShapleyCulpabilityMeasure
- 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.
- CURLY_CLOSE - Static variable in interface net.sf.tweety.lp.asp.parser.ASPCore2Constants
-
RegularExpression Id.
- CURLY_CLOSE - Static variable in interface net.sf.tweety.lp.asp.parser.ASPCore2ParserConstants
-
RegularExpression Id.
- CURLY_OPEN - Static variable in interface net.sf.tweety.lp.asp.parser.ASPCore2Constants
-
RegularExpression Id.
- CURLY_OPEN - Static variable in interface net.sf.tweety.lp.asp.parser.ASPCore2ParserConstants
-
RegularExpression Id.
- currentToken - Variable in exception net.sf.tweety.arg.delp.parser.ParseException
-
This is the last token that has been consumed successfully.
- currentToken - Variable in exception net.sf.tweety.logics.rpcl.parser.rpclcondensedprobabilitydistributionparser.ParseException
-
This is the last token that has been consumed successfully.
- currentToken - Variable in exception net.sf.tweety.logics.rpcl.parser.rpclprobabilitydistributionparser.ParseException
-
This is the last token that has been consumed successfully.
- currentToken - Variable in exception net.sf.tweety.lp.asp.parser.ParseException
-
This is the last token that has been consumed successfully.
- currentToken - Variable in exception net.sf.tweety.preferences.io.ParseException
- CustomStringListCommandParameter - Class in 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) - Constructor for class net.sf.tweety.plugin.parameter.CustomStringListCommandParameter
-
constructor for the custom string list parameter with id and description
- CustomStringListCommandParameter(String, String, String) - Constructor for class net.sf.tweety.plugin.parameter.CustomStringListCommandParameter
-
constructor for the custom string list parameter with id, description and criteria
- cycleCountExample1() - Method in class net.sf.tweety.arg.dung.GraphStructureInconsistencyMeasure
- cycleCountExample2() - Method in class net.sf.tweety.arg.dung.GraphStructureInconsistencyMeasure
- cycleCountExample3() - Method in class net.sf.tweety.arg.dung.GraphStructureInconsistencyMeasure
- cycleCountExample4() - Method in class net.sf.tweety.arg.dung.GraphStructureInconsistencyMeasure
- cycleCountExample5() - Method in class net.sf.tweety.arg.dung.GraphStructureInconsistencyMeasure
- CycleCountInconsistencyMeasure<T extends DungTheory> - Class in net.sf.tweety.arg.dung.analysis
- CycleCountInconsistencyMeasure() - Constructor for class net.sf.tweety.arg.dung.analysis.CycleCountInconsistencyMeasure
- cycleCountWorksWithTwoComponents() - Method in class net.sf.tweety.arg.dung.GraphStructureInconsistencyMeasure
- CygwinShell - Class in net.sf.tweety.commons.util
-
Cygwin shell.
All Classes All Packages