COROR: A COmposable Rule-entailment Owl ... - Defeasible Logic

More documents

Recommendations

Info

Two-phase RETE algorithm • The two-phase RETE algorithm uses an interrupted RETE construction mechanism to build a customized RETE network. • The alpha network is constructed • Common condition node sharing • RETE construction is interrupted by an initial fact matching after the construction of the alpha network to collect some information about the ontology, e.g. • Number of partially matched facts for each condition node (in use), • Selectivity between two joining alpha nodes (potential), • and etc. • Rather than applied beta network optimization heuristics directly, they are applied using the collected information to construct a customized beta network, i.e. • Most specific condition first • The number of partially matched facts for each condition node is used as its specificity. • Connectivity 8
An example (?v owl:someValuesFrom ?w), (?v owl:onProperty ?p), (?u ?p ?x), (?x rdf:type ?w) (?u rdf:type ?v) Fact base Facts Alpha network v someValuesFrom w v onProperty p u p x x type w
Page 1 and 2: COROR: A COmposable Rule-entailment
Page 3 and 4: Example • Context addressable mes
Page 5 and 6: COROR: an overview • COROR is a C
Page 7: A short introduction to RETE • RE
Page 11 and 12: An example (?v owl:someValuesFrom ?
Page 13 and 14: Implementation • COROR is impleme
Page 15 and 16: Experiment results (memory-1) Memor
Page 17 and 18: Experiment results (memory-2, Coror
Page 19 and 20: Discussion based on the empirical r
Page 21 and 22: Thank you Questions? 21
Page 23: An analytical comparison between co

COROR: A COmposable Rule-entailment Owl ... - Defeasible Logic

Create successful ePaper yourself

Delete template?

Save as template?