Package net.sf.tweety.logics.qbf.syntax

Class ExistsQuantifiedFormula

  • All Implemented Interfaces:
    net.sf.tweety.commons.Formula, net.sf.tweety.logics.commons.syntax.interfaces.ClassicalFormula, net.sf.tweety.logics.commons.syntax.interfaces.Conjunctable, net.sf.tweety.logics.commons.syntax.interfaces.Disjunctable, net.sf.tweety.logics.commons.syntax.interfaces.Invertable, net.sf.tweety.logics.commons.syntax.interfaces.ProbabilityAware, net.sf.tweety.logics.commons.syntax.interfaces.SimpleLogicalFormula
    public class ExistsQuantifiedFormula
extends net.sf.tweety.logics.pl.syntax.PlFormula
    This class represents existential quantification for boolean formulas.
    Author:
    Anna Gessler

    • Constructor Summary

      Constructors 
      Constructor Description
      ExistsQuantifiedFormula​(net.sf.tweety.logics.pl.syntax.PlFormula f, Set<net.sf.tweety.logics.pl.syntax.Proposition> variables)
      Create a new existential boolean quantification.
      ExistsQuantifiedFormula​(net.sf.tweety.logics.pl.syntax.PlFormula f, net.sf.tweety.logics.pl.syntax.Proposition variable)
      Create a new existential boolean quantification.
      ExistsQuantifiedFormula​(ExistsQuantifiedFormula other)
      Create a new existential boolean quantification.

    • Method Summary

      Modifier and Type Method Description
      net.sf.tweety.logics.pl.syntax.PlFormula clone()  
      net.sf.tweety.logics.pl.syntax.PlFormula collapseAssociativeFormulas()  
      boolean equals​(Object obj)  
      Set<net.sf.tweety.logics.pl.syntax.Proposition> getAtoms()  
      net.sf.tweety.logics.pl.syntax.PlFormula getFormula()  
      Set<net.sf.tweety.logics.pl.syntax.PlFormula> getLiterals()  
      Set<net.sf.tweety.logics.pl.semantics.PossibleWorld> getModels​(net.sf.tweety.logics.pl.syntax.PlSignature sig)  
      Set<net.sf.tweety.logics.pl.syntax.PlPredicate> getPredicates()  
      Set<net.sf.tweety.logics.pl.syntax.Proposition> getQuantifierVariables()  
      net.sf.tweety.logics.pl.syntax.PlSignature getSignature()  
      int hashCode()  
      int numberOfOccurrences​(net.sf.tweety.logics.pl.syntax.Proposition p)  
      net.sf.tweety.logics.pl.syntax.PlFormula replace​(net.sf.tweety.logics.pl.syntax.Proposition p, net.sf.tweety.logics.pl.syntax.PlFormula f, int i)  
      net.sf.tweety.logics.pl.syntax.Conjunction toCnf()
      In this case, this method returns this quantified boolean formula's cnf kernel.
      net.sf.tweety.logics.pl.syntax.PlFormula toNnf()  
      String toString()  
      net.sf.tweety.logics.pl.syntax.PlFormula trim()  

      • 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

    • Constructor Detail

      • ExistsQuantifiedFormula

        public ExistsQuantifiedFormula​(net.sf.tweety.logics.pl.syntax.PlFormula f,
                               Set<net.sf.tweety.logics.pl.syntax.Proposition> variables)
        Create a new existential boolean quantification.
        Parameters:
        f - inner formula
        variables - quantifier variables

      • ExistsQuantifiedFormula

        public ExistsQuantifiedFormula​(net.sf.tweety.logics.pl.syntax.PlFormula f,
                               net.sf.tweety.logics.pl.syntax.Proposition variable)
        Create a new existential boolean quantification.
        Parameters:
        f - inner formula
        variable - quantifier variable

      • ExistsQuantifiedFormula

        public ExistsQuantifiedFormula​(ExistsQuantifiedFormula other)
        Create a new existential boolean quantification.
        Parameters:
        other - other existential quantified formula

    • Method Detail

      • getQuantifierVariables

        public Set<net.sf.tweety.logics.pl.syntax.Proposition> getQuantifierVariables()
        Returns:
        the quantifier variables (propositions)

      • getFormula

        public net.sf.tweety.logics.pl.syntax.PlFormula getFormula()
        Returns:
        the quantified formula

      • getAtoms

        public Set<net.sf.tweety.logics.pl.syntax.Proposition> getAtoms()
        Specified by:
        getAtoms in interface net.sf.tweety.logics.commons.syntax.interfaces.SimpleLogicalFormula
        Specified by:
        getAtoms in class net.sf.tweety.logics.pl.syntax.PlFormula

      • getLiterals

        public Set<net.sf.tweety.logics.pl.syntax.PlFormula> getLiterals()
        Specified by:
        getLiterals in class net.sf.tweety.logics.pl.syntax.PlFormula

      • collapseAssociativeFormulas

        public net.sf.tweety.logics.pl.syntax.PlFormula collapseAssociativeFormulas()
        Specified by:
        collapseAssociativeFormulas in class net.sf.tweety.logics.pl.syntax.PlFormula

      • getPredicates

        public Set<net.sf.tweety.logics.pl.syntax.PlPredicate> getPredicates()
        Specified by:
        getPredicates in interface net.sf.tweety.logics.commons.syntax.interfaces.SimpleLogicalFormula
        Specified by:
        getPredicates in class net.sf.tweety.logics.pl.syntax.PlFormula

      • trim

        public net.sf.tweety.logics.pl.syntax.PlFormula trim()
        Specified by:
        trim in class net.sf.tweety.logics.pl.syntax.PlFormula

      • toNnf

        public net.sf.tweety.logics.pl.syntax.PlFormula toNnf()
        Specified by:
        toNnf in class net.sf.tweety.logics.pl.syntax.PlFormula

      • toCnf

        public net.sf.tweety.logics.pl.syntax.Conjunction toCnf()
        In this case, this method returns this quantified boolean formula's cnf kernel.
        Specified by:
        toCnf in class net.sf.tweety.logics.pl.syntax.PlFormula

      • getModels

        public Set<net.sf.tweety.logics.pl.semantics.PossibleWorld> getModels​(net.sf.tweety.logics.pl.syntax.PlSignature sig)
        Specified by:
        getModels in class net.sf.tweety.logics.pl.syntax.PlFormula

      • numberOfOccurrences

        public int numberOfOccurrences​(net.sf.tweety.logics.pl.syntax.Proposition p)
        Specified by:
        numberOfOccurrences in class net.sf.tweety.logics.pl.syntax.PlFormula

      • replace

        public net.sf.tweety.logics.pl.syntax.PlFormula replace​(net.sf.tweety.logics.pl.syntax.Proposition p,
                                                        net.sf.tweety.logics.pl.syntax.PlFormula f,
                                                        int i)
        Specified by:
        replace in class net.sf.tweety.logics.pl.syntax.PlFormula

      • equals

        public boolean equals​(Object obj)
        Specified by:
        equals in interface net.sf.tweety.logics.commons.syntax.interfaces.SimpleLogicalFormula
        Specified by:
        equals in class net.sf.tweety.logics.pl.syntax.PlFormula

      • hashCode

        public int hashCode()
        Specified by:
        hashCode in interface net.sf.tweety.logics.commons.syntax.interfaces.SimpleLogicalFormula
        Specified by:
        hashCode in class net.sf.tweety.logics.pl.syntax.PlFormula

      • clone

        public net.sf.tweety.logics.pl.syntax.PlFormula clone()
        Specified by:
        clone in interface net.sf.tweety.logics.commons.syntax.interfaces.SimpleLogicalFormula
        Specified by:
        clone in class net.sf.tweety.logics.pl.syntax.PlFormula

      • getSignature

        public net.sf.tweety.logics.pl.syntax.PlSignature getSignature()
        Specified by:
        getSignature in interface net.sf.tweety.commons.Formula
        Overrides:
        getSignature in class net.sf.tweety.logics.pl.syntax.PlFormula