Class ExistsQuantifiedFormula
java.lang.Object
org.tweetyproject.logics.pl.syntax.PlFormula
org.tweetyproject.logics.qbf.syntax.ExistsQuantifiedFormula
- All Implemented Interfaces:
Formula,ClassicalFormula,Conjunctable,Disjunctable,Invertable,ProbabilityAware,SimpleLogicalFormula
This class represents existential quantification for boolean formulas.
- Author:
- Anna Gessler
-
Constructor Summary
ConstructorsConstructorDescriptionExistsQuantifiedFormula(PlFormula f, Set<Proposition> variables) Create a new existential boolean quantification.ExistsQuantifiedFormula(PlFormula f, Proposition variable) Create a new existential boolean quantification.Create a new existential boolean quantification. -
Method Summary
Modifier and TypeMethodDescriptionclone()Creates a deep copy of this formulaThis method collapses all associative operations appearing in this term, e.g.booleangetAtoms()Processes the set of all atoms which appear in this formulaReturns all literals, i.e.getModels(PlSignature sig) Returns the set of models of this formula wrt.Processes the set of all predicates which appear in this formulaReturns the signature of the language of this formula.inthashCode()intReturns the number of occurrences of the given proposition within this formulareplace(Proposition p, PlFormula f, int i) Replaces the ith instance of the proposition p by f.toCnf()In this case, this method returns this quantified boolean formula's cnf kernel.toNnf()This method returns this formula in negation normal form (NNF).toString()trim()Removes duplicates (identical formulas) from conjunctions and disjunctions and removes duplicate negations.Methods inherited from class org.tweetyproject.logics.pl.syntax.PlFormula
combineWithAnd, combineWithOr, complement, getModels, getPredicateCls, getPrimeImplicants, getUniformProbability, isClause, isConjunctiveClause, isLiteral, resolvableWith, resolveWith, toBlakeCanonicalForm, toDnf
-
Constructor Details
-
ExistsQuantifiedFormula
Create a new existential boolean quantification.- Parameters:
f- inner formulavariables- quantifier variables
-
ExistsQuantifiedFormula
Create a new existential boolean quantification.- Parameters:
f- inner formulavariable- quantifier variable
-
ExistsQuantifiedFormula
Create a new existential boolean quantification.- Parameters:
other- other existential quantified formula
-
-
Method Details
-
getQuantifierVariables
- Returns:
- the quantifier variables (propositions)
-
getFormula
- Returns:
- the quantified formula
-
getAtoms
Description copied from interface:SimpleLogicalFormulaProcesses the set of all atoms which appear in this formula- Specified by:
getAtomsin interfaceSimpleLogicalFormula- Specified by:
getAtomsin classPlFormula- Returns:
- The set of all atoms
-
getLiterals
Description copied from class:PlFormulaReturns all literals, i.e. all formulas of the form "a" or "!a" where "a" is a proposition, that appear in this formula.- Specified by:
getLiteralsin classPlFormula- Returns:
- all literals appearing in this formula.
-
collapseAssociativeFormulas
Description copied from class:PlFormulaThis method collapses all associative operations appearing in this term, e.g. every a||(b||c) becomes a||b||c.- Specified by:
collapseAssociativeFormulasin classPlFormula- Returns:
- the collapsed formula.
-
getPredicates
Description copied from interface:SimpleLogicalFormulaProcesses the set of all predicates which appear in this formula- Specified by:
getPredicatesin interfaceSimpleLogicalFormula- Specified by:
getPredicatesin classPlFormula- Returns:
- all predicates that appear in this formula
-
trim
Description copied from class:PlFormulaRemoves 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
Description copied from class:PlFormulaThis 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
In this case, this method returns this quantified boolean formula's cnf kernel. -
getModels
Description copied from class:PlFormulaReturns the set of models of this formula wrt. the given signature. -
numberOfOccurrences
Description copied from class:PlFormulaReturns the number of occurrences of the given proposition within this formula- Specified by:
numberOfOccurrencesin classPlFormula- Parameters:
p- some proposition- Returns:
- the number of occurrences of the given proposition within this formula
-
replace
Description copied from class:PlFormulaReplaces the ith instance of the proposition p by f. -
equals
- Specified by:
equalsin interfaceSimpleLogicalFormula- Specified by:
equalsin classPlFormula
-
hashCode
public int hashCode()- Specified by:
hashCodein interfaceSimpleLogicalFormula- Specified by:
hashCodein classPlFormula
-
clone
Description copied from interface:SimpleLogicalFormulaCreates a deep copy of this formula- Specified by:
clonein interfaceSimpleLogicalFormula- Specified by:
clonein classPlFormula- Returns:
- the cloned formula
-
toString
-
getSignature
Description copied from interface:FormulaReturns the signature of the language of this formula.- Specified by:
getSignaturein interfaceFormula- Overrides:
getSignaturein classPlFormula- Returns:
- the signature of the language of this formula.
-