Class ArgumentTree

  • All Implemented Interfaces:
    Iterable<DeductiveArgumentNode>, net.sf.tweety.graphs.Graph<DeductiveArgumentNode>

    public class ArgumentTree
    extends net.sf.tweety.graphs.DefaultGraph<DeductiveArgumentNode>
    Instances of this class represent argument trees in the sense of Definition 6.1 in

    Philippe Besnard and Anthony Hunter. A logic-based theory of deductive arguments. In Artificial Intelligence, 128(1-2):203-235, 2001.
    Author:
    Matthias Thimm
    • Field Summary

      • Fields inherited from interface net.sf.tweety.graphs.Graph

        IGNORE_SELFLOOPS, INVERT_SELFLOOPS, REMOVE_SELFLOOPS
    • Method Summary

      Modifier and Type Method Description
      DeductiveArgumentNode getRoot()
      Returns the root node of this tree.
      String prettyPrint()
      Returns a string representation of this argument tree.
      • Methods inherited from class net.sf.tweety.graphs.DefaultGraph

        add, add, areAdjacent, contains, containsBackEdge, containsCycle, existsDirectedPath, existsDirectedPath, getAdjacencyMatrix, getChildren, getComplementGraph, getComponents, getCyclesExcludingSelfLoops, getCyclesIncludingSelfLoops, getEdge, getEdges, getInducedSubgraphs, getNeighbors, getNodes, getNumberOfNodes, getParents, getRestriction, getStronglyConnectedComponents, getStronglyConnectedComponents, getSubgraphs, getSubgraphs, hasSelfLoops, isWeightedGraph, iterator, toString
    • Constructor Detail

      • ArgumentTree

        public ArgumentTree​(DeductiveArgumentNode root)
        Creates an empty argument tree for the given root node.
        Parameters:
        root - the root node.
    • Method Detail

      • getRoot

        public DeductiveArgumentNode getRoot()
        Returns the root node of this tree.
        Returns:
        the root node of this tree.
      • prettyPrint

        public String prettyPrint()
        Returns a string representation of this argument tree.
        Returns:
        a string representation of this argument tree.