Skip to main content

2008 | Buch

Rule Representation, Interchange and Reasoning on the Web

International Symposium, RuleML 2008, Orlando, FL, USA, October 30-31, 2008. Proceedings

herausgegeben von: Nick Bassiliades, Guido Governatori, Adrian Paschke

Verlag: Springer Berlin Heidelberg

Buchreihe : Lecture Notes in Computer Science

insite
SUCHEN

Über dieses Buch

The 2008 International Symposium on Rule Interchange and Applications (RuleML th 2008), collocated in Orlando, Florida, with the 11 International Business Rules - rum, was the premier place to meet and to exchange ideas from all fields of rules te- nologies. The aim of RuleML 2008 was both to present new and interesting research results and to show successfully deployed rule-based applications. This annual sym- sium is the flagship event of the Rule Markup and Modeling Initiative (RuleML). The RuleML Initiative (www.ruleml.org) is a non-profit umbrella organization of several technical groups organized by representatives from academia, industry and government working on rule technologies and applications. Its aim is to promote the study, research and application of rules in heterogeneous distributed environments such as the Web. RuleML maintains effective links with other major international societies and acts as intermediary between various ‘specialized’ rule vendors, appli- tions, industrial and academic research groups, as well as standardization efforts from, for example, W3C, OMG, and OASIS.

Inhaltsverzeichnis

Frontmatter

Keynote Talks (Abstracts)

Rule Interchange Format: The Framework
(Extended Abstract)
Abstract
The Rule Interchange Format (RIF) activity within the World Wide Web Consortium (W3C) aims to develop a standard for exchanging rules among disparate systems, especially on the Semantic Web. The need for rule-based information processing on the Web has been felt ever since RDF was introduced in the late 90’s. As ontology development picked up pace this decade and as the limitations of OWL became apparent, rules were firmly put back on the agenda. RIF is therefore a major opportunity for the introduction of rule based technologies into the main stream of knowledge representation and information processing on the Web.
Michael Kifer
The Power of Events: An Introduction to Complex Event Processing in Distributed Enterprise Systems
Abstract
Complex Event Processing (CEP) is a defined set of tools and techniques for analyzing and controlling the complex series of interrelated events that drive modern distributed information systems. This emerging technology helps IS and IT professionals understand what is happening within the system, quickly identify and solve problems, and more effectively utilize events for enhanced operation, performance, and security. CEP can be applied to a broad spectrum of information system challenges, including business process automation, schedule and control processes, network monitoring and performance prediction, and intrusion detection.
This talk is about the rise of CEP as we know it today, its historical roots and its current position in commercial markets. Some possible long-term future roles of CEP in the Information Society are discussed along with the need to develop rule-based event hierarchies on a commercial basis to make those applications possible. The talk gives empahsis to the point that “Rules are everywhere” and that mathematical formalisms cannot express all the forms that are in use in various event processing systems.
David Luckham
Event and Process Semantics Will Rule
Abstract
The convergence of business rules with business process management (BPM) has been predicted for many years and is now a matter of fact. Every major BPM vendor has incorporated or acquired rules technology within their products and platforms. However, most rules offerings are only loosely integrated with processes at the task level. The use of business rules remains largely confined to managing isolated decisions services. Weak integration and isolation effectively relegates rules to an implementing role rather than a first class citizen in the capture and management of enterprise knowledge.
As the largest vendors bring their rules offerings to market and as standards from the W3C and OMG mature to adequacy, the opportunity for vendor-agnostic business rules management systems (BRMS) approaches. And continued improvement in end-user accessibility of BRMS promises ever less technical and ever more semantic expression and management of enterprise knowledge, including process and service models in addition to data models and business rules.
Paul Haley

Rule Engineering

Development and Verification of Rule Based Systems — A Survey of Developers
Abstract
While there is great interest in rule based systems and their development, there is little data about the tools and methods used and the issues facing the development of these systems. To address this deficiency, this paper presents the results from a survey of developers of rule based systems.
The results from the survey give an overview of the methods and tools used for development and the major issues hindering the development of rule based systems. Recommendations for possible future research directions are presented.
The results point to verification and validation, debugging and overall tool support as the main issues negatively affecting the development of rule based systems. Further a lack of methodologies that appropriately support developers of these systems was found.
Valentin Zacharias
Connecting Legacy Code, Business Rules and Documentation
Abstract
By using several reverse engineering tools and techniques, it is possible to extract business rules from legacy source code that are easy to understand by the non-IT experts. To make this information usable to business analysts, it is necessary to connect the artifacts extracted to existing documents. In this paper, we present how we use source code analysis and keyphrase extraction techniques to connect legacy code, business rules and documentation.
Erik Putrycz, Anatol W. Kark
Verifying Resource Requirements for Distributed Rule-Based Systems
Abstract
Rule-based systems are rapidly becoming an important component of ‘mainstream’ computing technologies, for example in business process modelling, the semantic web, sensor networks etc. However, while rules provide a flexible way of implementing such systems, the resulting system behaviour and the resources required to realise it can be difficult to predict. In this paper we consider the verification of system behaviour and resource requirements for distributed rule-based systems. More specifically, we consider distributed problem-solving in systems of communicating rule-based systems, and ask how much time (measured as the number of rule firings) and message exchanges does it take the system to find a solution. We show how standard model-checking technology can be used to verify resource requirements for such systems, and present preliminary results which highlight complex tradeoffs between time and communication bounds.
Natasha Alechina, Brian Logan, Nguyen Hoang Nga, Abdur Rakib
Meta-analysis for Validation and Strategic Planning
Abstract
This paper presents framework to support design of meta-rule constructs. A prototype is described towards the application of credit analysis. The focus of this system is to define a higher level of inference that will guide pre-established object-level rule constructs. This architecture is supported by the incorporation of machine-learning (ML) techniques to support the acquisition of business rule-based knowledge. This knowledge is applied to specific parameters that ultimately guide an object level decision making process. By developing this process of automated knowledge acquisition, we are interested in up front actions including validation and support of intended responses. We also intend to further classify and categorize this acquired knowledge to support future policy modifications.
David A. Ostrowski

Rule-Based Methodologies and Applications in Policies, Electronic Contracts and Security

Abductive Workflow Mining Using Binary Resolution on Task Successor Rules
Abstract
The notion of abductive workflow mining is introduced, which refers to the process of discovering important workflows from event logs that are believed to cause or explain certain behaviour. The approach is based on the notion of abductive reasoning, where hypotheses are found that, if added to a rule base, would necessarily cause an observation to be true. We focus on the instance of workflow mining where there are critical tasks in the underlying process that, if observed, must be scrutinized more diligently to ensure that they are sufficiently motivated and executed under acceptable circumstances. Abductive workflow mining is then the process of determining activity that would necessarily imply that the critical activity should take place. Whenever critical activity is observed, one can then inspect the abductive workflow to ascertain whether there was sufficient reason for the critical activity to occur. To determine such workflows, we mine recorded log activity for task successor rules, which indicate which tasks succeed other tasks in the underlying process. Binary resolution is then applied to find the abductive explanations for a given activity. Preliminary experiments show that relatively small and concise abductive workflow models can be constructed, in comparison with constructing a complete model for the entire log.
Scott Buffett
A Rule-Based Framework Using Role Patterns for Business Process Compliance
Abstract
In view of recent business scandals that prompted the Sarbanes-Oxley legislation, there is a greater need for businesses to develop systematic approaches to designing business processes that comply with organizational policies. Moreover, it should be possible to express the policy and relate it to a given process in a descriptive or declarative manner. In this paper we propose role patterns, and show how they can be associated with generic task categories and processes in order to meet standard requirements of internal control principles in businesses. We also show how the patterns can be implemented using built-in constraints in a logic-based language like Prolog. While the role patterns are general, this approach is flexible and extensible because user-defined constraints can also be asserted in order to introduce additional requirements as dictated by business policy. The paper also discusses control requirements of business processes, and explores the interactions between role based access control (RBAC) mechanisms and workflows.
Akhil Kumar, Rong Liu
Detection of Suspicious Activity Using Different Rule Engines — Comparison of BaseVISor, Jena and Jess Rule Engines
Abstract
In this paper we present our experience working on the problem of detecting suspicious activity using OWL ontologies and inference rules. For this purpose we implemented partial solutions using three different rule engines - BaseVISor, Jena and Jess. Each of them required different levels of effort and each had its strengths and weaknesses. We describe our impressions from working with each engine, focusing on the ease of writing and reading rules, support for RDF-based documents, support for different methods of reasoning and interoperability.
Jakub Moskal, Christopher J. Matheus
A Rule-Based Notation to Specify Executable Electronic Contracts
Abstract
This paper presents a notation to specify executable electronic contracts to monitor compliance and/or enforcement of business-to-business interactions. A notable feature is that the notation takes into account the distributed nature of the underlying computations by paying due attention to timing and message validity constraints as well as the impact of exceptions/failures encountered during business interactions.
Massimo Strano, Carlos Molina-Jimenez, Santosh Shrivastava

Rule Representation Languages and Reasoning Engines

On Extending RuleML for Modal Defeasible Logic
Abstract
In this paper we present a general methodology to extend Defeasible Logic with modal operators. We motivate the reasons for this type of extension and we argue that the extension will allow for a robust knowledge framework in different application areas. The paper presents an extension of RuleML to capture Modal Defeasible Logic.
Duy Hoang Pham, Guido Governatori, Simon Raboczi, Andrew Newman, Subhasis Thakur
Adding Uncertainty to a Rete-OO Inference Engine
Abstract
The RETE algorithm has been used to implement first-order logic based inference engines and its object-oriented extension allows to reason directly over entities rather than predicates. One of the limitations of FOL is its inability to deal with uncertainty, although it exists in many forms and it is typical of the way humans reason. In this paper, the steps of a general uncertain reasoning are outlined, without choosing a specific type or representation of uncertainty. Then, the process is translated into a further extension of the RETE networks, showing a possible architecture allowing a Rete-OO based engine to reason with uncertain rules. This architecture is being implemented in the Drools rule engine.
Davide Sottara, Paola Mello, Mark Proctor
Programming with Fuzzy Logic Rules by Using the FLOPER Tool
Abstract
The “Fuzzy LOgic Programming Environment for Research”, FLOPER in brief, that we have implemented in our research group, is intended to help the development of rule-based applications supporting fuzzy logic and approximated reasoning. The system is able to directly translate a powerful kind of fuzzy logic programs (belonging to the so-called multi-adjoint logic approach) into Prolog code which can be directly executed inside any standard Prolog interpreter in a completely transparent way for the final user. The system also generates a low-level representation of the fuzzy code offering debugging (tracing) capabilities with close connections to other program manipulation tasks (optimization, specialization, etc). Our approach focuses on practical and technical aspects on rule-based reasoning with uncertain and fuzzy information.
Pedro J. Morcillo, Gines Moreno
Ruling Networks with RDL: A Domain-Specific Language to Task Wireless Sensor Networks
Abstract
Events are a fundamental concept in computer science with decades of research contributing to enable precise specification and efficient processing. New as well as evolving application domains nevertheless call for adaptation of successful concepts to meet intrinsic challenges provided by the target environment. A representative of such a new area for application are wireless sensor networks, pushing the need for event handling onto the bare metal of embedded devices. In this paper, we motivate the deployment of reactive rules in wireless sensor networks and describe our rule-based language RDL. Since our goal is to provide a high level of abstraction for node-level tasking, we will especially focus on recent additions to the language that support modularity to achieve a better encapsulation of concerns.
Kirsten Terfloth, Jochen Schiller

Rule-Based Methodologies and Applications in Distributed and Heterogeneous Environments

Local and Distributed Defeasible Reasoning in Multi-Context Systems
Abstract
Multi-Context Systems (MCS) are logical formalizations of distributed context theories connected through a set of mapping rules, which enable information flow between different contexts. Reasoning in MCS introduces many challenges that arise from the heterogeneity of contexts with respect to the language and inference system that they use, and from the potential conflicts that may arise from the interaction of context theories through the mappings. This study proposes a P2P rule-based reasoning model for MCS, which handles (a) incomplete or inconsistent local context information, by representing contexts as local theories of Defeasible Logic and performing local defeasible reasoning, and (b) global inconsistencies that result from the integration of local contexts, by representing mappings as defeasible rules and performing some type of distributed defeasible reasoning. It also provides a distributed algorithm for query evaluation, analyzes its formal properties, and illustrates its use in a Semantic Web use case scenario.
Antonis Bikakis, Grigoris Antoniou
Personal Agents in the Rule Responder Architecture
Abstract
Rule Responder is an intelligent rule-based system for collaborative teams and virtual communities that uses RuleML as its knowledge interchange format. This multi-agent infrastructure allows these virtual organizations to collaborate in an automated manner. It is implemented as a Web Service application on top of Mule, an Enterprise Service Bus. It supports rule execution environments (rule/inference engines) such as Prova and OO jDREW. Rule Responder implements an effective methodology and an efficient infrastructure to interchange and reuse knowledge bases (ontologies and rules). The paper describes the design decisions for the personal agent architecture of Rule Responder. A comparison between our distributed rule bases and a centralized rule base is given. An online use case for Rule Responder, applied to the organization of a symposium, is demonstrated.
Benjamin Larry Craig, Harold Boley
Semi-automatic Composition of Geospatial Web Services Using JBoss Rules
Abstract
The main research focus toward the Semantic Web vision has been so far on conceptualization, while little concern was spent on the efficiency aspect. In this paper we present practical experiences gained with the implementation of a use case from the geospatial domain, in particular a semi-automatic semantic composition of the functionality provided by 7 geospatial web services. Although we obtained the desired results with our initial approach, the performance aspect was unsatisfactory. For this reason we started the investigation into how significant performance improvements could be obtained. We identified rule engines as a solution that would easily fit into our framework and also were mature enough in terms of complexity and execution speed. We provide a new execution solution based on JBoss Rules and compare it with previous implementations.
Raluca Zaharia, Laurenţiu Vasiliu, Costin Bădică
A RuleML Study on Integrating Geographical and Health Information
Abstract
To facilitate health surveillance, flexible ways to represent, integrate, and deduce health information become increasingly important. In this paper, an ontology is used to support the semantic definition of spatial, temporal and thematic factors of health information. The ontology is realized as an interchangeable RuleML knowledge base, consisting of facts and rules. Rules are also used for integrating geographical and health information. The implemented eHealthGeo system uses the OO jDREW reasoning engine to deduce implicit information such as spatial relationships. The system combines this with spatial operations and supports health information roll-up and visualization. The eHealthGeo study demonstrates a RuleML approach to supporting semantic health information integration and management.
Sheng Gao, Darka Mioc, Harold Boley, Francois Anton, Xiaolun Yi

Natural-Language and Graphical Rule Representation and Processing

SBVR Use Cases
Abstract
Semantics of Business Vocabulary and Rules (SBVR) is a new standard from the OMG that combines aspects of ontologies and of rule systems. This paper summarizes SBVR, reviews some possible use cases for SBVR, and discusses ways that vocabularies and rules given in SBVR could relate to established ontology standards, to rules technologies, and to other IT implementation technologies. It also describes experience with an SBVR prototype that transforms a subset of SBVR rules types to several types of runtime implementations.
Mark H. Linehan
Visualization of Proofs in Defeasible Logic
Abstract
The development of the Semantic Web proceeds in steps, building each layer on top of the other. Currently, the focus of research efforts is concentrated on logic and proofs, both of which are essential, since they will allow systems to infer new knowledge by applying principles on the existing data and explain their actions. Research is shifting towards the study of non-monotonic systems that are capable of handling conflicts among rules and reasoning with partial information. As for the proof layer of the Semantic Web, it can play a vital role in increasing the reliability of Semantic Web systems, since it will be possible to provide explanations and/or justifications of the derived answers. This paper reports on the implementation of a system for visualizing proof explanations on the Semantic Web. The proposed system applies defeasible logic, a member of the non-monotonic logics family, as the underlying inference system. The proof representation schema is based on a graph-based methodology for visualizing defeasible logic rule bases.
Ioannis Avguleas, Katerina Gkirtzou, Sofia Triantafilou, Antonis Bikakis, Grigoris Antoniou, Efstratios Kontopoulos, Nick Bassiliades
Building an Autopoietic Knowledge Structure for Natural Language Conversational Agents
Abstract
This paper proposes a graph structure called an augmented semantic network (ASN) which is an extension of the ordinary semantic network (SN). We have developed an experimental conversational agent system and a knowledge structure based on the ASN that can hold a larger number of rules for replying to user utterances and modifying some parts of the rules when necessary. The system operation has shown that the knowledge structure is capable of implementing well-studied conversational models and becoming an autopoietic system. Autopoiesis means the systemic nature of life activity as discussed in the field of life science. An autopoietic system will be able to reproduce its elements as a result of their activity. Although the system will have to be capable of other functional natures to become an autopoietic system, the additional flexibility and extensibility enabled by the ASN-based knowledge structure might be necessary for realizing autopoietic and intelligent conversational agents.
The SN graph structure consists of a vertex set and an edge set whose elements each connect two elements in the vertex set. ASN edges are also able to connect elements in the edge set. The knowledge structure permits concept synthesis by utilizing the ASN’s edge modification ability. It removes the restriction on giving meanings from the outside to all concepts in the knowledge structure. Each element of rules represented by the ASN graph structure has a concrete meaning that can be synthesized by other elements of the rules. This capability might further the development of an autopoietic knowledge structure system.
Kiyoshi Nitta
A Functional Spreadsheet Framework for Authoring Logic Implication Rules
Abstract
This paper introduces a functional spreadsheet framework for authoring logic implication rules. This framework was conceived with the objective of reproducing many of the characteristics that make spreadsheet programming accessible to end-users. In the proposed framework, rule authors describe the semantics of a binary relation by constructing a functional spreadsheet model that computes the image of that binary relation. This model is subsequently translated into a collection of logic implication rules. We implemented and integrated this framework into a deductive spreadsheet system that extends Microsoft Excel with the World Wide Web Consortium (W3C) standard ontology language OWL + SWRL.
Marcelo Tallis, Robert M. Balzer

RuleML-2008 Challenge

Please Pass the Rules: A Rule Interchange Demonstration
Abstract
It is commonly accepted that separating the declarative rules from the procedural code of an application makes that application easier to understand and easier to modify. What has been lacking is a standard representation for rules – until now. Using the W3C’s Rule Interchange Format [1], rules will be exchanged and revised among three different rule systems: ILOG JRules [2], Oracle [3], and Prova [4].
Gary Hallmark, Christian de Sainte Marie, Marcos Didonet Del Fabro, Patrick Albert, Adrian Paschke
Self-sustained Routing for Event Diffusion in Wireless Sensor Networks
Abstract
Wireless sensor networks have the potential to become a scalable, low-cost and highly flexible tool for distributed monitoring and/or event recognition: Embedded devices that coordinate themselves via wireless communication to implement a common, distributed application are already seeing first industrial adaption in e.g. home automation, personal health or environmental monitoring. Despite of their valuable properties they put a high burden upon application development since critical issues such as a general resource scarcity, the unreliable communication medium and the management of distribution are often visible throughout the protocol stack to ensure efficient utilization.
In the demo, we will show how our middleware framework FACTS helps to alleviate problems in implementation of both system- and application-level code. Providing a rule-based, domain-specific language, FACTS is especially suited to express event-driven tasks. Therefore, we will showcase how to efficiently program a self-sustained routing protocol forwarding relevant events to dedicated sink nodes with only a handful of rules.
Kirsten Terfloth, Jochen Schiller
Backmatter
Metadaten
Titel
Rule Representation, Interchange and Reasoning on the Web
herausgegeben von
Nick Bassiliades
Guido Governatori
Adrian Paschke
Copyright-Jahr
2008
Verlag
Springer Berlin Heidelberg
Electronic ISBN
978-3-540-88808-6
Print ISBN
978-3-540-88807-9
DOI
https://doi.org/10.1007/978-3-540-88808-6

Premium Partner