net.sf.tweety.arg.dung

Class AbstractExtensionReasoner

java.lang.Object

net.sf.tweety.commons.Reasoner

net.sf.tweety.arg.dung.AbstractExtensionReasoner

Direct Known Subclasses:

AdmissibleReasoner, CF2Reasoner, CompleteReasoner, ConflictFreeReasoner, GroundReasoner, IdealReasoner, PreferredReasoner, SccCompleteReasoner, SemiStableReasoner, StableReasoner, StageReasoner

public abstract class AbstractExtensionReasoner
extends net.sf.tweety.commons.Reasoner

This class models an abstract extension reasoner used for Dung theories.

Author:

Matthias Thimm

Constructor Summary

Constructors

Constructor and Description
AbstractExtensionReasoner(net.sf.tweety.commons.BeliefBase beliefBase) Creates a new reasoner for the given knowledge base using sceptical inference.
AbstractExtensionReasoner(net.sf.tweety.commons.BeliefBase beliefBase, int inferenceType) Creates a new reasoner for the given knowledge base.

Method Summary

Modifier and Type	Method and Description
protected abstract Set<Extension>	computeExtensions() Computes the extensions this reasoner bases upon.
Set<Extension>	getExtensions() Returns the extensions this reasoner bases upon.
int	getInferenceType() Returns the inference type of this reasoner.
net.sf.tweety.logics.pl.PlBeliefSet	getPropositionalCharacterisation() Creates a propositional representation of the set of labelings of the underlying Dung theory that are consistent with the given semantics.
protected abstract net.sf.tweety.logics.pl.PlBeliefSet	getPropositionalCharacterisationBySemantics(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, see getPropositionalCharacterisation.
static AbstractExtensionReasoner	getReasonerForSemantics(net.sf.tweety.commons.BeliefBase beliefBase, Semantics semantics, int inferenceType) Creates a reasoner for the given semantics.
net.sf.tweety.commons.Answer	query(net.sf.tweety.commons.Formula query)

Methods inherited from class net.sf.tweety.commons.Reasoner

getKnowledgeBase

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

AbstractExtensionReasoner

public AbstractExtensionReasoner(net.sf.tweety.commons.BeliefBase beliefBase,
                                 int inferenceType)

Creates a new reasoner for the given knowledge base.

Parameters:

beliefBase - The knowledge base for this reasoner.

inferenceType - The inference type for this reasoner.

AbstractExtensionReasoner

public AbstractExtensionReasoner(net.sf.tweety.commons.BeliefBase beliefBase)

Creates a new reasoner for the given knowledge base using sceptical inference.

Parameters:

beliefBase - The knowledge base for this reasoner.

Method Detail

getReasonerForSemantics

public static AbstractExtensionReasoner getReasonerForSemantics(net.sf.tweety.commons.BeliefBase beliefBase,
                                                                Semantics semantics,
                                                                int inferenceType)

Creates a reasoner for the given semantics.

Parameters:

beliefBase - some Dung theory

semantics - a semantics

inferenceType - an inference type

Returns:

a reasoner for the given Dung theory, inference type, and semantics

query

public net.sf.tweety.commons.Answer query(net.sf.tweety.commons.Formula query)

Specified by:

query in class net.sf.tweety.commons.Reasoner

getPropositionalCharacterisation

public net.sf.tweety.logics.pl.PlBeliefSet getPropositionalCharacterisation()

Creates a propositional representation of the set of labelings of the underlying 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.

Returns:

a propositional belief set.

getPropositionalCharacterisationBySemantics

protected abstract net.sf.tweety.logics.pl.PlBeliefSet getPropositionalCharacterisationBySemantics(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, see getPropositionalCharacterisation.

Parameters:

in - 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.

getExtensions

public Set<Extension> getExtensions()

Returns the extensions this reasoner bases upon.

Returns:

the extensions this reasoner bases upon.

getInferenceType

public int getInferenceType()

Returns the inference type of this reasoner.

Returns:

the inference type of this reasoner.

computeExtensions

protected abstract Set<Extension> computeExtensions()

Computes the extensions this reasoner bases upon.

Returns:

A set of extensions.