Class CADFSemantics
java.lang.Object
org.tweetyproject.logics.translators.adfconditional.CADFSemantics
This class implements the cADF semantics by applying the Gamma Operator
and checking for admissible, complete, grounded, preferred and 2-valued interpretations plus the grounded state
refer to [Heyninck et al. 2021] for further information
- Author:
- Jonas Schumacher
-
Field Summary
-
Constructor Summary
-
Method Summary
Modifier and TypeMethodDescriptionstatic Collection
<FourValuedWorld> gammaOperator
(ArrayList<PlFormula> statementFormulas, ArrayList<PlFormula> acceptanceFormulas, PlSignature sig, FourValuedWorld worldInput) Implementation of the gamma operator: calculate a new set of (output) interpretations given a cADF and an (input) interpretationstatic Collection
<FourValuedWorld> gammaPrimeOperator
(Collection<FourValuedWorld> inputCollection, ArrayList<PlFormula> statementFormulas, ArrayList<PlFormula> acceptanceFormulas, PlSignature sig) Implementation of the Gamma Prime Operator: Calculate the union of the Gamma Operator of all input worlds and then reduce those worlds to the least informative onesstatic boolean
isAdmissible
(FourValuedWorld inputWorld, Collection<FourValuedWorld> outputWorlds) Check whether a given world constitutes an admissible interpretationstatic boolean
isComplete
(FourValuedWorld inputWorld, Collection<FourValuedWorld> outputWorlds, ArrayList<PlFormula> statementFormulas, ArrayList<PlFormula> acceptanceFormulas) Check whether a given world constitutes a complete interpretationstatic void
Input an ADF, calculate all possible 4-valued interpretations, apply the gamma operator Check whether the interpretations are admissible, complete, grounded, preferred or 2-valued
-
Field Details
-
allPossibleWorlds
all possible wworlds
-
-
Constructor Details
-
CADFSemantics
public CADFSemantics()Default Constructor
-
-
Method Details
-
gammaOperator
public static Collection<FourValuedWorld> gammaOperator(ArrayList<PlFormula> statementFormulas, ArrayList<PlFormula> acceptanceFormulas, PlSignature sig, FourValuedWorld worldInput) Implementation of the gamma operator: calculate a new set of (output) interpretations given a cADF and an (input) interpretation- Parameters:
statementFormulas
- statement FormulasacceptanceFormulas
- acceptance formulassig
- signatureworldInput
- input world- Returns:
- a collection of worlds
-
gammaPrimeOperator
public static Collection<FourValuedWorld> gammaPrimeOperator(Collection<FourValuedWorld> inputCollection, ArrayList<PlFormula> statementFormulas, ArrayList<PlFormula> acceptanceFormulas, PlSignature sig) Implementation of the Gamma Prime Operator: Calculate the union of the Gamma Operator of all input worlds and then reduce those worlds to the least informative ones- Parameters:
inputCollection
- iputstatementFormulas
- statement FormulasacceptanceFormulas
- acceptance Formulassig
- signature- Returns:
- worlds
-
isAdmissible
public static boolean isAdmissible(FourValuedWorld inputWorld, Collection<FourValuedWorld> outputWorlds) Check whether a given world constitutes an admissible interpretation- Parameters:
inputWorld
- inputWorldoutputWorlds
- outputWorlds- Returns:
- whether the worlds are admissible
-
isComplete
public static boolean isComplete(FourValuedWorld inputWorld, Collection<FourValuedWorld> outputWorlds, ArrayList<PlFormula> statementFormulas, ArrayList<PlFormula> acceptanceFormulas) Check whether a given world constitutes a complete interpretation- Parameters:
inputWorld
- inputWorldoutputWorlds
- outputWorldsstatementFormulas
- statementFormulasacceptanceFormulas
- cceptanceFormulas- Returns:
- whether the worlds are complete
-
main
Input an ADF, calculate all possible 4-valued interpretations, apply the gamma operator Check whether the interpretations are admissible, complete, grounded, preferred or 2-valued- Parameters:
args
- arguments
-