Supporting the programmer of a rule based language

Abstract: In this paper we take up the plight of the programmer of a rule based language. Our focus is on the type of development environment that is most supportive of such programmers. Our view will be that programming is programming, whether it be with a rule based, functional or imperative language. While it is true that rule based languages have strong links to the Expert Systems field, our discussion in this paper has less to do with 'expert systems' per se ¹ , and more to do with the view of rule based languages as yet another computational paradigm, often included under the same roof with non-rule-based languages. Just as programming environment research has progressed for non-rule-based languages, we would like to build more powerful environments in the rule based world as well. We report here on an attempt to build such an environment. ²     

A semantical framework for hybrid knowledge bases

In the ongoing discussion about combining rules and ontologies on the Semantic Web a recurring issue is how to combine first-order classical logic with nonmonotonic rule languages. Whereas several modular approaches to define a combined semantics for such hybrid knowledge bases focus mainly on decidability issues, we tackle the matter from a more general point of view. In this paper, we show how Quantified Equilibrium Logic (QEL) can function as a unified framework which embraces classical logic as well as disjunctive logic programs under the (open) answer set semantics. In the proposed variant of QEL, we relax the unique names assumption, which was present in earlier versions of QEL. Moreover, we show that this framework elegantly captures the existing modular approaches for hybrid knowledge bases in a unified way.     

DLEJena: A practical forward-chaining OWL 2 RL reasoner combining Jena and Pellet

This paper describes DLEJena, a practical reasoner for the OWL 2 RL profile that combines the forward-chaining rule engine of Jena and the Pellet DL reasoner. This combination is based on rule templates, instantiating at run-time a set of ABox OWL 2 RL/RDF Jena rules dedicated to a particular TBox that is handled by Pellet. The goal of DLEJena is to handle efficiently, through instantiated rules, the OWL 2 RL ontologies under direct semantics, where classes and properties cannot be at the same time individuals. The TBox semantics are treated by Pellet, reusing in that way efficient and sophisticated TBox DL reasoning algorithms. The experimental evaluation shows that DLEJena achieves more scalable ABox reasoning than the direct implementation of the OWL 2 RL/RDF rule set in the Jena’s production rule engine, which is the main target of the system. DLEJena can be also used as a generic framework for applying an arbitrary number of entailments beyond the OWL 2 RL profile.     

A Rule-Based Object-Oriented OWL Reasoner

In this paper, we describe O-DEVICE, a memory-based knowledge-based system for reasoning and querying OWL ontologies by implementing RDF/OWL entailments in the form of production rules in order to apply the formal semantics of the language. Our approach is based on a transformation procedure of OWL ontologies into an object-oriented schema and the application of inference production rules over the generated objects in order to implement the various semantics of OWL. In order to enhance the performance of the system, we introduce a dynamic approach of generating production rules for ABOX reasoning and an incremental approach of loading ontologies. O-DEVICE is built over the CLIPS production rule system, using the object-oriented language COOL to model and handle ontology concepts and RDF resources. One of the contributions of our work is that we enable a well-known and efficient production rule system to handle OWL ontologies. We argue that although native OWL rule reasoners may process ontology information faster, they lack some of the key features that rule systems offer, such as the efficient manipulation of the information through complex rule programs. We present a comparison of our system with other OWL reasoners, showing that O-DEVICE can constitute a practical rule environment for ontology manipulation.     

Towards Learning Morphology for Under-Resourced Fusional and Agglutinating Languages

In this paper, we describe a novel and effective approach for automatically decomposing a word into stem and suffixes. Russian and Turkish are used as exemplars of fusional and agglutinating languages. Rather than relying on corpus counts, we use a small number of word-pairs as training data, that can be particularly suited for under-resourced languages. For fusional languages, we initially learn a tree of aligned suffix rules (TASR) from word-pairs. The tree is built top-down, from general to specific rules, using suffix rule frequency and rule subsumption, and is executed bottom-up, i.e., the most specific rule that fires is chosen. TASR is used to segment a word form into a stem and suffix sequence. For fusional languages learning through generation (using TASR) is essential for proper stem extraction. Subsequently, an unsupervised segmentation algorithm graph-based unsupervised suffix segmentation (GBUSS) is used to segment the suffix sequence. GBUSS employs a suffix graph where node merging, guided by an information-theoretic measure, generates suffix sequences. The approach, experimentally validated on Russian, is shown to be highly effective. For agglutinating languages only the GBUSS is needed for word decomposition. Promising experimental results for Turkish are obtained.      

一种基于异构系统发现日志本体关联规则的方法

构建日志本体之上的访问模式关联规则是语义Web使用挖掘的主要任务之一.在DL-safe规则的限定下,将日志本体和一阶应用规则相结合,构成异构日志知识库,以提高Web日志系统的知识表示和推理能力.在此基础上借助ILP理论从异构日志知识库中挖掘出频繁用户访问模式,并生成访问模式关联规则,以发现用户访问行为之间更丰富的潜在关联知识.该方法提高了语义Web使用挖掘的质量,为改进站点结构提供了更有效的决策知识.实验结果证明了该方法的可行性和有效性.     

A Method for the Representation, Evaluation and Display of CSG Models in PHIGS and PHIGS+

The Programmer's Hierarchical Interactive Graphics System (PHIGS) is about to become a standard graphics system ^† which caters for the definition, display and modification of two and three-dimensional graphical data.
PHIGS , however, is mainly a wireframe system, and the PHIGS⁺ , extensions to it have been put forward to allow the incorporation of shaded 3D graphics into PHIGS. ,
One area that is important to a large constituency and which has so far not been considered in PHIGS , and PHIGS⁺ , is that of solid modelling. This paper addresses one aspect of solid modelling by describing a simple method for the representation, evaluation and display of Constructive Solid Geometry (CSG) models in PHIGS , and PHIGS⁺. .     

CLIPS-OWL: A framework for providing object-oriented extensional ontology queries in a production rule engine

In this paper, we define a framework, namely CLIPS-OWL, for enabling the CLIPS production rule engine to represent the extensional results of DL reasoning on OWL ontologies in the form of Object-Oriented (OO) models. The purpose of this transformation is to allow CLIPS to use these OO models as static query models that are able to answer extensional ontology queries directly by the RETE reasoning engine during the development of custom CLIPS production rule programs, without interfacing at runtime the external DL reasoner. In that way, any CLIPS-based application may enhance its functionality by incorporating ontological knowledge without modifying the architecture of the CLIPS rule engine. CLIPS-OWL has been implemented using the Pellet DL reasoner and the CLIPS Object-Oriented Language (COOL).     

COMPLEXITY RESULTS FOR SAS+ PLANNING

We have previously reported a number of tractable planning problems defined in the SAS⁺ formalism. This article complements these results by providing a complete map over the complexity of SAS⁺ planning under all combinations of the previously considered restrictions. We analyze the complexity of both finding a minimal plan and finding any plan. In contrast to other complexity surveys of planning, we study not only the complexity of the decision problems but also the complexity of the generation problems. We prove that the SAS⁺-PUS problem is the maximal tractable problem under the restrictions we have considered if we want to generate minimal plans. If we are satisfied with any plan, then we can generalize further to the SAS⁺-US problem, which we prove to be the maximal tractable problem in this case.     

基于OWL的本体集成

提出一种新的本体集成方法。分析了本体集成的原因,阐述了本体集成时应遵循的4条基本原则,并给出了集成的分类,提出了一种基于OWL DL图闭包的本体集成方法。该方法将OWL DL本体抽象为RDFS图模型,根据给定的OWL DL推理规则生成OWL DL本体的图闭包,在此基础上进行本体集成,同时提出了几种计算实体相似度的方法,将本方法与COMA++和FCA-merge进行实验对比,本方法在准确率和召回率上占优势。     

从ER模式到OWL DL本体的语义保持的翻译

提出了一种从ER模式到OWL DL本体的语义保持的翻译方法.该方法在形式化表示ER模式的基础上,建立ER模式和OWL DL本体之间精确的概念对应,通过一个翻译算法按照一组预定义的映射规则实现模式翻译.理论分析表明,该方法是语义保持的和有效的;算法实现和案例研究进一步证实,完全自动的机器翻译是可实现的.该文方法是原创性的,为Web本体的开发以及数据库和语义Web之间语义互操作的实现开辟了一条有效途径.     

Graphics, Bifurcation, Order and Chaos

Chaos theory involves the study of how complicated behaviour can arise in systems which are based on simple rules, and how minute changes in the input of a system can lead to large differences in the output. In this paper, bifurcation maps of the education X_t+1=αλX_t [1+X_t] ^-β, where α= 1 or α=e^-Xi, are presented, and they reveal a visually striking and intricate class of patterns ranging from stable points, to a bifurcating hierarchy of stable cycles, to apparently random fluctuations. The computer-based system presented is special in its primary focus on the fast characterization of simple "chacs equation" data using an interactive graphics system with a variety of controlling parameters.     

Anomalies in ontologies with rules

For the development of practical semantic applications, ontologies are commonly used with rule extensions. Prominent examples of semantic applications not only are Semantic Wikis, Semantic Desktops, but also advanced Web Services and agents. The application of rules increases the expressiveness of the underlying knowledge in many ways. Likewise, the integration not only creates new challenges for the design process of such ontologies, but also existing evaluation methods have to cope with the extension of ontologies by rules.Since the verification of Owl ontologies with rule extensions is not tractable in general, we propose to verify ontologies at the symbolic level by using a declarative approach: With the new language Datalog^?, known anomalies can be easily specified and tested in a compact manner. We introduce supplements to existing verification techniques to support the design of ontologies with rule enhancements, and we focus on the detection of anomalies that especially occur due to the combined use of rules and ontological definitions.     

Ontology versioning in an ontology management framework

Ontologies have become ubiquitous in information systems. They constitute the semantic Web's backbone, facilitate e-commerce, and serve such diverse application fields as bioinformatics and medicine. As ontology development becomes increasingly widespread and collaborative, developers are creating ontologies using different tools and different languages. These ontologies cover unrelated or overlapping domains at different levels of detail and granularity. A uniform framework, which we present here, helps users manage multiple ontologies by leveraging data and algorithms developed for one tool in another. For example, by using an algorithm we developed for structural evaluation of ontology versions, this framework lets developers compare different ontologies and map similarities and differences among them. Multiple-ontology management includes these tasks: maintain ontology libraries, import and reuse ontologies, translate ontologies from one formalism to another, support ontology versioning, specify transformation rules between different ontologies and version, merge ontologies, align and map between ontologies, extract an ontology's self-contained parts, support inference across multiple ontologies, support query across multiple ontologies.     

语义Web模糊规则的互换与实现

针对模糊规则语言f-SW-if-then-unless-RL不能与f-RIF框架中的模糊规则语言互换规则的问题,构建f-SW-if-then-unless-RL和 f-RIF之间的规则映射,设计并实现一个能够自动处理f-SW-if-then-unless-RL规则和在这2种语言间互换模糊规则的原型系统,命名为规则交换系统。实现的原型系统成为f-RIF互换框架的重要组成部分。