@Override public QueryResult execABoxQuery(final Query q) { _results = new QueryResultImpl(q); _kb = q.getKB(); final long satCount = _kb.getABox().getStats()._satisfiabilityCount; final long consCount = _kb.getABox().getStats()._consistencyCount; exec(q, new ResultBindingImpl(), true); if (_logger.isLoggable(Level.FINE)) { _logger.fine("Total satisfiability operations: " + (_kb.getABox().getStats()._satisfiabilityCount - satCount)); _logger.fine("Total consistency operations: " + (_kb.getABox().getStats()._consistencyCount - consCount)); _logger.fine("Results of ABox query : " + _results); } return _results; } }
@Override public QueryResult execABoxQuery(final Query q) { _results = new QueryResultImpl(q); _kb = q.getKB(); final long satCount = _kb.getABox().getStats()._satisfiabilityCount; final long consCount = _kb.getABox().getStats()._consistencyCount; exec(q, new ResultBindingImpl(), true); if (_logger.isLoggable(Level.FINE)) { _logger.fine("Total satisfiability operations: " + (_kb.getABox().getStats()._satisfiabilityCount - satCount)); _logger.fine("Total consistency operations: " + (_kb.getABox().getStats()._consistencyCount - consCount)); _logger.fine("Results of ABox query : " + _results); } return _results; } }
@Override public QueryResult execABoxQuery(final Query q) { _results = new QueryResultImpl(q); _kb = q.getKB(); final long satCount = _kb.getABox().getStats()._satisfiabilityCount; final long consCount = _kb.getABox().getStats()._consistencyCount; exec(q, new ResultBindingImpl(), true); if (_logger.isLoggable(Level.FINE)) { _logger.fine("Total satisfiability operations: " + (_kb.getABox().getStats()._satisfiabilityCount - satCount)); _logger.fine("Total consistency operations: " + (_kb.getABox().getStats()._consistencyCount - consCount)); _logger.fine("Results of ABox query : " + _results); } return _results; } }
public void restoreLocal(final Individual ind, final Branch br) { _abox.getStats()._localRestores++; _abox.setClash(null); _abox.setBranchIndex(br.getBranchIndexInABox()); final Map<Node, Boolean> visited = new HashMap<>(); restoreLocal(ind, br.getBranchIndexInABox(), visited); for (final Map.Entry<Node, Boolean> entry : visited.entrySet()) { final boolean restored = entry.getValue(); if (restored) _allValuesRule.apply((Individual) entry.getKey()); } }
public void restoreLocal(final Individual ind, final Branch br) { _abox.getStats()._localRestores++; _abox.setClash(null); _abox.setBranchIndex(br.getBranchIndexInABox()); final Map<Node, Boolean> visited = new HashMap<>(); restoreLocal(ind, br.getBranchIndexInABox(), visited); for (final Map.Entry<Node, Boolean> entry : visited.entrySet()) { final boolean restored = entry.getValue(); if (restored) _allValuesRule.apply((Individual) entry.getKey()); } }
count = _kb.getABox().getStats()._consistencyCount; _logger.finer("Type checking for [" + format(n) + ", " + format(c) + "]..."); final String sign = _kb.getABox().getStats()._consistencyCount > count ? "+" : "-"; time = System.currentTimeMillis() - time; _logger.finer("done (" + (isType ? "+" : "-") + ") (" + sign + time + "ms)");
count = _kb.getABox().getStats()._consistencyCount; _logger.finer("Type checking for [" + format(n) + ", " + format(c) + "]..."); final String sign = _kb.getABox().getStats()._consistencyCount > count ? "+" : "-"; time = System.currentTimeMillis() - time; _logger.finer("done (" + (isType ? "+" : "-") + ") (" + sign + time + "ms)");
final ABoxStats stats = kb.getABox().getStats(); final long satCount = stats._satisfiabilityCount; final long consCount = stats._consistencyCount; _logger.fine("Total satisfiability operations: " + (kb.getABox().getStats()._satisfiabilityCount - satCount)); _logger.fine("Total consistency operations: " + (kb.getABox().getStats()._consistencyCount - consCount));
final ABoxStats stats = kb.getABox().getStats(); final long satCount = stats._satisfiabilityCount; final long consCount = stats._consistencyCount; _logger.fine("Total satisfiability operations: " + (kb.getABox().getStats()._satisfiabilityCount - satCount)); _logger.fine("Total consistency operations: " + (kb.getABox().getStats()._consistencyCount - consCount));
_logger.fine(() -> "Satisfiability Count: " + (_kb.getABox().getStats()._satisfiabilityCount - 2 * _kb.getClasses().size()));
final ABoxStats stats = kb.getABox().getStats(); final long satCount = stats._satisfiabilityCount; final long consCount = stats._consistencyCount; _logger.fine("Total satisfiability operations: " + (kb.getABox().getStats()._satisfiabilityCount - satCount)); _logger.fine("Total consistency operations: " + (kb.getABox().getStats()._consistencyCount - consCount));
@Override public void initialize(final Expressivity expressivity) { _mergeList.clear(); _mnx.add(null); // add a null entry so Branch._branch _index will match with the _index in this array assert _abox.size() == 1 : "This strategy can only be used with originally empty ABoxes"; _blocking = BlockingFactory.createBlocking(expressivity); final Individual root = _abox.getIndIterator().next(); applyUniversalRestrictions(root); _selfRule.apply(root); _mayNeedExpanding.add(root); _abox.setBranchIndex(1); _abox.getStats()._treeDepth = 1; _abox.setChanged(true); _abox.setComplete(false); _abox.setInitialized(true); }
@Override public void initialize(final Expressivity expressivity) { _mergeList.clear(); _mnx.add(null); // add a null entry so Branch._branch _index will match with the _index in this array assert _abox.size() == 1 : "This strategy can only be used with originally empty ABoxes"; _blocking = BlockingFactory.createBlocking(expressivity); final Individual root = _abox.getIndIterator().next(); applyUniversalRestrictions(root); _selfRule.apply(root); _mayNeedExpanding.add(root); _abox.setBranchIndex(1); _abox.getStats()._treeDepth = 1; _abox.setChanged(true); _abox.setComplete(false); _abox.setInitialized(true); }
_abox.getStats()._globalRestores++;
_logger.fine("Branch: " + _abox.getBranchIndex() + ", Depth: " + _abox.getStats()._treeDepth + ", Size: " + _abox.getNodes().size() + ", Mem: " + Runtime.getRuntime().freeMemory() / 1000 + "kb"); _abox.validate(); printBlocked();
_abox.getStats()._treeDepth = 1; _abox.setChanged(true); _abox.setComplete(false);
public static void assertSubClass(final KnowledgeBase kb, final ATermAppl c1, final ATermAppl c2, final boolean expectedSubClass) { boolean computedSubClass = kb.isSubClassOf(c1, c2); assertEquals("Subclass check failed for (" + ATermUtils.toString(c1) + " [= " + ATermUtils.toString(c2) + ")", expectedSubClass, computedSubClass); kb.isSatisfiable(c1); kb.isSatisfiable(not(c1)); kb.isSatisfiable(c2); kb.isSatisfiable(not(c2)); final long satCount = kb.getABox().getStats()._satisfiabilityCount; computedSubClass = kb.isSubClassOf(c1, c2); final boolean cached = satCount == kb.getABox().getStats()._satisfiabilityCount; assertEquals("Subclass check (Cached: " + cached + ") failed for (" + ATermUtils.toString(c1) + " [= " + ATermUtils.toString(c2) + ")", expectedSubClass, computedSubClass); } }
public static void assertSubClass(final KnowledgeBase kb, final ATermAppl c1, final ATermAppl c2, final boolean expectedSubClass) { boolean computedSubClass = kb.isSubClassOf(c1, c2); assertEquals("Subclass check failed for (" + ATermUtils.toString(c1) + " [= " + ATermUtils.toString(c2) + ")", expectedSubClass, computedSubClass); kb.isSatisfiable(c1); kb.isSatisfiable(not(c1)); kb.isSatisfiable(c2); kb.isSatisfiable(not(c2)); final long satCount = kb.getABox().getStats()._satisfiabilityCount; computedSubClass = kb.isSubClassOf(c1, c2); final boolean cached = satCount == kb.getABox().getStats()._satisfiabilityCount; assertEquals("Subclass check (Cached: " + cached + ") failed for (" + ATermUtils.toString(c1) + " [= " + ATermUtils.toString(c2) + ")", expectedSubClass, computedSubClass); } }