| Package | Description |
|---|---|
| net.sf.tweety.logics.pl.sat | |
| net.sf.tweety.logics.pl.semantics | |
| net.sf.tweety.logics.pl.syntax |
| Modifier and Type | Method and Description |
|---|---|
protected static String |
SatSolver.convertToDimacs(Collection<PropositionalFormula> formulas,
List<Proposition> props)
Converts the given set of formulas to their string representation in
Dimacs CNF.
|
protected static File |
SatSolver.createTmpDimacsFile(Collection<PropositionalFormula> formulas,
List<Proposition> props)
Creates a temporary file in Dimacs format with the given proposition2variable mapping.
|
| Modifier and Type | Method and Description |
|---|---|
Set<Map.Entry<Proposition,Double>> |
FuzzyInterpretation.entrySet() |
Collection<Proposition> |
PriestWorld.getBinarybase()
Returns the binary base of this world, i.e.
|
Collection<Proposition> |
PriestWorld.getConflictbase()
Returns the conflict base of this world, i.e.
|
Set<net.sf.tweety.commons.util.Pair<Proposition,Boolean>> |
NicePossibleWorld.getRepresentationStructure() |
Set<Proposition> |
FuzzyInterpretation.keySet() |
| Modifier and Type | Method and Description |
|---|---|
PriestWorld.TruthValue |
PriestWorld.get(Proposition p)
Returns the truth value of the given proposition.
|
Double |
FuzzyInterpretation.put(Proposition arg0,
Double arg1) |
void |
PriestWorld.set(Proposition p,
PriestWorld.TruthValue val)
Sets the value of the given proposition.
|
| Modifier and Type | Method and Description |
|---|---|
int |
NicePossibleWorld.compare(net.sf.tweety.commons.util.Pair<Proposition,Boolean> o1,
net.sf.tweety.commons.util.Pair<Proposition,Boolean> o2) |
int |
NicePossibleWorld.compare(net.sf.tweety.commons.util.Pair<Proposition,Boolean> o1,
net.sf.tweety.commons.util.Pair<Proposition,Boolean> o2) |
static Set<NicePossibleWorld> |
NicePossibleWorld.getAllPossibleWorlds(Collection<Proposition> signature) |
static Set<PossibleWorld> |
PossibleWorld.getAllPossibleWorlds(Collection<Proposition> signature)
Returns the set of all possible worlds for the
given propositional signature.
|
void |
FuzzyInterpretation.putAll(Map<? extends Proposition,? extends Double> arg0) |
void |
NicePossibleWorld.setComparator(Comparator<net.sf.tweety.commons.util.Pair<Proposition,Boolean>> comparator)
Changes the used comparator to sort the representation structure and resorts
the representation.
|
boolean |
NicePossibleWorld.setSignature(Collection<Proposition> signature)
Changes the signature of the world.
|
| Constructor and Description |
|---|
NicePossibleWorld(Collection<Proposition> trueInWorld,
Collection<Proposition> signature)
Ctor: Generates the possible world using the given set of true propositions and
generated a representation of the possible world using the given signature.
|
NicePossibleWorld(Collection<Proposition> trueInWorld,
Collection<Proposition> signature)
Ctor: Generates the possible world using the given set of true propositions and
generated a representation of the possible world using the given signature.
|
NicePossibleWorld(Collection<Proposition> trueInWorld,
Collection<Proposition> signature,
Comparator<net.sf.tweety.commons.util.Pair<Proposition,Boolean>> comparator)
Ctor: Generates the possible world using the given set of true propositions and
generated a representation of the possible world using the given signature.
|
NicePossibleWorld(Collection<Proposition> trueInWorld,
Collection<Proposition> signature,
Comparator<net.sf.tweety.commons.util.Pair<Proposition,Boolean>> comparator)
Ctor: Generates the possible world using the given set of true propositions and
generated a representation of the possible world using the given signature.
|
NicePossibleWorld(Collection<Proposition> trueInWorld,
Collection<Proposition> signature,
Comparator<net.sf.tweety.commons.util.Pair<Proposition,Boolean>> comparator)
Ctor: Generates the possible world using the given set of true propositions and
generated a representation of the possible world using the given signature.
|
PossibleWorld(Collection<? extends Proposition> propositions)
Creates a new possible world with the given set of propositions.
|
| Modifier and Type | Method and Description |
|---|---|
Proposition |
Proposition.clone() |
| Modifier and Type | Method and Description |
|---|---|
Set<Proposition> |
SpecialFormula.getAtoms() |
Set<Proposition> |
Proposition.getAtoms() |
Set<Proposition> |
AssociativePropositionalFormula.getAtoms() |
abstract Set<Proposition> |
PropositionalFormula.getAtoms() |
Set<Proposition> |
Negation.getAtoms() |
| Modifier and Type | Method and Description |
|---|---|
int |
Proposition.compareTo(Proposition o) |
int |
SpecialFormula.numberOfOccurrences(Proposition p) |
int |
Proposition.numberOfOccurrences(Proposition p) |
int |
AssociativePropositionalFormula.numberOfOccurrences(Proposition p) |
abstract int |
PropositionalFormula.numberOfOccurrences(Proposition p)
Returns the number of occurrences of the given proposition
within this formula
|
int |
Negation.numberOfOccurrences(Proposition p) |
PropositionalFormula |
Conjunction.replace(Proposition p,
PropositionalFormula f,
int i) |
PropositionalFormula |
SpecialFormula.replace(Proposition p,
PropositionalFormula f,
int i) |
PropositionalFormula |
Proposition.replace(Proposition p,
PropositionalFormula f,
int i) |
PropositionalFormula |
Disjunction.replace(Proposition p,
PropositionalFormula f,
int i) |
abstract PropositionalFormula |
PropositionalFormula.replace(Proposition p,
PropositionalFormula f,
int i)
Replaces the ith instance of the proposition p by f.
|
PropositionalFormula |
Negation.replace(Proposition p,
PropositionalFormula f,
int i) |
| Constructor and Description |
|---|
Proposition(Proposition other) |
| Constructor and Description |
|---|
PropositionalSignature(Collection<? extends Proposition> propositions)
Creates a new propositional signature with the given set
of propositions.
|
Copyright © 2018. All rights reserved.