Reordering Query and Rule Patterns for Query Answering in a Rete-Based Inference Engine

Ünalır, Murat Osman; Özacar, Tuğba; Öztürk, Övünç

doi:10.1007/11581116_27

Cited by 5 publications

(2 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Although Rete is an optimized forward chaining algorithm, we use a hybrid heuristic to gain extra performance. This hybrid heuristic [6] optimizes Rete algorithm by mixing and modifying some well known optimization heuristics [7]. This section introduces these heuristics and their hybrid usage.…”

Section: Heuristics and Their Hybrid Usagementioning

confidence: 99%

Optimizing a Rete-based Inference Engine using a Hybrid Heuristic and Pyramid based Indexes on Ontological Data

Özacar¹,

Öztürk²,

Ünalır³

2007

JCP

Self Cite

View full text Add to dashboard Cite

This paper describes indexing of ontological data to reduce the memory consumption of a Rete- based reasoner whose time performance is increased using a hybrid optimization heuristic. The aforementioned indexing mechanism is known as the Pyramid Technique. Our work organizes three dimensional ontological data in a way that works efficiently with this indexing mechanism and it constructs a subset of the querying scheme of the Pyramid Technique that supports querying ontological data. This work also implements an optimization on the Pyramid Technique. Finally, it represents the progress in the memory consumption of the reasoner.

show abstract

Section: Heuristics and Their Hybrid Usagementioning

confidence: 99%

Optimizing a Rete-based Inference Engine using a Hybrid Heuristic and Pyramid based Indexes on Ontological Data

Özacar¹,

Öztürk²,

Ünalır³

2007

JCP

Self Cite

View full text Add to dashboard Cite

show abstract

“…We also applied the model on a RETE based inference engine [9], with Lehigh University Benchmark (LUBM) in order to exemplify utilization of the model [10]. LUBM is developed to evaluate the inference and query performance of semantic web repositories over a large data set.…”

Section: Evaluation Of the Utilization Rate With Large Scale Ontologiesmentioning

confidence: 99%

Reducing the Inferred Type Statements with Individual Grouping Constructs

Öztürk

Özacar

Ünalır

2006

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract.A common approach for reasoning is to compute the deductive closure of an ontology using the rules specified and to work on the closure at query time. This approach reduces the run time complexity but increases the space requirements. The main reason of this increase is the type and subclass statements in the ontology. Type statements show a significant percentage in most ontologies. Since subclass is a transitive property, derivation of other statements, in particular type statements relying on it, gives rise to cyclic repetition and an excess of inferred type statements. In brief, a major part of closure computation is deriving the type statements relying on subclass statements. In this paper, we propose a syntactic transformation that is based on novel individual grouping constructs. This transformation reduces the number of inferred type statements relying on subclass relations. Thus, the space requirement of reasoning is reduced without affecting the soundness and the completeness.

show abstract