Package net.sf.tweety.logics.pl.syntax
Class Implication
- java.lang.Object
-
- net.sf.tweety.logics.pl.syntax.PlFormula
-
- net.sf.tweety.logics.pl.syntax.Implication
-
- All Implemented Interfaces:
Formula
,ClassicalFormula
,Conjunctable
,Disjunctable
,Invertable
,ProbabilityAware
,SimpleLogicalFormula
public class Implication extends PlFormula
This class models the implication of propositional logic.- Author:
- Anna Gessler
-
-
Constructor Summary
Constructors Constructor Description Implication(Pair<PlFormula,PlFormula> formulas)
Creates a new implication with the given pair of formulasImplication(PlFormula a, PlFormula b)
Creates a new implication a=>b with the two given formulas
-
Method Summary
Modifier and Type Method Description Implication
clone()
Creates a deep copy of this formulaPlFormula
collapseAssociativeFormulas()
This method collapses all associative operations appearing in this term, e.g.boolean
equals(java.lang.Object obj)
java.util.Set<Proposition>
getAtoms()
Processes the set of all atoms which appear in this formulaPair<PlFormula,PlFormula>
getFormulas()
Returns the formulas of the implication.java.util.Set<PlFormula>
getLiterals()
Returns all literals, i.e.java.util.Set<PossibleWorld>
getModels(PlSignature sig)
Returns the set of models of this formula wrt.java.util.Set<PlPredicate>
getPredicates()
Processes the set of all predicates which appear in this formulaPlSignature
getSignature()
Returns the signature of the language of this formula.int
hashCode()
int
numberOfOccurrences(Proposition p)
Returns the number of occurrences of the given proposition within this formulaPlFormula
replace(Proposition p, PlFormula f, int i)
Replaces the ith instance of the proposition p by f.void
setFirstFormula(PlFormula left)
Sets the left side formula of the implication left => right.void
setFormulas(Pair<PlFormula,PlFormula> formulas)
Sets the formulas of the implication.void
setFormulas(PlFormula left, PlFormula right)
Sets the formulas of the implication.void
setSecondFormula(PlFormula right)
Sets the right side formula of the implication left => rightConjunction
toCnf()
This method returns this formula in conjunctive normal form (CNF).PlFormula
toNnf()
This method returns this formula in negation normal form (NNF).java.lang.String
toString()
PlFormula
trim()
Removes duplicates (identical formulas) from conjunctions and disjunctions and removes duplicate negations.-
Methods inherited from class net.sf.tweety.logics.pl.syntax.PlFormula
combineWithAnd, combineWithOr, complement, getModels, getPredicateCls, getPrimeImplicants, getUniformProbability, isClause, isConjunctiveClause, isLiteral, resolvableWith, resolveWith, toBlakeCanonicalForm, toDnf
-
-
-
-
Method Detail
-
getFormulas
public Pair<PlFormula,PlFormula> getFormulas()
Returns the formulas of the implication.- Returns:
- the formulas that are part of the implication
-
setFormulas
public void setFormulas(Pair<PlFormula,PlFormula> formulas)
Sets the formulas of the implication.- Parameters:
formulas
- the formulas
-
setFormulas
public void setFormulas(PlFormula left, PlFormula right)
Sets the formulas of the implication.- Parameters:
left
-right
-
-
setFirstFormula
public void setFirstFormula(PlFormula left)
Sets the left side formula of the implication left => right.- Parameters:
left
- formula
-
setSecondFormula
public void setSecondFormula(PlFormula right)
Sets the right side formula of the implication left => right- Parameters:
right
- formula.
-
getAtoms
public java.util.Set<Proposition> getAtoms()
Description copied from interface:SimpleLogicalFormula
Processes the set of all atoms which appear in this formula- Specified by:
getAtoms
in interfaceSimpleLogicalFormula
- Specified by:
getAtoms
in classPlFormula
- Returns:
- The set of all atoms
-
getLiterals
public java.util.Set<PlFormula> getLiterals()
Description copied from class:PlFormula
Returns all literals, i.e. all formulas of the form "a" or "!a" where "a" is a proposition, that appear in this formula.- Specified by:
getLiterals
in classPlFormula
- Returns:
- all literals appearing in this formula.
-
collapseAssociativeFormulas
public PlFormula collapseAssociativeFormulas()
Description copied from class:PlFormula
This method collapses all associative operations appearing in this term, e.g. every a||(b||c) becomes a||b||c.- Specified by:
collapseAssociativeFormulas
in classPlFormula
- Returns:
- the collapsed formula.
-
getPredicates
public java.util.Set<PlPredicate> getPredicates()
Description copied from interface:SimpleLogicalFormula
Processes the set of all predicates which appear in this formula- Specified by:
getPredicates
in interfaceSimpleLogicalFormula
- Specified by:
getPredicates
in classPlFormula
- Returns:
- all predicates that appear in this formula
-
trim
public PlFormula trim()
Description copied from class:PlFormula
Removes duplicates (identical formulas) from conjunctions and disjunctions and removes duplicate negations. Simplifies equivalences and implications with equivalent formulas (A=>A, A<=>A) to tautologies.
-
toNnf
public PlFormula toNnf()
Description copied from class:PlFormula
This method returns this formula in negation normal form (NNF). A formula is in NNF iff negations occur only directly in front of a proposition.
-
toCnf
public Conjunction toCnf()
Description copied from class:PlFormula
This method returns this formula in conjunctive normal form (CNF). A formula is in CNF iff it is a conjunction of disjunctions and in NNF.
-
getModels
public java.util.Set<PossibleWorld> getModels(PlSignature sig)
Description copied from class:PlFormula
Returns the set of models of this formula wrt. the given signature.
-
numberOfOccurrences
public int numberOfOccurrences(Proposition p)
Description copied from class:PlFormula
Returns the number of occurrences of the given proposition within this formula- Specified by:
numberOfOccurrences
in classPlFormula
- Parameters:
p
- some proposition- Returns:
- the number of occurrences of the given proposition within this formula
-
replace
public PlFormula replace(Proposition p, PlFormula f, int i)
Description copied from class:PlFormula
Replaces the ith instance of the proposition p by f.
-
hashCode
public int hashCode()
- Specified by:
hashCode
in interfaceSimpleLogicalFormula
- Specified by:
hashCode
in classPlFormula
-
equals
public boolean equals(java.lang.Object obj)
- Specified by:
equals
in interfaceSimpleLogicalFormula
- Specified by:
equals
in classPlFormula
-
clone
public Implication clone()
Description copied from interface:SimpleLogicalFormula
Creates a deep copy of this formula- Specified by:
clone
in interfaceSimpleLogicalFormula
- Specified by:
clone
in classPlFormula
- Returns:
- the cloned formula
-
toString
public java.lang.String toString()
- Overrides:
toString
in classjava.lang.Object
-
getSignature
public PlSignature getSignature()
Description copied from interface:Formula
Returns the signature of the language of this formula.- Specified by:
getSignature
in interfaceFormula
- Overrides:
getSignature
in classPlFormula
- Returns:
- the signature of the language of this formula.
-
-