The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.11 - November (2010 vol.22)
pp: 1489-1491
Published by the IEEE Computer Society
In recent years, rule-based technologies have enjoyed remarkable adoption in two areas: 1) business rule processing and 2) Web-centered reasoning. The first trend is caused by the software development life cycle, which needs to be accelerated at reduced cost. The second trend is related to the Semantic Web and Service-oriented technologies, which aim to turn the Web into a huge repository of cross-referenced, machine-understandable data and processes. For both trends, rules can be used to extract, derive, transform, and integrate information in a platform-independent manner. While early rule engines and environments were complex, expensive to maintain, and not very user friendly, the current generation of rule technology provides enhanced usability, scalability, and performance, and is less costly. A general advantage of using rules is that they are usually represented in a platform independent manner, often using XML. This fits well into today's distributed, heterogeneous Web-based system environments. Rules represented in standardized Web formats can be discovered, interchanged, and invoked at runtime within and across Web systems, and can be interpreted and executed on any platform.
This special section is focused on state-of-the-art ap-proaches, solutions, and applications in the area of rule representation, reasoning, and interchange in the context of distributed, (partially) open, heterogeneous environments, such as the semantic Web, intelligent multiagent systems, event-driven architectures, and service-oriented computing. In response to the call for papers, we received a total of 52 submissions, out of which 7 were recommended submissions from the best ranked papers presented at the RuleML-2007 [ 1] and RuleML-2008 [ 2] “International RuleML Symposia on Rule Interchange and Applications” held in October 2007 and 2008, respectively, in Orlando, Florida. After careful and rigorous reviews, we have selected 8 papers, 3 of them being extended papers from RuleML Symposia, based on the quality and relevance of the papers.
The first paper is ”Defeasible Contextual Reasoning with Arguments in Ambient Intelligence” by Antonis Bikakis and Grigoris Antoniou. It proposes a solution for contextual reasoning in ambient intelligence based on the multicontext systems paradigm, in which local context knowledge of ambient agents is encoded in rule theories (contexts), and information flow between agents is achieved through mapping rules that associate concepts used by different contexts. To handle imperfect contexts, multicontext systems have been extended with nonmonotonic features, local defeasible theories, defeasible mapping rules, and a preference ordering on the system contexts. On top of this, an argumentation framework and a distributed algorithm for query evaluation have been developed that exploit context and preference information to resolve potential conflicts.
The second paper is “A Rule-Based Trust Negotiation System” by P.A. Bonatti, J.L. De Coi, D. Olmedilla, and L. Sauro. It presents PROTUNE, a rule-based Trust Negotiation (TN) framework. TN frameworks have been proposed as a better solution for open environments such as the Web, in which parties may get in touch and interact without being previously known to each other. PROTUNE offers certain advantages that arise from an advanced rule-based approach in terms of deployment efforts, user friendliness, communication efficiency, and interoperability. The generality and technological feasibility of PROTUNE's approach are assessed through an extensive analysis and experimental evaluations.
The third paper is “Efficient Lazy Evaluation of Rule-Based Programs” by Peter Van Weert. It proposes a combination and cross-fertilization of the LEAPS production rule lazy matching algorithm (an extension to the Rete algorithm) with Constraint Handling Rules (CHR), a high-level, declarative programming language, similar to production rules. While obviously related, CHR and production rules research have mostly evolved independently from each other. The paper provides a lucid, comprehensive overview of CHR's rule evaluation methodology, and surveys recent contributions to the field of lazy matching. An empirical evaluation confirms that Rete-based engines would surely benefit from incorporating similar techniques and optimizations.
The fourth paper is “A Configurable Rete-OO Engine for Reasoning with Different Types of Imperfect Information” by Davide Sottara, Paola Mello, and Mark Proctor. It proposes an extension of RETE networks, which supports only boolean, first order logic, capable of handling several types of schemes for reasoning with imperfect information. The architecture depends on a number of configuration parameters which could be set by the user. The paper then shows how an appropriate combination of parameters can be used to emulate some of the most common, specialized engines: 3-valued logic, classical certainty factors, fuzzy logic, many-valued logic, and Bayesian networks.
The fifth paper is ”Integrated Rule-Based Learning and Inference” by Ioannis Hatzilygeroudis and Jim Prentzas. It presents the construction process and the inference mechanism of neurules, a kind of integrated rules integrating neurocomputing and production rules, and explores their generalization capabilities. The construction process, which also implements a corresponding learning algorithm, creates neurules from a given empirical data set. The inference mechanism of neurules is integrated; it combines neurocomputing with symbolic processes. As shown via experiments, the neurules integrated inference mechanism is more efficient than the inference mechanism used in connectionist expert systems. Furthermore, neurules generalize much better than its constituent neural component (adaline unit) and is comparable to the back-propagation neural net.
The sixth paper is “A Deductive Spreadsheet System for End-Users” by Marcelo Tallis and Robert M. Balzer. It presents a spreadsheet-based framework for authoring logic implication rules that try to exploit the characteristics that make spreadsheet programming accessible to end-users in order to make deductive problem-solving methods available to them. 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, which is then translated into a collection of logic implication rules. The framework has been implemented on top of Microsoft Excel, adopting the World Wide Web Consortium (W3C) standard ontology language OWL + SWRL formalisms.
The seventh paper is “A Novel Combination of Answer Set Programming with Description Logics for the Semantic Web” by Thomas Lukasiewicz. It presents a novel combination of disjunctive programs under the answer set semantics with description logics for the Semantic Web. The combination is based on a well-balanced interface between disjunctive programs and description logics, which guarantees the decidability of the resulting formalism without assuming syntactic restrictions. It is shown that the new formalism extends both disjunctive programs and description logics. Furthermore, the paper describes algorithms for reasoning, consistency checking and literal entailment under the well-founded semantics in the new formalism, and gives a precise picture of their computational complexity.
The eighth paper is “A Guide to the Basic Logic Dialect for Rule Interchange on the Web” by Harold Boley and Michael Kifer. It is a guide to the essentials of RIF-BLD, its syntax, semantics, and XML serialization. The W3C Rule Interchange Format (RIF) is a forthcoming standard for exchanging rules among different systems and for developing intelligent rule-based applications for the Semantic Web. The RIF architecture is conceived as a family of languages, called dialects. A RIF dialect is a rule-based language with an XML syntax and a well-defined semantics. The RIF Basic Logic Dialect (RIF-BLD) semantically corresponds to a Horn rule language with equality. RIF-BLD has a number of syntactic extensions with respect to traditional textbook Horn logic, which include F-logic frames and predicates with named arguments. RIF-BLD is also well-integrated with the relevant Web standards. It provides IRIs (Internationalized Resource Identifiers), XML Schema datatypes, and is aligned with RDF and OWL.
Finally, we would like to thank those individuals who have helped making this special section possible. Most important of all, we would like to thank Professors Xindong Wu and Beng Chin Ooi, the former and the current Editor-in-Chief of the IEEE Transactions on Knowledge Data Engineering ( TKDE), respectively, for their strong support for this special section and for their constructive comments on the overall processing. Furthermore, we would like to thank IEEE TKDE administrators Mrs. Mari Padilla and Mrs. Mercy Frederickson for their valuable administrative support during the whole process. Last, but not least, we thank the authors of the submitted papers and the many reviewers who helped us put together this special section.

    N. Bassiliades is with the Department of Informatics, Aristotle University of Thessaloniki, 54124 Thessaloniki, Greece.

    E-mail: nbassili@csd.auth.gr.

    G. Governatori is with NICTA, Queensland Research Laboratory, PO Box 6020, St Lucia QLD 4067, Australia.

    E-mail: guido.governatori@nicta.com.au.

    A. Paschke is with the Institute for Computer Science, Department of Computer Science and Mathematics, Freie Universitaet Berlin, Königin-Luise-Straße 24 - 26, 14195 Berlin, Germany.

    E-mail: paschke@inf.fu-berlin.de.

    J. Dix is with the Department of Informatics, Clausthal University of Technology, Julius-Albert-Str. 4, 38678 Clausthal-Zellerfeld, Germany.

    E-mail: dix@tu-clausthal.de.

For information on obtaining reprints of this article, please send e-mail to: tkde@computer.org.

REFERENCES



Nick Bassiliades received the PhD degree in parallel knowledge base systems from the Department of Informatics at the Aristotle University of Thessaloniki, Greece, in 1998. He is currently an associate professor in the Department of Informatics at the Aristotle University of Thessaloniki. His research interests include knowledge-based systems, rule systems, agents, and the semantic Web. He has published more than 100 papers in journals, conferences, and books, and coauthored an international book on parallel, object-oriented, and active knowledge-based systems and a Greek book on artificial intelligence. He was on the program committee of more than 45 and on the organizational committee of five conferences/workshops. He has been involved in several projects concerning knowledge-based systems, intelligent agents, e-learning, web services, semantic Web, rules, ontologies, etc., leading seven of them. He is a member of the Board of the Greek Artificial Intelligence Society, a director of RuleML, Inc., and also a member of the Greek Computer Society, the IEEE, and the ACM.



Guido Governatori received the PhD degree in legal informatics in 1997 from the University of Bologna. Since then, he held academic and research positions at Imperial College, Griffith University, Queensland University of Technology and The University of Queensland. Currently, he is the education director of the NICTA Queensland Research Laboratory where he also leads the Business Process Compliance Project. His research interests include nonclassical logics, computational logic, and defeasible reasoning and their applications to normative reasoning, agents, and business processes. He edited 12 books and special issues and has published more than 170 papers in scholarly journals, conference proceedings, and books. He is a RuleML Inc director, serves in the Asia-Pacific Committee of the Association for Symbolic Logic, the editorial board of Artificial Intelligence and Law, and is member of the IEEE and the ACM.



Adrian Paschke received the PhD degree in logic programming and rule-based Information systems from the Technical University Munich. Currently, he is professor at the Freie Universitaet Berlin where he is the chair of Corporate Semantic Web, director of RuleML Inc., vice director of the Semantics Technologies Institute Berlin (STI Berlin), and research director at the Centre for Information Technology Transfer (CITT) GmbH. He is the steering committee chair of the RuleML Web Rule Standardization Initiative (RuleML), founding member of the Event Processing Technology Society (EPTS), chair of the Reaction RuleML technical group, chair of the EPTS Reference Architecture working group (EPTS RA), voting member of OMG, and active member of several W3C groups such as the W3C Rule Interchange Format working group (W3C RIF), where he is an editor of the W3C RIF standard. His research interests include knowledge representation and logic-based AI, corporate semantic web, pragmatic web and agent systems, and business information systems. He is a member of the IEEE.



Jürgen Dix received the PhD degree in nonmonotonic reasoning and logic programming from Karlsruhe University of Technology in 1992. He received the habilitation degree in information systems for his thesis on disjunctive deductive databases in 1996 from the Technical University of Vienna. He is currently a full professor of artificial intelligence at Clausthal University of Technology, where he also serves as dean of the Faculty. His research interests include foundations for agent systems, knowledge representation, and logic-based AI. He coauthored two monographs, edited 30 books and special journal issues, and published more than 200 papers in refereed conferences and workshops. He was on the program committee of more than 130 conferences/workshops and organized more than 40. He is on the editorial boards of eight journals and a member of the IEEE and the ACM.
24 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool