| Package | Description |
|---|---|
| net.sf.tweety.logics.commons.syntax | |
| net.sf.tweety.logics.commons.syntax.interfaces |
| Modifier and Type | Class and Description |
|---|---|
class |
Constant
A Constant represents an constant object in the world of
a logical language.
|
class |
FunctionalTerm
A functional term in a logic language, i.e.
|
class |
NumberTerm
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 |
StringTerm
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 |
Variable
A Variable is a placeholder for Constants in a generic formula of
a logic language.
|
| Modifier and Type | Method and Description |
|---|---|
<C extends Term<?>> |
RelationalFormula.containsTermsOfType(Class<C> cls) |
<C extends Term<?>> |
TermAdapter.containsTermsOfType(Class<C> cls) |
<C extends Term<?>> |
ComplexLogicalFormulaAdapter.containsTermsOfType(Class<C> cls) |
<C extends Term<?>> |
Sort.containsTermsOfType(Class<C> cls) |
<C extends Term<?>> |
TermAdapter.getTerms(Class<C> cls) |
<C extends Term<?>> |
FunctionalTerm.getTerms(Class<C> cls) |
<C extends Term<?>> |
QuantifiedFormulaSupport.getTerms(Class<C> cls) |
<C extends Term<?>> |
ComplexLogicalFormulaAdapter.getTerms(Class<C> cls) |
<C extends Term<?>> |
Sort.getTerms(Class<C> cls) |
<C extends Term<?>> |
AssociativeFormulaSupport.getTerms(Class<C> cls) |
| Modifier and Type | Method and Description |
|---|---|
Term<?> |
TermAdapter.substitute(Term<?> v,
Term<?> t) |
Term<?> |
FunctionalTerm.substitute(Term<?> v,
Term<?> t) |
| Modifier and Type | Method and Description |
|---|---|
Set<Map<Variable,Term<?>>> |
RelationalFormula.allSubstitutions(Collection<? extends Term<?>> terms)
Computes all possible substitutions, i.e.
|
List<Term<?>> |
FunctionalTerm.getArguments() |
Set<Term<?>> |
TermAdapter.getTerms() |
Set<Term<?>> |
FunctionalTerm.getTerms() |
Set<Term<?>> |
QuantifiedFormulaSupport.getTerms() |
Set<Term<?>> |
Sort.getTerms() |
Set<Term<?>> |
AssociativeFormulaSupport.getTerms() |
static Map<Sort,Set<Term<?>>> |
Sort.sortTerms(Collection<? extends Term<?>> terms)
Sorts the set of given terms by their sorts, i.e.
|
| Modifier and Type | Method and Description |
|---|---|
void |
Sort.add(Term<?> term)
Adds the given term to this sort.
|
FunctionalTerm |
FunctionalTerm.addArgument(Term<?> term)
Appends the given argument to this term's
arguments and returns itself.
|
RelationalFormula |
RelationalFormula.exchange(Term<?> v,
Term<?> t)
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.
|
RelationalFormula |
RelationalFormula.exchange(Term<?> v,
Term<?> t)
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 |
ComplexLogicalFormulaAdapter.exchange(Term<?> v,
Term<?> t) |
ComplexLogicalFormula |
ComplexLogicalFormulaAdapter.exchange(Term<?> v,
Term<?> t) |
boolean |
Sort.remove(Term<?> term)
Removes the given term from this sort.
|
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.
|
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) |
Term<?> |
TermAdapter.substitute(Term<?> v,
Term<?> t) |
Term<?> |
FunctionalTerm.substitute(Term<?> v,
Term<?> t) |
Term<?> |
FunctionalTerm.substitute(Term<?> v,
Term<?> t) |
ComplexLogicalFormula |
AssociativeFormulaSupport.substitute(Term<?> v,
Term<?> t) |
ComplexLogicalFormula |
AssociativeFormulaSupport.substitute(Term<?> v,
Term<?> t) |
| Modifier and Type | Method and Description |
|---|---|
Set<Map<Variable,Term<?>>> |
RelationalFormula.allSubstitutions(Collection<? extends Term<?>> terms)
Computes all possible substitutions, i.e.
|
static Map<Sort,Set<Term<?>>> |
Sort.sortTerms(Collection<? extends Term<?>> terms)
Sorts the set of given terms by their sorts, i.e.
|
RelationalFormula |
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 |
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. |
ComplexLogicalFormula |
ComplexLogicalFormulaAdapter.substitute(Map<? extends Term<?>,? extends Term<?>> map) |
ComplexLogicalFormula |
ComplexLogicalFormulaAdapter.substitute(Map<? extends Term<?>,? extends Term<?>> map) |
| Constructor and Description |
|---|
FunctionalTerm(Functor functor,
Term<?>... terms) |
| Constructor and Description |
|---|
FunctionalTerm(Functor functor,
List<Term<?>> arguments)
Creates a new functional term with the given functor and the given list
of arguments.
|
| Modifier and Type | Method and Description |
|---|---|
<C extends Term<?>> |
LogicStructure.containsTermsOfType(Class<C> cls)
Checks if this logical structure contains at least one term of type C.
|
<C extends Term<?>> |
LogicStructure.getTerms(Class<C> cls)
Processes the set containing all terms of type C.
|
| Modifier and Type | Method and Description |
|---|---|
Term<?> |
Term.clone()
Creates a deep copy of the term
|
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 Type | Method and Description |
|---|---|
List<? extends Term<?>> |
Atom.getArguments() |
Set<Term<?>> |
LogicStructure.getTerms() |
| Modifier and Type | Method and Description |
|---|---|
void |
Atom.addArgument(Term<?> arg)
Adds an argument to the atom's argument list
|
LogicProgram<?,?,?> |
LogicProgram.exchange(Term<?> v,
Term<?> t)
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.
|
LogicProgram<?,?,?> |
LogicProgram.exchange(Term<?> v,
Term<?> t)
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 |
ComplexLogicalFormula.exchange(Term<?> v,
Term<?> t)
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 |
ComplexLogicalFormula.exchange(Term<?> v,
Term<?> t)
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.
|
Term<?> |
Term.substitute(Term<?> v,
Term<?> t)
Substitutes all occurrences of term "v" in this term
by term "t" and returns the new term.
|
Term<?> |
Term.substitute(Term<?> v,
Term<?> t)
Substitutes all occurrences of term "v" in this term
by term "t" and returns the new term.
|
LogicProgram<?,?,?> |
LogicProgram.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.
|
ComplexLogicalFormula |
ComplexLogicalFormula.substitute(Term<?> v,
Term<?> t)
Substitutes all occurrences of term "v" in this formula
by term "t" and returns the new formula.
|
ComplexLogicalFormula |
ComplexLogicalFormula.substitute(Term<?> v,
Term<?> t)
Substitutes all occurrences of term "v" in this formula
by term "t" and returns the new formula.
|
| Modifier and Type | Method and Description |
|---|---|
static Atom.RETURN_SET_PREDICATE |
Atom.AtomImpl.implSetPredicate(Predicate old,
Predicate newer,
List<Term<?>> arguments) |
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.
|
ComplexLogicalFormula |
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.
|
ComplexLogicalFormula |
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.
|
Copyright © 2018. All rights reserved.