Package net.sf.tweety.arg.dung.reasoner
Class AbstractSatExtensionReasoner
- java.lang.Object
-
- net.sf.tweety.arg.dung.reasoner.AbstractDungReasoner
-
- net.sf.tweety.arg.dung.reasoner.AbstractExtensionReasoner
-
- net.sf.tweety.arg.dung.reasoner.AbstractSatExtensionReasoner
-
- All Implemented Interfaces:
net.sf.tweety.commons.ModelProvider<Argument,DungTheory,Extension>,net.sf.tweety.commons.QualitativeReasoner<DungTheory,Argument>,net.sf.tweety.commons.Reasoner<Boolean,DungTheory,Argument>
- Direct Known Subclasses:
SatCompleteReasoner,SatStableReasoner
public abstract class AbstractSatExtensionReasoner extends AbstractExtensionReasoner
Uses a provided SAT solver to solve reasoning problems in AAFs.- Author:
- Matthias Thimm
-
-
Field Summary
Fields Modifier and Type Field Description protected net.sf.tweety.logics.pl.sat.SatSolversolverA SAT solver
-
Constructor Summary
Constructors Constructor Description AbstractSatExtensionReasoner(net.sf.tweety.logics.pl.sat.SatSolver solver)Instantiates a new reasoner that uses the given SAT solver
-
Method Summary
Modifier and Type Method Description ExtensiongetModel(DungTheory bbase)Collection<Extension>getModels(DungTheory bbase)net.sf.tweety.logics.pl.syntax.PlBeliefSetgetPropositionalCharacterisation(DungTheory aaf)Creates a propositional representation of the set of labelings of the given Dung theory that are consistent with the given semantics.protected abstract net.sf.tweety.logics.pl.syntax.PlBeliefSetgetPropositionalCharacterisationBySemantics(DungTheory aaf, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> in, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> out, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> undec)Returns the semantic-specific propositional characterization of the underlying Dung theory, seegetPropositionalCharacterisation.-
Methods inherited from class net.sf.tweety.arg.dung.reasoner.AbstractExtensionReasoner
getSimpleReasonerForSemantics, query, query
-
-
-
-
Method Detail
-
getModels
public Collection<Extension> getModels(DungTheory bbase)
- Specified by:
getModelsin interfacenet.sf.tweety.commons.ModelProvider<Argument,DungTheory,Extension>- Specified by:
getModelsin classAbstractExtensionReasoner
-
getPropositionalCharacterisation
public net.sf.tweety.logics.pl.syntax.PlBeliefSet getPropositionalCharacterisation(DungTheory aaf)
Creates a propositional representation of the set of labelings of the given Dung theory that are consistent with the given semantics. This means that for every argument A in the theory three propositions are created: in_A, out_A, undec_A. For every attack A->B the formula "in_A => out_B" is added to the belief set. Depending on the actual semantics further propositional formulas are added. For example, for any admissable semantics and unattacked argument A, the constraint "\top=>in_A" is added; another constraint added for admissable semantics is, given any argument A and attackers B1...BN, add the constraint in_A => out_B1 ^ ... ^ out_BN.- Parameters:
aaf- a Dung Thery- Returns:
- a propositional belief set.
-
getPropositionalCharacterisationBySemantics
protected abstract net.sf.tweety.logics.pl.syntax.PlBeliefSet getPropositionalCharacterisationBySemantics(DungTheory aaf, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> in, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> out, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> undec)
Returns the semantic-specific propositional characterization of the underlying Dung theory, seegetPropositionalCharacterisation.- Parameters:
aaf- the Dung theoryin- propositional variables of in arguments.out- propositional variables of out arguments.undec- propositional variables of undec arguments.- Returns:
- the semantic-specific propositional characterization of the underlying Dung
theory, see
getPropositionalCharacterisation.
-
getModel
public Extension getModel(DungTheory bbase)
- Specified by:
getModelin interfacenet.sf.tweety.commons.ModelProvider<Argument,DungTheory,Extension>- Specified by:
getModelin classAbstractExtensionReasoner
-
-