Class PropositionalMapping
This is especially needed if we want to interconnect different sat encodings, since they have to share the same propositional variables.
Since we are dealing with three valued interpretations, in order to represent an undecided argument we need two propositional variables for each argument. One represents satisfied, one unsatisfied and if both are false the argument should be interpreted as undecided. It should be prevented by the encoding that both are true.
- Author:
- Mathias Hofer
-
Constructor Summary
ConstructorDescriptionCreates propositional representations for the arguments and links of the provided ADF. -
Method Summary
-
Constructor Details
-
PropositionalMapping
Creates propositional representations for the arguments and links of the provided ADF. It does not compute any links in the process.The propositional variables are eagerly computed and not changed anymore. Which makes this class usable in a parallel context.
It does not store a reference to the provided ADF, therefore it can be reused even by different ADFs as long as they are a subset, in terms of arguments and links, of the provided one.
- Parameters:
adf
- the ADF for which we need a propositional representation
-
-
Method Details
-
getFalse
- Parameters:
argument
- argument- Returns:
- getFalse
-
getTrue
- Parameters:
argument
- argument- Returns:
- getTrue
-
getLink
- Parameters:
from
- fromto
- to- Returns:
- getLink
-
getArgumentLiterals
- Returns:
- getArgumentLiterals
-
getArguments
- Returns:
- getArguments
-
getLink
- Parameters:
link
- link- Returns:
- getLink
-