Â¥Ö÷

[ÇóÖú]ÇëÎÊÔÚJenaÖÐÈçºÎ½«RuleÌí¼Óµ½ÒÑÓеÄreasonerÖУ¿ OntModelĬÈϵÄReasoner£¬ÈçºÎ½«½¨ºÃµÄRuleÌí¼Óµ½¸ÃReasonerÖУ¿    Êղؠ  ·ÖÏí   ¶¥(0)

	µÚ2Â¥

As an illustration suppose that we have a raw data model which asserts three triples: eg:A eg:p eg:B . eg:B eg:p eg:C . eg:C eg:p eg:D . and suppose that we have a trivial rule set which computes the transitive closure over relation eg:p     String rules = "[rule1: (?a eg:p ?b) (?b eg:p ?c) -> (?a eg:p ?c)]";     Reasoner reasoner = new GenericRuleReasoner(Rule.parseRules(rules));     reasoner.setDerivationLogging(true);     InfModel inf = ModelFactory.createInfModel(reasoner, rawData); Then we can query whether eg:A is related through eg:p to eg:D and list the derivation route using the following code fragment:     PrintWriter out = new PrintWriter(System.out);     for (StmtIterator i = inf.listStatements(A, p, D); i.hasNext(); ) {         Statement s = i.nextStatement();         System.out.println("Statement is " + s);         for (Iterator id = inf.getDerivation(s); id.hasNext(); ) {             Derivation deriv = (Derivation) id.next();             deriv.printTrace(out, true);         }     }     out.flush(); Which generates the output: Statement is [urn:x-hp:eg/A, urn:x-hp:eg/p, urn:x-hp:eg/D] Rule rule1 concluded (eg:A eg:p eg:D) <-     Fact (eg:A eg:p eg:B)     Rule rule1 concluded (eg:B eg:p eg:D) <-         Fact (eg:B eg:p eg:C)         Fact (eg:C eg:p eg:D)

	µÚ3Â¥

ʲô½Ð°ÉruleÌí¼Óµ½reasonerÀïÃ棿

	µÚ4Â¥

jpz6311whu ˵µÄÊǹ¹½¨a raw data model which asserts three triples: eg:A eg:p eg:B . eg:B eg:p eg:C . eg:C eg:p eg:D . ÇëÎÊ£¬ÈçºÎ½«ÒÑÓÐOWLÎļþ°ó¶¨µ½REASONER£¬ÓÃ×Ô½¨JENAµÄRULEÀ´½øÐÐÍÆÀíÄØ£¿ ¼±¼±£¡£¡£¡£¡ Çë˵ÏêϸЩ£¬Ð»Ð»

	µÚ5Â¥

°ÑrawData»»³É¡°ÒÑÓÐOWLÎļþ¡±¼´¿É