public class FOLAtom extends FolFormula implements net.sf.tweety.logics.commons.syntax.interfaces.Atom
| Constructor and Description |
|---|
FOLAtom()
Default-Ctor: Creates new empty FOL-Atom
|
FOLAtom(FOLAtom other) |
FOLAtom(net.sf.tweety.logics.commons.syntax.Predicate predicate)
Creates a new atom with the given predicate and initializes
an empty argument list.
|
FOLAtom(net.sf.tweety.logics.commons.syntax.Predicate predicate,
List<? extends net.sf.tweety.logics.commons.syntax.interfaces.Term<?>> arguments)
Creates a new atom with the given predicate and list of
terms
|
FOLAtom(net.sf.tweety.logics.commons.syntax.Predicate predicate,
net.sf.tweety.logics.commons.syntax.interfaces.Term<?>... terms) |
| Modifier and Type | Method and Description |
|---|---|
void |
addArgument(net.sf.tweety.logics.commons.syntax.interfaces.Term<?> term)
Appends the given argument to this atom's
arguments and returns itself.
|
FOLAtom |
clone() |
FolFormula |
collapseAssociativeFormulas()
This method collapses all associative operations appearing
in this term, e.g.
|
boolean |
containsQuantifier() |
boolean |
equals(Object obj) |
List<net.sf.tweety.logics.commons.syntax.interfaces.Term<?>> |
getArguments() |
Set<FOLAtom> |
getAtoms() |
Set<net.sf.tweety.logics.commons.syntax.Functor> |
getFunctors() |
String |
getName() |
net.sf.tweety.logics.commons.syntax.Predicate |
getPredicate()
Returns the predicate of this atom
|
Set<net.sf.tweety.logics.commons.syntax.Predicate> |
getPredicates() |
Set<net.sf.tweety.logics.commons.syntax.interfaces.Term<?>> |
getTerms() |
<C extends net.sf.tweety.logics.commons.syntax.interfaces.Term<?>> |
getTerms(Class<C> cls) |
Set<net.sf.tweety.logics.commons.syntax.Variable> |
getUnboundVariables() |
int |
hashCode() |
boolean |
isClosed() |
boolean |
isClosed(Set<net.sf.tweety.logics.commons.syntax.Variable> boundVariables) |
boolean |
isComplete()
Checks whether this atom is complete, i.e.
|
boolean |
isDnf()
Checks whether this formula is in disjunctive normal form.
|
boolean |
isLiteral() |
boolean |
isWellBound() |
boolean |
isWellBound(Set<net.sf.tweety.logics.commons.syntax.Variable> boundVariables) |
net.sf.tweety.logics.commons.syntax.interfaces.Atom.RETURN_SET_PREDICATE |
setPredicate(net.sf.tweety.logics.commons.syntax.Predicate newer) |
FOLAtom |
substitute(net.sf.tweety.logics.commons.syntax.interfaces.Term<?> v,
net.sf.tweety.logics.commons.syntax.interfaces.Term<?> t) |
FolFormula |
toNnf()
Makes the negation normal form of this formula.
|
String |
toString() |
combineWithAnd, combineWithOr, complement, getQuantifierVariables, getSignature, getUniformProbability, toDnfallGroundInstances, allSubstitutions, containsTermsOfType, exchange, getFormula, getPredicateCls, getSatisfactionRatio, isGround, isWellFormed, substitutefinalize, getClass, notify, notifyAll, wait, wait, waitpublic FOLAtom()
public FOLAtom(net.sf.tweety.logics.commons.syntax.Predicate predicate)
predicate - the predicate of the atom.public FOLAtom(net.sf.tweety.logics.commons.syntax.Predicate predicate,
net.sf.tweety.logics.commons.syntax.interfaces.Term<?>... terms)
public FOLAtom(net.sf.tweety.logics.commons.syntax.Predicate predicate,
List<? extends net.sf.tweety.logics.commons.syntax.interfaces.Term<?>> arguments)
predicate - the predicate of the atomarguments - the arguments (terms) of the atompublic FOLAtom(FOLAtom other)
public void addArgument(net.sf.tweety.logics.commons.syntax.interfaces.Term<?> term)
throws IllegalArgumentException
addArgument in interface net.sf.tweety.logics.commons.syntax.interfaces.Atomterm - an argument to be addedIllegalArgumentException - if the given term does not correspond
to the expected sort or the argument list is complete.public FOLAtom substitute(net.sf.tweety.logics.commons.syntax.interfaces.Term<?> v, net.sf.tweety.logics.commons.syntax.interfaces.Term<?> t) throws IllegalArgumentException
substitute in interface net.sf.tweety.logics.commons.syntax.interfaces.ComplexLogicalFormulasubstitute in class FolFormulaIllegalArgumentExceptionpublic Set<FOLAtom> getAtoms()
getAtoms in interface net.sf.tweety.logics.commons.syntax.interfaces.SimpleLogicalFormulagetAtoms in class net.sf.tweety.logics.commons.syntax.RelationalFormulapublic boolean isComplete()
isComplete in interface net.sf.tweety.logics.commons.syntax.interfaces.Atompublic Set<net.sf.tweety.logics.commons.syntax.Variable> getUnboundVariables()
getUnboundVariables in interface net.sf.tweety.logics.commons.syntax.interfaces.QuantifiedFormulapublic Set<net.sf.tweety.logics.commons.syntax.Predicate> getPredicates()
getPredicates in interface net.sf.tweety.logics.commons.syntax.interfaces.SimpleLogicalFormulapublic Set<net.sf.tweety.logics.commons.syntax.Functor> getFunctors()
getFunctors in class net.sf.tweety.logics.commons.syntax.RelationalFormulapublic boolean isClosed()
isClosed in interface net.sf.tweety.logics.commons.syntax.interfaces.QuantifiedFormulapublic boolean isClosed(Set<net.sf.tweety.logics.commons.syntax.Variable> boundVariables)
isClosed in interface net.sf.tweety.logics.commons.syntax.interfaces.QuantifiedFormulapublic boolean isWellBound()
isWellBound in interface net.sf.tweety.logics.commons.syntax.interfaces.QuantifiedFormulapublic boolean isWellBound(Set<net.sf.tweety.logics.commons.syntax.Variable> boundVariables)
isWellBound in interface net.sf.tweety.logics.commons.syntax.interfaces.QuantifiedFormulapublic boolean containsQuantifier()
containsQuantifier in interface net.sf.tweety.logics.commons.syntax.interfaces.QuantifiedFormulapublic net.sf.tweety.logics.commons.syntax.Predicate getPredicate()
getPredicate in interface net.sf.tweety.logics.commons.syntax.interfaces.Atompublic List<net.sf.tweety.logics.commons.syntax.interfaces.Term<?>> getArguments()
getArguments in interface net.sf.tweety.logics.commons.syntax.interfaces.Atompublic boolean isDnf()
FolFormulaisDnf in class FolFormulapublic boolean isLiteral()
isLiteral in interface net.sf.tweety.logics.commons.syntax.interfaces.SimpleLogicalFormulapublic String toString()
toString in class net.sf.tweety.logics.commons.syntax.RelationalFormulapublic FolFormula toNnf()
FolFormulatoNnf in class FolFormulapublic FolFormula collapseAssociativeFormulas()
FolFormulacollapseAssociativeFormulas in class FolFormulapublic int hashCode()
public boolean equals(Object obj)
public Set<net.sf.tweety.logics.commons.syntax.interfaces.Term<?>> getTerms()
getTerms in interface net.sf.tweety.logics.commons.syntax.interfaces.LogicStructurepublic <C extends net.sf.tweety.logics.commons.syntax.interfaces.Term<?>> Set<C> getTerms(Class<C> cls)
getTerms in interface net.sf.tweety.logics.commons.syntax.interfaces.LogicStructurepublic FOLAtom clone()
clone in interface net.sf.tweety.logics.commons.syntax.interfaces.ComplexLogicalFormulaclone in interface net.sf.tweety.logics.commons.syntax.interfaces.SimpleLogicalFormulaclone in class FolFormulapublic net.sf.tweety.logics.commons.syntax.interfaces.Atom.RETURN_SET_PREDICATE setPredicate(net.sf.tweety.logics.commons.syntax.Predicate newer)
setPredicate in interface net.sf.tweety.logics.commons.syntax.interfaces.Atompublic String getName()
getName in interface net.sf.tweety.logics.commons.syntax.interfaces.AtomCopyright © 2018. All rights reserved.