Matches in ScholarlyData for { ?s ?p ?o. }
- authorList hasLastItem item-4.
- item-1 type ListItem.
- item-1 hasContent darko-anicic.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent sebastian-rudolph.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent paul-fodor.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent nenad-stojanovic.
- item-4 previous item-3.
- 27 creator darko-anicic.
- 27 creator nenad-stojanovic.
- 27 creator paul-fodor.
- 27 creator sebastian-rudolph.
- 27 type InProceedings.
- 27 label "A Declarative Framework for Matching Iterative and Aggregative Patterns against Event Streams".
- 27 sameAs 27.
- 27 abstract "Complex Event Processing as well as pattern matching against streams have become important in many areas including financial services, mobile devices, sensor-based applications, click stream analysis, real-time processing in Web 2.0 and 3.0 applications and so forth. However, there is a number of issues to be considered in order to enable effective pattern matching in modern applications. A language for describing patterns needs to feature a well-dened semantics. It needs be rich enough to express important classes of complex patterns such as iterative and aggregative patterns. Event processing systems should be able to match patterns based on the semantic relations between events (not only their temporal relationships). Finally as event processing is a real-time processing, the language execution model needs to be efficient. In this paper, we present an event processing framework which includes an expressive language and a corresponding execution model. The language features a precise semantics that is dened also for iterative and aggregative patterns. Our approach is based on a logic, hence we analyse deductive capabilities of such an event processing framework. We believe that event processing together with inference capabilities can provide a powerful real-time intelligence (that is currently missing in related approaches). We provide an open source implementation and present experimental results of our running system.".
- 27 hasAuthorList authorList.
- 27 isPartOf proceedings.
- 27 keyword "Complex Event Processing".
- 27 keyword "Reasoning".
- 27 keyword "Rule-based Event Processing".
- 27 title "A Declarative Framework for Matching Iterative and Aggregative Patterns against Event Streams".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasItem item-4.
- authorList hasLastItem item-4.
- item-1 type ListItem.
- item-1 hasContent darko-anicic.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent sebastian-rudolph.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent paul-fodor.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent nenad-stojanovic.
- item-4 previous item-3.
- 28 creator antoni-ligeza.
- 28 creator grzegorz-j-nalepa.
- 28 creator krzysztof-kaczor.
- 28 creator szymon-bobek.
- 28 type InProceedings.
- 28 label "HalVA - Rule Analysis Framework for XTT2 Rules".
- 28 sameAs 28.
- 28 abstract "Quality issues are important in both deployment and maintenance of rule bases. In case of rule-based systems where certain level of rule language formalization is introduced, it is possible to consider formal analysis approaches. In fact, this has been a well-researched field in 90'. Apparently, the recent growth of popularity of rule solutions does not include development of effective analysis tools. In the paper an extended knowledge representation for rules called XTT is considered. It is based on the concepts of rule design using knowledge units grouping rules working in the same context. XTT is a formalized rule language based on an expressive logic called ALSV(FD). A custom runtime and analysis tool for XTT has been created. In the paper the rule analysis framework called HAlVA is described. It allows for verification of certain formal properties of rules, including rule subsumption or determinism. In fact, it is an extensible solution, where adding new analysis modules is possible. In the paper selected implementation details of the framework are presented.".
- 28 hasAuthorList authorList.
- 28 isPartOf proceedings.
- 28 keyword "formal verification".
- 28 keyword "rule analysis".
- 28 keyword "rule engine".
- 28 title "HalVA - Rule Analysis Framework for XTT2 Rules".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasItem item-4.
- authorList hasLastItem item-4.
- item-1 type ListItem.
- item-1 hasContent grzegorz-j-nalepa.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent szymon-bobek.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent antoni-ligeza.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent krzysztof-kaczor.
- item-4 previous item-3.
- 29 creator antoni-ligeza.
- 29 creator grzegorz-j-nalepa.
- 29 creator krzysztof-kaczor.
- 29 creator szymon-bobek.
- 29 type InProceedings.
- 29 label "Algorithms for Rule Inference in Modularized Rule Bases".
- 29 sameAs 29.
- 29 abstract "In the paper an extended knowledge representation for rules is considered. It is called Extended Tabular Trees (XTT2) and it provides a network of decision tables. It is based on the concepts of rule design using knowledge units grouping rules working in the same context. The units are linked into an inference network, where a number of inference options are considered. The original contribution of the paper is the proposal and formalization of several different inference algorithms working on the same rule base. The algorithms include both forward-chaining and goal-driven inference. Such an approach allows for a more flexible rule design and deployment, since the same knowledge base may be used in different ways, depending on the application.".
- 29 hasAuthorList authorList.
- 29 isPartOf proceedings.
- 29 keyword "rule engine".
- 29 keyword "rule inference".
- 29 keyword "rule modularization".
- 29 title "Algorithms for Rule Inference in Modularized Rule Bases".
- authorList type List.