graphReachability

gapt.examples.predicateEliminationProblems.graphReachability

Attributes

Source
predicateEliminationProblems.scala
Graph
Supertypes
class Object
trait Matchable
class Any
Self type

Members list

Value members

Concrete methods

def apply(size: Int, mustContain: Int, mustAvoid: Int, edges: (Int, Int)*): ClauseSetPredicateEliminationProblem
def const(node: Int): FOLConst
def edge(from: Int, to: Int): Atom
def existsPath(from: Int, to: Int, length: Int): FOLFormula
def graph(size: Int, edges: (Int, Int)*): Set[HOLClause]