net.sf.tweety.arg.deductive.semantics

Class Compilation

java.lang.Object

net.sf.tweety.graphs.DefaultGraph<CompilationNode>

net.sf.tweety.arg.deductive.semantics.Compilation

All Implemented Interfaces:

java.lang.Iterable<CompilationNode>, Graph<CompilationNode>

public class Compilation
extends DefaultGraph<CompilationNode>

Instances of this class are compilations in the sense of Definition 8 in

Philippe Besnard and Anthony Hunter. Knowledgebase Compilation for Efficient Logical Argumentation. In Proceedings of the 10th International Conference on Knowledge Representation (KR'06), pages 123-133, AAAI Press, 2006.

A compilation of a knowledge base is a graph where the nodes are the minimal inconsistent subsets of the knowledge base and the edges connect sets that have a non-empty intersection.

Author:

Matthias Thimm

Field Summary

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

IGNORE_SELFLOOPS, INVERT_SELFLOOPS, REMOVE_SELFLOOPS

Constructor Summary

Constructors

Constructor and Description
Compilation(DeductiveKnowledgeBase kb) Creates the compilation of the given knowledge base.

Method Summary

Modifier and Type	Method and Description
private java.util.Set<CompilationNode>	firstLevel(DeductiveArgument arg) This method returns the compilation nodes that can be used to construct undercuts to the given argument.
ArgumentTree	getArgumentTree(DeductiveArgument arg) Returns the argument tree for the given argument.
private void	subcuts(DeductiveArgumentNode argNode, java.util.Set<CompilationNode> remainingNodes, CompilationNode current, java.util.Set<PropositionalFormula> currentSupport, ArgumentTree argTree) This method recursively builds up the argument tree from the given argument.

Methods inherited from class net.sf.tweety.graphs.DefaultGraph

add, add, areAdjacent, contains, existsDirectedPath, existsDirectedPath, getAdjancyMatrix, getChildren, getComplementGraph, getEdge, getEdges, getNeighbors, getNodes, getNumberOfNodes, getParents, getRestriction, getStronglyConnectedComponents, getStronglyConnectedComponents, getSubgraphs, getSubgraphs, hasSelfLoops, isWeightedGraph, iterator, toString

Methods inherited from class java.lang.Object

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

Methods inherited from interface java.lang.Iterable

forEach, spliterator

Constructor Detail

Compilation

public Compilation(DeductiveKnowledgeBase kb)

Creates the compilation of the given knowledge base.

Parameters:

kb - some deductive knowledge base.

Method Detail

getArgumentTree

public ArgumentTree getArgumentTree(DeductiveArgument arg)

Returns the argument tree for the given argument.

Parameters:

arg - some deductive argument.

Returns:

the argument tree for the given argument.

firstLevel

private java.util.Set<CompilationNode> firstLevel(DeductiveArgument arg)

This method returns the compilation nodes that can be used to construct undercuts to the given argument.

Parameters:

arg - some argument.

Returns:

a set of compilation nodes.

subcuts

private void subcuts(DeductiveArgumentNode argNode,
                     java.util.Set<CompilationNode> remainingNodes,
                     CompilationNode current,
                     java.util.Set<PropositionalFormula> currentSupport,
                     ArgumentTree argTree)

This method recursively builds up the argument tree from the given argument.

Parameters:

arg - an argument.

remainingNodes - the non-visited nodes in the compilation.

current - the current node.

currentSupport - the union of the supports of the current path.

argTree - the argument tree.