Uses of Interface
org.tweetyproject.logics.commons.syntax.interfaces.Term
Package
Description
-
Uses of Term in org.tweetyproject.action.query.syntax
Modifier and TypeMethodDescriptionAlwaysQuery.substitute
(Map<? extends Term<?>, ? extends Term<?>> map) AlwaysQuery.substitute
(Map<? extends Term<?>, ? extends Term<?>> map) HoldsQuery.substitute
(Map<? extends Term<?>, ? extends Term<?>> map) HoldsQuery.substitute
(Map<? extends Term<?>, ? extends Term<?>> map) NecessarilyQuery.substitute
(Map<? extends Term<?>, ? extends Term<?>> map) NecessarilyQuery.substitute
(Map<? extends Term<?>, ? extends Term<?>> map) abstract QueryProposition
QueryProposition.substitute
(Map<? extends Term<?>, ? extends Term<?>> map) Returns a new query proposition of the same type, in which all variables in inner formulas and actions are replaced according to the given map.abstract QueryProposition
QueryProposition.substitute
(Map<? extends Term<?>, ? extends Term<?>> map) Returns a new query proposition of the same type, in which all variables in inner formulas and actions are replaced according to the given map. -
Uses of Term in org.tweetyproject.action.signature
Modifier and TypeMethodDescriptionFolAction.substitute
(Map<? extends Term<?>, ? extends Term<?>> map) Substitutes terms in all non-zero-arity atoms in this action according to the given map.FolAction.substitute
(Map<? extends Term<?>, ? extends Term<?>> map) Substitutes terms in all non-zero-arity atoms in this action according to the given map. -
Uses of Term in org.tweetyproject.arg.aba.syntax
Modifier and TypeMethodDescription<C extends Term<?>>
booleanAbaElement.containsTermsOfType
(Class<C> cls) Modifier and TypeMethodDescriptionAbaElement.allSubstitutions
(Collection<? extends Term<?>> terms) Computes all possible substitutions, i.e.Assumption.getTerms()
InferenceRule.getTerms()
Negation.getTerms()
Modifier and TypeMethodDescriptionabstract AbaElement
<T> AbaElement.substitute
(Term<?> v, Term<?> t) Assumption.substitute
(Term<?> v, Term<?> t) InferenceRule.substitute
(Term<?> v, Term<?> t) Negation.substitute
(Term<?> v, Term<?> t) Modifier and TypeMethodDescriptionAbaElement.allSubstitutions
(Collection<? extends Term<?>> terms) Computes all possible substitutions, i.e.AbaElement.substitute
(Map<? extends Term<?>, ? extends Term<?>> map) AbaElement.substitute
(Map<? extends Term<?>, ? extends Term<?>> map) -
Uses of Term in org.tweetyproject.arg.aspic.syntax
Modifier and TypeMethodDescription<C extends Term<?>>
booleanInferenceRule.containsTermsOfType
(Class<C> cls) Modifier and TypeMethodDescriptionInferenceRule.allSubstitutions
(Collection<? extends Term<?>> terms) Computes all possible substitutions, i.e.InferenceRule.getTerms()
Modifier and TypeMethodDescriptionDefeasibleInferenceRule.substitute
(Term<?> v, Term<?> t) abstract InferenceRule
<T> InferenceRule.substitute
(Term<?> v, Term<?> t) StrictInferenceRule.substitute
(Term<?> v, Term<?> t) Modifier and TypeMethodDescriptionInferenceRule.allSubstitutions
(Collection<? extends Term<?>> terms) Computes all possible substitutions, i.e.InferenceRule.substitute
(Map<? extends Term<?>, ? extends Term<?>> map) InferenceRule.substitute
(Map<? extends Term<?>, ? extends Term<?>> map) -
Uses of Term in org.tweetyproject.arg.delp.parser
Modifier and TypeMethodDescriptionfinal Term
DelpParser.Term
(DefeasibleLogicProgram delp, FolSignature signature) Parses a term (either a variable or a constant) from the input. -
Uses of Term in org.tweetyproject.arg.delp.syntax
Modifier and TypeMethodDescriptionDefeasibleRule.substitute
(Term<?> v, Term<?> t) DelpFact.substitute
(Term<?> v, Term<?> t) abstract RelationalFormula
DelpRule.substitute
(Term<?> v, Term<?> t) StrictRule.substitute
(Term<?> v, Term<?> t) -
Uses of Term in org.tweetyproject.arg.dung.ldo.syntax
-
Uses of Term in org.tweetyproject.logics.commons.syntax
Modifier and TypeClassDescriptionclass
A Constant represents an constant object in the world of a logical language.class
A functional term in a logic language, i.e.class
This is a term representing an integer number it is used to distinguish between objects like an auto a which is modeled as constant and integral numbers like 42.class
This class represents terms which are objects identified by a string.class
TermAdapter<T>
Abstract base class implementing the substitute(), getSort(), getTerms(), and containsTermsOfType() methods in a way it is useful for terms.class
A Variable is a placeholder for Constants in a generic formula of a logic language.Modifier and TypeMethodDescription<C extends Term<?>>
booleanComplexLogicalFormulaAdapter.containsTermsOfType
(Class<C> cls) <C extends Term<?>>
booleanRelationalFormula.containsTermsOfType
(Class<C> cls) <C extends Term<?>>
booleanSort.containsTermsOfType
(Class<C> cls) <C extends Term<?>>
booleanTermAdapter.containsTermsOfType
(Class<C> cls) Returns the set of terms of a specified type used in the inner formula.Modifier and TypeMethodDescriptionTerm
<?> FunctionalTerm.substitute
(Term<?> v, Term<?> t) Term
<?> TermAdapter.substitute
(Term<?> v, Term<?> t) Modifier and TypeMethodDescriptionRelationalFormula.allSubstitutions
(Collection<? extends Term<?>> terms) Computes all possible substitutions, i.e.FunctionalTerm.getArguments()
Returns an unmodifiable view of the list of arguments for thisFunctionalTerm
.AssociativeFormulaSupport.getTerms()
FunctionalTerm.getTerms()
QuantifiedFormulaSupport.getTerms()
Returns the set of terms used in the inner formula.Sort.getTerms()
TermAdapter.getTerms()
Sort.sortTerms
(Collection<? extends Term<?>> terms) Sorts the set of given terms by their sorts, i.e.Modifier and TypeMethodDescriptionvoid
Adds the given term to this sort.FunctionalTerm.addArgument
(Term<?> term) Appends the given argument to this term's arguments and returns itself.Substitutes all occurrences of term "v" in this formula by term "t" and at the same time replaces all occurrences of term "t" by term "v" and eventually returns the new formula.boolean
Removes the given term from this sort.AssociativeFormulaSupport.substitute
(Term<?> v, Term<?> t) Term
<?> FunctionalTerm.substitute
(Term<?> v, Term<?> t) abstract RelationalFormula
RelationalFormula.substitute
(Term<?> v, Term<?> t) Substitutes all occurrences of term "v" in this formula by term "t" and returns the new formula.Term
<?> TermAdapter.substitute
(Term<?> v, Term<?> t) Modifier and TypeMethodDescriptionRelationalFormula.allSubstitutions
(Collection<? extends Term<?>> terms) Computes all possible substitutions, i.e.Sort.sortTerms
(Collection<? extends Term<?>> terms) Sorts the set of given terms by their sorts, i.e.ComplexLogicalFormulaAdapter.substitute
(Map<? extends Term<?>, ? extends Term<?>> map) ComplexLogicalFormulaAdapter.substitute
(Map<? extends Term<?>, ? extends Term<?>> map) RelationalFormula.substitute
(Map<? extends Term<?>, ? extends Term<?>> map) Substitutes all occurrences of all terms "v" in map.keyset() in this formula by map.get(v) and returns the new formula.
NOTE: variables bound to quantifiers are not substituted in their inner formulas even if they appear in the map.RelationalFormula.substitute
(Map<? extends Term<?>, ? extends Term<?>> map) Substitutes all occurrences of all terms "v" in map.keyset() in this formula by map.get(v) and returns the new formula.
NOTE: variables bound to quantifiers are not substituted in their inner formulas even if they appear in the map.ModifierConstructorDescriptionFunctionalTerm
(Functor functor, Term<?>... terms) Constructs a newFunctionalTerm
with the specified functor and arguments.ModifierConstructorDescriptionFunctionalTerm
(Functor functor, List<Term<?>> arguments) Creates a new functional term with the given functor and the given list of arguments. -
Uses of Term in org.tweetyproject.logics.commons.syntax.interfaces
Modifier and TypeMethodDescription<C extends Term<?>>
booleanLogicStructure.containsTermsOfType
(Class<C> cls) Checks if this logical structure contains at least one term of type C.Processes the set containing all terms of type C.Modifier and TypeMethodDescriptionTerm
<?> Term.clone()
Creates a deep copy of the termTerm
<?> Term.substitute
(Term<?> v, Term<?> t) Substitutes all occurrences of term "v" in this term by term "t" and returns the new term.Modifier and TypeMethodDescriptionvoid
Atom.addArgument
(Term<?> arg) Adds an argument to the atom's argument listSubstitutes all occurrences of term "v" in this formula by term "t" and at the same time replaces all occurrences of term "t" by term "v" and eventually returns the new formula.LogicProgram
<?, ?, ?> Substitutes all occurrences of term "v" in this formula by term "t" and at the same time replaces all occurrences of term "t" by term "v" and eventually returns the new formula.ComplexLogicalFormula.substitute
(Term<?> v, Term<?> t) Substitutes all occurrences of term "v" in this formula by term "t" and returns the new formula.LogicProgram
<?, ?, ?> LogicProgram.substitute
(Term<?> v, Term<?> t) Substitutes all occurrences of term "v" in this formula by term "t" and returns the new formula.Term
<?> Term.substitute
(Term<?> v, Term<?> t) Substitutes all occurrences of term "v" in this term by term "t" and returns the new term.Modifier and TypeMethodDescriptionstatic Atom.RETURN_SET_PREDICATE
Atom.AtomImpl.implSetPredicate
(Predicate old, Predicate newer, List<Term<?>> arguments) Return set predicateComplexLogicalFormula.substitute
(Map<? extends Term<?>, ? extends Term<?>> map) Substitutes all occurrences of all terms "v" in map.keyset() in this formula by map.get(v) and returns the new formula.ComplexLogicalFormula.substitute
(Map<? extends Term<?>, ? extends Term<?>> map) Substitutes all occurrences of all terms "v" in map.keyset() in this formula by map.get(v) and returns the new formula.LogicProgram
<?, ?, ?> LogicProgram.substitute
(Map<? extends Term<?>, ? extends Term<?>> map) Substitutes all occurrences of all terms "v" in map.keyset() in this formula by map.get(v) and returns the new formula.LogicProgram
<?, ?, ?> LogicProgram.substitute
(Map<? extends Term<?>, ? extends Term<?>> map) Substitutes all occurrences of all terms "v" in map.keyset() in this formula by map.get(v) and returns the new formula. -
Uses of Term in org.tweetyproject.logics.dl.syntax
Modifier and TypeClassDescriptionclass
This class models an individual in description logic, also known as an object. -
Uses of Term in org.tweetyproject.logics.fol.semantics
Modifier and TypeMethodDescriptionSubstitutes every occurrence of "t1" by "t2" and vice versa and returns the new interpretation.Modifier and TypeMethodDescriptionFor every mapping t1 -> t2, this method substitutes every occurrence of "t1" by "t2" and vice versa and returns the new interpretationFor every mapping t1 -> t2, this method substitutes every occurrence of "t1" by "t2" and vice versa and returns the new interpretation -
Uses of Term in org.tweetyproject.logics.fol.syntax
Modifier and TypeMethodDescriptionModifier and TypeMethodDescriptionFolAtom.getArguments()
AssociativeFolFormula.getTerms()
Equivalence.getTerms()
ExistsQuantifiedFormula.getTerms()
FolAtom.getTerms()
ForallQuantifiedFormula.getTerms()
Implication.getTerms()
Negation.getTerms()
SpecialFormula.getTerms()
Modifier and TypeMethodDescriptionvoid
FolAtom.addArgument
(Term<?> term) Appends the given argument to this atom's arguments and returns itself.AssociativeFolFormula.substitute
(Term<?> v, Term<?> t) Conjunction.substitute
(Term<?> v, Term<?> t) Equivalence.substitute
(Term<?> v, Term<?> t) ExistsQuantifiedFormula.substitute
(Term<?> v, Term<?> t) FolAtom.substitute
(Term<?> v, Term<?> t) abstract FolFormula
FolFormula.substitute
(Term<?> v, Term<?> t) ForallQuantifiedFormula.substitute
(Term<?> v, Term<?> t) Implication.substitute
(Term<?> v, Term<?> t) Negation.substitute
(Term<?> v, Term<?> t) SpecialFormula.substitute
(Term<?> v, Term<?> t) Modifier and TypeMethodDescriptionAssociativeFolFormula.substitute
(Map<? extends Term<?>, ? extends Term<?>> termMap) AssociativeFolFormula.substitute
(Map<? extends Term<?>, ? extends Term<?>> termMap) -
Uses of Term in org.tweetyproject.logics.ml.semantics
Modifier and TypeMethodDescriptionSubstitutes every occurrence of "t1" by "t2" and vice versa and returns the new interpretation.Modifier and TypeMethodDescriptionFor every mapping t1 -> t2, this method substitutes every occurrence of "t1" by "t2" and vice versa and returns the new interpretationFor every mapping t1 -> t2, this method substitutes every occurrence of "t1" by "t2" and vice versa and returns the new interpretation -
Uses of Term in org.tweetyproject.logics.ml.syntax
Modifier and TypeMethodDescriptionNecessity.substitute
(Term<?> v, Term<?> t) Possibility.substitute
(Term<?> v, Term<?> t) -
Uses of Term in org.tweetyproject.logics.mln.syntax
-
Uses of Term in org.tweetyproject.logics.pl.syntax
-
Uses of Term in org.tweetyproject.logics.rcl.syntax
Modifier and TypeMethodDescription -
Uses of Term in org.tweetyproject.logics.rdl.syntax
-
Uses of Term in org.tweetyproject.logics.rpcl.syntax
Modifier and TypeMethodDescriptionExchanges every occurence of "a" by "b" and vice versa.RelationalProbabilisticConditional.substitute
(Term<?> v, Term<?> t) -
Uses of Term in org.tweetyproject.lp.asp.parser
Modifier and TypeMethodDescriptionTerm
<?> InstantiateVisitor.visit
(ASTAriTerm node, Object data) Term
<?> -
Uses of Term in org.tweetyproject.lp.asp.syntax
Modifier and TypeClassDescriptionclass
This class represents an arithmetic term in the ASP-Core-2 format.Modifier and TypeMethodDescription<C extends Term<?>>
booleanASPElement.containsTermsOfType
(Class<C> cls) <C extends Term<?>>
booleanClassicalHead.containsTermsOfType
(Class<C> cls) Modifier and TypeMethodDescriptionTerm
<?> ArithmeticTerm.getLeft()
Return the left subterm of this arithmetic term.Term
<?> ComparativeAtom.getLeft()
Term
<?> AggregateAtom.getLeftGuard()
Get the left relation term (left guard).Term
<?> ChoiceHead.getLeftGuard()
Return the left guard (comparison term)Term
<?> ASPRule.getLevel()
Return the level attribute of this constraint.Term
<?> OptimizationElement.getLevel()
Return level (priority) of this optimization element.Term
<?> ArithmeticTerm.getRight()
Return the right subterm of this arithmetic term.Term
<?> ComparativeAtom.getRight()
Term
<?> AggregateAtom.getRightGuard()
Return the right relation term (right guard).Term
<?> ChoiceHead.getRightGuard()
Return the right guard (comparison term)Term
<?> ASPAtom.getTerm
(int i) Retrieves the term at the specified index from the list of arguments.Term
<?> ASPRule.getWeight()
Return the weight of this constraint.Term
<?> OptimizationElement.getWeight()
Return the weight of this optimization element.Modifier and TypeMethodDescriptionASPAtom.getArguments()
StrictNegation.getArguments()
ASPRule.getConstraintTerms()
Return the constraint terms of this rule.AggregateElement.getLeft()
Return the left part (the term tuple) of the Aggregate element.OptimizationElement.getOptTerms()
Return the term tuple of this optimization element.AggregateAtom.getTerms()
AggregateElement.getTerms()
AggregateHead.getTerms()
ASPAtom.getTerms()
ASPRule.getTerms()
ChoiceElement.getTerms()
ChoiceHead.getTerms()
ClassicalHead.getTerms()
ComparativeAtom.getTerms()
DefaultNegation.getTerms()
OptimizationElement.getTerms()
OptimizationStatement.getTerms()
StrictNegation.getTerms()
Modifier and TypeMethodDescriptionvoid
ASPAtom.addArgument
(Term<?> arg) void
StrictNegation.addArgument
(Term<?> arg) ASPAtom.cloneWithAddedTerm
(Term<?> term) abstract ASPLiteral
ASPLiteral.cloneWithAddedTerm
(Term<?> term) Creates a copy of the literal and adds the given term as argument to the end of the argument list.StrictNegation.cloneWithAddedTerm
(Term<?> term) void
AggregateAtom.setLeft
(Term<?> term, ASPOperator.BinaryOperator op) Set the left relation term and operator.void
AggregateAtom.setLeftGuard
(Term<?> relationTerm) Set the left relation term (left guard).void
ChoiceHead.setLeftGuard
(Term<?> leftTerm) Set the left guard (comparison term)void
Set the level attribute of this constraint.void
Sets the level (priority) of this optimization statement.void
AggregateAtom.setRight
(Term<?> term, ASPOperator.BinaryOperator op) Set the right relation term and operator.void
AggregateAtom.setRightGuard
(Term<?> relationTerm) Set the right relation term (right guard).void
ChoiceHead.setRightGuard
(Term<?> rightTerm) Set the right guard (comparison term)void
Set the weight attribute of this constraint.void
Sets the weight of this optimization statement.AggregateAtom.substitute
(Term<?> t, Term<?> v) AggregateElement.substitute
(Term<?> t, Term<?> v) AggregateHead.substitute
(Term<?> t, Term<?> v) ASPAtom.substitute
(Term<?> v, Term<?> t) abstract ASPBodyElement
ASPBodyElement.substitute
(Term<?> t, Term<?> v) abstract ASPElement
ASPElement.substitute
(Term<?> t, Term<?> v) ASPRule.substitute
(Term<?> v, Term<?> t) ChoiceElement.substitute
(Term<?> t, Term<?> v) ChoiceHead.substitute
(Term<?> t, Term<?> v) ClassicalHead.substitute
(Term<?> t, Term<?> v) ComparativeAtom.substitute
(Term<?> t, Term<?> v) DefaultNegation.substitute
(Term<?> t, Term<?> v) OptimizationElement.substitute
(Term<?> t, Term<?> v) OptimizationStatement.substitute
(Term<?> t, Term<?> v) Program.substitute
(Term<?> v, Term<?> t) StrictNegation.substitute
(Term<?> v, Term<?> t) Modifier and TypeMethodDescriptionvoid
ASPRule.setConstraintTerms
(List<Term<?>> constraintTerms) Settervoid
Sets the term tuple of the aggregate element.void
OptimizationElement.setOptTerms
(List<Term<?>> terms) Sets the term tuple of this optimization element.AggregateElement.substitute
(Map<? extends Term<?>, ? extends Term<?>> map) AggregateElement.substitute
(Map<? extends Term<?>, ? extends Term<?>> map) ASPElement.substitute
(Map<? extends Term<?>, ? extends Term<?>> map) ASPElement.substitute
(Map<? extends Term<?>, ? extends Term<?>> map) ClassicalHead.substitute
(Map<? extends Term<?>, ? extends Term<?>> map) ClassicalHead.substitute
(Map<? extends Term<?>, ? extends Term<?>> map) Program.substitute
(Map<? extends Term<?>, ? extends Term<?>> map) Program.substitute
(Map<? extends Term<?>, ? extends Term<?>> map) ModifierConstructorDescriptionAggregateAtom
(ASPOperator.AggregateFunction function, List<AggregateElement> elements, ASPOperator.BinaryOperator rightRelation, Term<?> rightBound) Creates a new Aggregate of the form "#func { elements } op rightBound" with the given aggregate function #func, the given aggregate elements, the given aggregate relation op and the given rightBound.AggregateAtom
(ASPOperator.AggregateFunction function, List<AggregateElement> elements, ASPOperator.BinaryOperator leftRelation, Term<?> leftBound, ASPOperator.BinaryOperator rightRelation, Term<?> rightBound) Creates a new Aggregate of the form "leftBound leftOp #func { elements } rightOp rightBound" with the given aggregate function, the given aggregate elements, and the given left and right aggregate relations and bounds.AggregateElement
(Term<?> term, List<ASPBodyElement> literals) Creates a new Aggregate Element with the given single term and the given list of naf literals.AggregateElement
(Term<?> term, ASPBodyElement literal) Creates a new Aggregate Element with the given single term and the given single literal.AggregateElement
(Term<?> term, ASPBodyElement... literals) Creates a new Aggregate Element with the given single term and the given naf literals.ArithmeticTerm
(Term<?> t) Creates an arithmetic term of the form '-(t)'ArithmeticTerm
(ASPOperator.ArithmeticOperator op, Term<?> t) Creates an arithmetic term of the form '-(t)'ArithmeticTerm
(ASPOperator.ArithmeticOperator op, Term<?> left, Term<?> right) Create a new arithmetic term with the given operator and left and right term.Creates an atom with the given predicate as name and the given terms as argumentCreates a new atom with the given predicate and terms.Creates a weak constraint with the given weight and terms.Creates a weak constraint with the given weight, level (priority) and terms.ChoiceHead
(List<ChoiceElement> elements, ASPOperator.BinaryOperator rightOp, Term<?> rightTerm) ChoiceHead
(List<ChoiceElement> elements, ASPOperator.BinaryOperator leftOp, Term<?> leftTerm, ASPOperator.BinaryOperator rightOp, Term<?> rightTerm) ChoiceHead
(ChoiceElement e, ASPOperator.BinaryOperator rightOp, Term<?> rightTerm) ComparativeAtom
(ASPOperator.BinaryOperator op, Term<?> left, Term<?> right) Create a new comparative atom with the given operator and left and right term.OptimizationElement
(Term<?> weight, int priority, List<Term<?>> terms, List<ASPBodyElement> literals) Creates a new optimization element with the given weight, priority, terms and literals.OptimizationElement
(Term<?> weight, List<Term<?>> terms, List<ASPBodyElement> literals) Creates a new optimization element with the given weight, terms and literals.OptimizationElement
(Term<?> weight, Term<?> priority, List<Term<?>> terms, List<ASPBodyElement> literals) Creates a new optimization element with the given weight, priority, terms and literals.OptimizationElement
(Term<?> weight, Term<?> term, ASPBodyElement literal) Creates a new optimization element with the given single weight, term and literal.OptimizationElement
(Term<?> term, ASPBodyElement literal) Creates a new optimization element with the given single term and literal.OptimizationStatement
(ASPOperator.OptimizeFunction function, Term<?> weight, int priority, List<Term<?>> terms, List<ASPBodyElement> literals) Creates a new OptimizatonStatement with the given function, weight, priority and single term-literal tuple.OptimizationStatement
(ASPOperator.OptimizeFunction function, Term<?> weight, List<Term<?>> terms, List<ASPBodyElement> literals) Creates a new OptimizatonStatement with the given function, weight and single term-literal tuple.ModifierConstructorDescriptionAggregateElement
(List<Term<?>> terms, List<ASPBodyElement> literals) Creates a new Aggregate Element with the given list of terms and the given list of naf literals.ArithmeticTerm
(Triple<ASPOperator.ArithmeticOperator, Term<?>, Term<?>> triple) Create a new arithmetic term based on the given triple of an arithmetic operator and two terms.ArithmeticTerm
(Triple<ASPOperator.ArithmeticOperator, Term<?>, Term<?>> triple) Create a new arithmetic term based on the given triple of an arithmetic operator and two terms.Creates a new atom with the given predicate and terms.OptimizationElement
(Term<?> weight, int priority, List<Term<?>> terms, List<ASPBodyElement> literals) Creates a new optimization element with the given weight, priority, terms and literals.OptimizationElement
(Term<?> weight, List<Term<?>> terms, List<ASPBodyElement> literals) Creates a new optimization element with the given weight, terms and literals.OptimizationElement
(Term<?> weight, Term<?> priority, List<Term<?>> terms, List<ASPBodyElement> literals) Creates a new optimization element with the given weight, priority, terms and literals.OptimizationStatement
(ASPOperator.OptimizeFunction function, Term<?> weight, int priority, List<Term<?>> terms, List<ASPBodyElement> literals) Creates a new OptimizatonStatement with the given function, weight, priority and single term-literal tuple.OptimizationStatement
(ASPOperator.OptimizeFunction function, Term<?> weight, List<Term<?>> terms, List<ASPBodyElement> literals) Creates a new OptimizatonStatement with the given function, weight and single term-literal tuple.StrictNegation
(Predicate p, List<Term<?>> terms) Creates a new negation with the given predicate and terms. -
Uses of Term in org.tweetyproject.lp.nlp.syntax
Modifier and TypeMethodDescriptionExchanges two terms in all rules of the nested logic program.NLPNot.substitute
(Term<?> v, Term<?> t) NLPProgram.substitute
(Term<?> t, Term<?> v) Substitutes a term in all rules of the nested logic program.NLPRule.substitute
(Term<?> v, Term<?> t) Modifier and TypeMethodDescriptionNLPProgram.substitute
(Map<? extends Term<?>, ? extends Term<?>> map) Substitutes multiple terms in all rules of the nested logic program according to the provided map.NLPProgram.substitute
(Map<? extends Term<?>, ? extends Term<?>> map) Substitutes multiple terms in all rules of the nested logic program according to the provided map.