Examples with AnalyzedProgram at.ac.tuwien.kr.alpha.core.programs.AnalyzedProgram used on opensource projects

Example 6 with AnalyzedProgram

use of at.ac.tuwien.kr.alpha.core.programs.AnalyzedProgram in project Alpha by alpha-asp.

the class StratificationAlgorithmTest method avoidDuplicatesTest1.

@Test
public void avoidDuplicatesTest1() {
    StringBuilder bld = new StringBuilder();
    bld.append("b :- a.");
    bld.append("c :- b.");
    bld.append("c :- a.");
    ASPCore2Program prog = parser.parse(bld.toString());
    NormalProgram normalProg = normalizeTransform.apply(prog);
    AnalyzedProgram analyzed = AnalyzedProgram.analyzeNormalProgram(normalProg);
    DependencyGraph dg = analyzed.getDependencyGraph();
    ComponentGraph cg = ComponentGraphImpl.buildComponentGraph(dg, StronglyConnectedComponentsAlgorithm.findStronglyConnectedComponents(dg));
    List<SCComponent> strata = StratificationAlgorithm.calculateStratification(cg);
    Predicate a = Predicates.getPredicate("a", 0);
    Predicate b = Predicates.getPredicate("b", 0);
    Predicate c = Predicates.getPredicate("c", 0);
    assertTrue(predicateIsBeforePredicateInOrder(a, b, strata));
    assertTrue(predicateIsBeforePredicateInOrder(b, c, strata));
    assertTrue(predicateIsBeforePredicateInOrder(a, c, strata));
    assertEquals(3, strata.size());
}

Example 7 with AnalyzedProgram

use of at.ac.tuwien.kr.alpha.core.programs.AnalyzedProgram in project Alpha by alpha-asp.

the class StratificationAlgorithmTest method stratifyOneRuleTest.

@Test
public void stratifyOneRuleTest() {
    ASPCore2Program prog = parser.parse("a :- b.");
    NormalProgram normalProg = normalizeTransform.apply(prog);
    AnalyzedProgram analyzed = AnalyzedProgram.analyzeNormalProgram(normalProg);
    DependencyGraph dg = analyzed.getDependencyGraph();
    ComponentGraph cg = ComponentGraphImpl.buildComponentGraph(dg, StronglyConnectedComponentsAlgorithm.findStronglyConnectedComponents(dg));
    List<SCComponent> strata = StratificationAlgorithm.calculateStratification(cg);
    Predicate a = Predicates.getPredicate("a", 0);
    Predicate b = Predicates.getPredicate("b", 0);
    assertEquals(2, strata.size());
    assertTrue(predicateIsBeforePredicateInOrder(b, a, strata));
}

Example 8 with AnalyzedProgram

use of at.ac.tuwien.kr.alpha.core.programs.AnalyzedProgram in project Alpha by alpha-asp.

the class DependencyGraphImplTest method reachabilityWithCyclesTest.

@Test
public void reachabilityWithCyclesTest() {
    StringBuilder bld = new StringBuilder();
    bld.append("b :- a, f1.").append("\n");
    bld.append("c :- b.").append("\n");
    bld.append("d :- c.").append("\n");
    bld.append("a :- d.").append("\n");
    bld.append("x :- d, f1.");
    ASPCore2Program prog = parser.parse(bld.toString());
    NormalProgram normalProg = normalizeTransform.apply(prog);
    AnalyzedProgram analyzed = AnalyzedProgram.analyzeNormalProgram(normalProg);
    DependencyGraph dg = analyzed.getDependencyGraph();
    Node a = dg.getNodeForPredicate(Predicates.getPredicate("a", 0));
    Node b = dg.getNodeForPredicate(Predicates.getPredicate("b", 0));
    Node c = dg.getNodeForPredicate(Predicates.getPredicate("c", 0));
    Node d = dg.getNodeForPredicate(Predicates.getPredicate("d", 0));
    Node f1 = dg.getNodeForPredicate(Predicates.getPredicate("f1", 0));
    Node x = dg.getNodeForPredicate(Predicates.getPredicate("x", 0));
    Node notInGraph = new NodeImpl(Predicates.getPredicate("notInGraph", 0));
    assertTrue(DependencyGraphUtils.isReachableFrom(d, a, dg));
    assertTrue(DependencyGraphUtils.isReachableFrom(c, a, dg));
    assertTrue(DependencyGraphUtils.isReachableFrom(b, a, dg));
    assertTrue(DependencyGraphUtils.isReachableFrom(a, a, dg));
    assertTrue(DependencyGraphUtils.isReachableFrom(d, b, dg));
    assertTrue(DependencyGraphUtils.isReachableFrom(c, b, dg));
    assertTrue(DependencyGraphUtils.isReachableFrom(b, b, dg));
    assertTrue(DependencyGraphUtils.isReachableFrom(d, c, dg));
    assertTrue(DependencyGraphUtils.isReachableFrom(c, c, dg));
    assertTrue(DependencyGraphUtils.isReachableFrom(a, d, dg));
    assertTrue(DependencyGraphUtils.isReachableFrom(a, c, dg));
    assertTrue(DependencyGraphUtils.isReachableFrom(a, b, dg));
    assertTrue(DependencyGraphUtils.isReachableFrom(x, f1, dg));
    assertTrue(DependencyGraphUtils.isReachableFrom(c, f1, dg));
    assertFalse(DependencyGraphUtils.isReachableFrom(notInGraph, a, dg));
}

Example 9 with AnalyzedProgram

use of at.ac.tuwien.kr.alpha.core.programs.AnalyzedProgram in project Alpha by alpha-asp.

the class DependencyGraphImplTest method stronglyConnectedComponentsSimpleTest.

@Test
public void stronglyConnectedComponentsSimpleTest() {
    StringBuilder bld = new StringBuilder();
    bld.append("b :- a.").append("\n");
    bld.append("a :- b.").append("\n");
    ASPCore2Program prog = parser.parse(bld.toString());
    NormalProgram normalProg = normalizeTransform.apply(prog);
    AnalyzedProgram analyzed = AnalyzedProgram.analyzeNormalProgram(normalProg);
    DependencyGraph dg = analyzed.getDependencyGraph();
    Node a = dg.getNodeForPredicate(Predicates.getPredicate("a", 0));
    Node b = dg.getNodeForPredicate(Predicates.getPredicate("b", 0));
    List<Node> componentA = new ArrayList<>();
    componentA.add(a);
    assertTrue(DependencyGraphUtils.areStronglyConnected(componentA, dg));
    assertFalse(DependencyGraphUtils.isStronglyConnectedComponent(componentA, dg));
    List<Node> componentB = new ArrayList<>();
    componentB.add(b);
    assertTrue(DependencyGraphUtils.areStronglyConnected(componentB, dg));
    assertFalse(DependencyGraphUtils.isStronglyConnectedComponent(componentB, dg));
    List<Node> componentAll = new ArrayList<>();
    componentAll.add(a);
    componentAll.add(b);
    assertTrue(DependencyGraphUtils.areStronglyConnected(componentAll, dg));
    assertTrue(DependencyGraphUtils.isStronglyConnectedComponent(componentAll, dg));
}

Example 10 with AnalyzedProgram

use of at.ac.tuwien.kr.alpha.core.programs.AnalyzedProgram in project Alpha by alpha-asp.

the class DependencyGraphImplTest method stronglyConnectedComponentsMultipleComponentsTest.

@Test
public void stronglyConnectedComponentsMultipleComponentsTest() {
    String inputProgram = "f0.\n" + "f1.\n" + "f2.\n" + "f3.\n" + "a :- f0, f1, not b.\n" + "b :- f0, f1, not a.\n" + "c :- f2, f3, not d.\n" + "d :- f2, f3, not c.\n" + "x :- a, c, y.\n" + "y :- b, d, x.\n" + "z :- x, y, z.";
    ASPCore2Program prog = parser.parse(inputProgram);
    NormalProgram normalProg = normalizeTransform.apply(prog);
    AnalyzedProgram analyzed = AnalyzedProgram.analyzeNormalProgram(normalProg);
    DependencyGraph dg = analyzed.getDependencyGraph();
    Node f0 = dg.getNodeForPredicate(Predicates.getPredicate("f0", 0));
    Node f1 = dg.getNodeForPredicate(Predicates.getPredicate("f1", 0));
    Node f2 = dg.getNodeForPredicate(Predicates.getPredicate("f2", 0));
    Node f3 = dg.getNodeForPredicate(Predicates.getPredicate("f3", 0));
    Node a = dg.getNodeForPredicate(Predicates.getPredicate("a", 0));
    Node b = dg.getNodeForPredicate(Predicates.getPredicate("b", 0));
    Node c = dg.getNodeForPredicate(Predicates.getPredicate("c", 0));
    Node d = dg.getNodeForPredicate(Predicates.getPredicate("d", 0));
    Node x = dg.getNodeForPredicate(Predicates.getPredicate("x", 0));
    Node y = dg.getNodeForPredicate(Predicates.getPredicate("y", 0));
    Node z = dg.getNodeForPredicate(Predicates.getPredicate("z", 0));
    StronglyConnectedComponentsAlgorithm.SccResult sccResult = StronglyConnectedComponentsAlgorithm.findStronglyConnectedComponents(dg);
    Map<Node, Integer> nodesByComponent = sccResult.nodesByComponentId;
    List<List<Node>> stronglyConnectedComponents = sccResult.stronglyConnectedComponents;
    assertEquals(8, stronglyConnectedComponents.size());
    for (int i = 0; i < stronglyConnectedComponents.size(); i++) {
        List<Node> stronglyConnectedComponent = stronglyConnectedComponents.get(i);
        assertTrue(DependencyGraphUtils.isStronglyConnectedComponent(stronglyConnectedComponent, dg));
        for (Node node : stronglyConnectedComponent) {
            assertEquals(Integer.valueOf(i), nodesByComponent.get(node));
        }
    }
    List<Node> c1 = new ArrayList<>();
    c1.add(a);
    c1.add(b);
    assertTrue(DependencyGraphUtils.isStronglyConnectedComponent(c1, dg));
    assertEquals(nodesByComponent.get(a), nodesByComponent.get(b));
    List<Node> c2 = new ArrayList<>();
    c2.add(c);
    c2.add(d);
    assertTrue(DependencyGraphUtils.isStronglyConnectedComponent(c2, dg));
    assertEquals(nodesByComponent.get(c), nodesByComponent.get(d));
    List<Node> c3 = new ArrayList<>();
    c3.add(x);
    c3.add(y);
    assertTrue(DependencyGraphUtils.isStronglyConnectedComponent(c3, dg));
    assertEquals(nodesByComponent.get(x), nodesByComponent.get(y));
    List<Node> c4 = new ArrayList<>();
    c4.add(z);
    assertTrue(DependencyGraphUtils.isStronglyConnectedComponent(c4, dg));
    List<Node> c5 = new ArrayList<>();
    c5.add(f0);
    assertTrue(DependencyGraphUtils.isStronglyConnectedComponent(c5, dg));
    List<Node> c6 = new ArrayList<>();
    c6.add(f1);
    assertTrue(DependencyGraphUtils.isStronglyConnectedComponent(c6, dg));
    List<Node> c7 = new ArrayList<>();
    c7.add(f2);
    assertTrue(DependencyGraphUtils.isStronglyConnectedComponent(c7, dg));
    List<Node> c8 = new ArrayList<>();
    c8.add(f3);
    assertTrue(DependencyGraphUtils.isStronglyConnectedComponent(c8, dg));
}