A new approach to modularity in rule-based programming

Browne, James C.; Emerson, Allen; Gouda, Mohamed G.; Miranker, Daniel P.; Mok, Aloysius K.; Bayerdo, R.; Chodrow, Sarah E.; Gadbois, David; Haddix, F.; Hetherington, T.W.; Obermeyer, Lance; Tsou, Duu-Chung; Wang, Chih-Kan; Wang, Rwo-Hsi

doi:10.1109/tai.1994.346518

Cited by 12 publications

(9 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As seen in Section 3.4, our lazy evaluation scheme is closely related to LEAPS. First introduced in [8], [15], LEAPS served as the basis for the Clips++ system [10], and its successor Venus [46]. Aside from the high-level reconstruction of [40], only little has been published on their implementation (apparent exception is [47], where the importance of fact indexing is stressed).…”

Section: Discussion and Related Workmentioning

confidence: 99%

Efficient Lazy Evaluation of Rule-Based Programs

Weert

2010

IEEE Trans. Knowl. Data Eng.

View full text Add to dashboard Cite

Thirty years after Forgy's seminal dissertation, Rete remains the de facto standard matching algorithm. Despite promising research results, alternative algorithms such as TREAT and LEAPS have had little impact on modern production rule engines. Constraint Handling Rules (CHR) is a high-level, declarative programming language, similar to production rules. In recent years, CHR has increasingly been used in a wide range of general-purpose applications. State-of-the-art CHR systems use LEAPS-like lazy matching, and implement a large body of novel program analyses and optimization techniques to further improve performance. While obviously related, CHR and production rules research have mostly evolved independently from each other. With this article, we aim to foster cross-fertilization of implementation techniques. We provide a lucid, comprehensive overview of CHR's rule evaluation methodology, and survey recent contributions to the field of lazy matching. Our empirical evaluation confirms Rete-based engines would surely benefit from incorporating similar techniques and optimizations.

show abstract

Section: Discussion and Related Workmentioning

confidence: 99%

Efficient Lazy Evaluation of Rule-Based Programs

Weert

2010

IEEE Trans. Knowl. Data Eng.

View full text Add to dashboard Cite

show abstract

“…Thus, benefits seen in extensible object-oriented optimizers developed by [It,213 with respect to the operator tree and cost model can be exploited identically. l A well structured rule environment that operates within fixedpoint semantics [3]. Venus' main execution unit is a parameterlzed module.…”

Section: Venusmentioning

confidence: 99%

“…In some circumstances, a non-deterministic selection of satisfied rules makes programming difficult 1171. For the convenience of the programmer, Venus does include several procedural constructs; the details are beyond the scope of this paper [3,20]. These constructs were admitted to the language only if there was clear need and an obvious macro-like expansion into an equivalent non-deterministic program.…”

Section: Syntaxmentioning

confidence: 99%

See 1 more Smart Citation

Rule-based query optimization, revisited

Warshaw

Miranker

1999

Proceedings of the Eighth International Conference on Information and Knowledge Management

View full text Add to dashboard Cite

We present the architecture and a performance assessment of an extensible query optimizer written in Venus. Venus is a generalpurpose active-database rule language embedded in C++. Following the developments in extensible database query optimizers, first in rule-based form, followed by optimizers written as object-oriented programs, the Venus-based optimizer avails to the advantages of both. Venus' modular structure allows us to go a step further and provide extensibility in search by defining parameterized search components in a declarative form that has the additional effect of integrating heuristic and cost-based optimization. We compare optimizers developed with Volcano, OPI++ and Venus. Venus' optimizing compiler yields code whose performance is comparable with Volcano and OPT++ on smaller queries. The ability to introduce additional pruning heuristics yields better scalability on larger queries. Evaluation of the system using quantitative software metrics supports a claim that the Venusbased optimizer is more easily maintained and extended than are its predecessors.

show abstract

“…Software engineering research early identified information hiding and abstraction [85] as basic principles that have influenced the development of struc-tured programming, modules, classes, and components, all of which provide mechanisms to structure software systems. These ideas are an integral part of request/reply-based distributed systems, e.g., Corba [76], and are also used in coordination models [68,81] and rule systems [15]. However, these approaches either do not follow the event-based model of cooperation or do not address distributed scenarios.…”

Section: Introductionmentioning

confidence: 99%

Modular event-based systems

Fiege

Mühl

Gärtner

2002

The Knowledge Engineering Review

View full text Add to dashboard Cite

Event-based systems are developed and used to integrate components in loosely coupled systems. Research and product development have focused so far on efficiency issues but neglected methodological support to build such systems. In this article, the modular design and implementation of an event system is presented which supports scopes and event mappings, two new and powerful structuring methods that facilitate engineering and coordination of components in event-based systems. We give a formal specification of scopes and event mappings within a trace-based formalism adapted from temporal logic. This is complemented by a comprehensive introduction to the event-based style, its benefits and requirements.

show abstract

A new approach to modularity in rule-based programming

Cited by 12 publications

References 6 publications

Efficient Lazy Evaluation of Rule-Based Programs

Efficient Lazy Evaluation of Rule-Based Programs

Rule-based query optimization, revisited

Modular event-based systems

Contact Info

Product

Resources

About