public class Negation extends PropositionalFormula
| Constructor and Description |
|---|
Negation(PropositionalFormula formula)
Creates a new negation with the given formula.
|
| Modifier and Type | Method and Description |
|---|---|
PropositionalFormula |
clone() |
PropositionalFormula |
collapseAssociativeFormulas()
This method collapses all associative operations appearing
in this term, e.g.
|
boolean |
equals(Object obj) |
Set<Proposition> |
getAtoms() |
PropositionalFormula |
getFormula()
Returns the formula within this negation.
|
Set<PropositionalFormula> |
getLiterals()
Returns all literals, i.e.
|
Set<PossibleWorld> |
getModels(PropositionalSignature sig)
Returns the set of models of this formula wrt.
|
Set<PropositionalPredicate> |
getPredicates() |
PropositionalSignature |
getSignature() |
int |
hashCode() |
boolean |
hasLowerBindingPriority(PropositionalFormula other) |
boolean |
isLiteral() |
int |
numberOfOccurrences(Proposition p)
Returns the number of occurrences of the given proposition
within this formula
|
PropositionalFormula |
replace(Proposition p,
PropositionalFormula f,
int i)
Replaces the ith instance of the proposition p by f.
|
Conjunction |
toCnf()
This method returns this formula in conjunctive normal form (CNF).
|
PropositionalFormula |
toNnf()
This method returns this formula in negation normal form (NNF).
|
String |
toString() |
PropositionalFormula |
trim()
Removes duplicates (identical formulas) from conjunctions and disjunctions and
duplicate negations.
|
combineWithAnd, combineWithOr, complement, getModels, getPredicateCls, getPrimeImplicants, getUniformProbability, isConjunctiveClause, resolvableWith, resolveWith, toBlakeCanonicalForm, toDnfpublic Negation(PropositionalFormula formula)
formula - the formula within the negation.public PropositionalFormula getFormula()
public PropositionalFormula collapseAssociativeFormulas()
PropositionalFormulacollapseAssociativeFormulas in class PropositionalFormulapublic boolean hasLowerBindingPriority(PropositionalFormula other)
public PropositionalFormula toNnf()
PropositionalFormulatoNnf in class PropositionalFormulapublic PropositionalFormula trim()
PropositionalFormulatrim in class PropositionalFormulapublic int hashCode()
hashCode in interface net.sf.tweety.logics.commons.syntax.interfaces.SimpleLogicalFormulahashCode in class PropositionalFormulapublic boolean equals(Object obj)
equals in interface net.sf.tweety.logics.commons.syntax.interfaces.SimpleLogicalFormulaequals in class PropositionalFormulapublic Set<PropositionalPredicate> getPredicates()
getPredicates in interface net.sf.tweety.logics.commons.syntax.interfaces.SimpleLogicalFormulagetPredicates in class PropositionalFormulapublic PropositionalFormula clone()
clone in interface net.sf.tweety.logics.commons.syntax.interfaces.SimpleLogicalFormulaclone in class PropositionalFormulapublic Set<Proposition> getAtoms()
getAtoms in interface net.sf.tweety.logics.commons.syntax.interfaces.SimpleLogicalFormulagetAtoms in class PropositionalFormulapublic boolean isLiteral()
isLiteral in interface net.sf.tweety.logics.commons.syntax.interfaces.SimpleLogicalFormulaisLiteral in class PropositionalFormulapublic Set<PropositionalFormula> getLiterals()
PropositionalFormulagetLiterals in class PropositionalFormulapublic PropositionalSignature getSignature()
getSignature in interface net.sf.tweety.commons.FormulagetSignature in class PropositionalFormulapublic Conjunction toCnf()
PropositionalFormulatoCnf in class PropositionalFormulapublic Set<PossibleWorld> getModels(PropositionalSignature sig)
PropositionalFormulagetModels in class PropositionalFormulasig - some propositional signaturepublic int numberOfOccurrences(Proposition p)
PropositionalFormulanumberOfOccurrences in class PropositionalFormulap - some propositionpublic PropositionalFormula replace(Proposition p, PropositionalFormula f, int i)
PropositionalFormulareplace in class PropositionalFormulap - some propositionf - some formulai - the index of the propositionCopyright © 2018. All rights reserved.