rule-based expert system shells have one important drawback in handling uncertain knowledge. It is the drawback that the style of their fuzzy reasoning process and their semantics both are not compatible with those of...
详细信息
rule-based expert system shells have one important drawback in handling uncertain knowledge. It is the drawback that the style of their fuzzy reasoning process and their semantics both are not compatible with those of relational databases. On the other hand, production rule-based languages whose structure is similar to that of the databases fail to possess the fuzzy reasoning ability. Proposed in this paper is a framework to support a semantic based inexact match with Fuzzy Match Predicate (F_MP). In a uniform way it allows matches including fuzzy linguistic variables as well as fuzzy numbers. Our framework also adopts a design alternative to conform not only the semantics of its knowledge representation but also its reasoning style to those of the relational framework. It is a natural consequence that such a design alternative entails a seamless integration of our work into the relational databases. A major advantage of our framework is that it can be implemented on top of the production rule-based languages without modifying their discrimination networks. That is mainly due to the minimal semantic gap between the framework and the languages. In this paper, we demonstrate that: (1) F_MP is a uniform framework to provide the rule-based languages with fuzzy match facilities semantically enhanced, and that (2) its semantic conform well to that of the relational one. We also develop a rule-evaluation mechanism well suited to the aims.
We study here a natural situation when constraint programming can be entirely reduced to rule-based programming. To this end we explain first how one can compute on constraint satisfaction problems using rules represe...
详细信息
We study here a natural situation when constraint programming can be entirely reduced to rule-based programming. To this end we explain first how one can compute on constraint satisfaction problems using rules represented by simple first-order formulas. Then we consider constraint satisfaction problems that are based on predefined. explicitly given constraints. To solve them we first derive rules from these explicitly given constraints and limit the computation process to a repeated application of these rules, combined with labeling. We consider two types of rule here, The first type, that we call equality rules, leads to a new notion of local consistency, called rule consistency that turns out to be weaker than arc consistency for constraints of arbitrary arity (called hyper-arc consistency in Marriott & Stuckey (1998)). For Boolean constraints rule consistency coincides with the closure under the well-known propagation rules for Boolean constraints, The second type of rules, that we call membership rules, yields a rule-based characterization of arc consistency. To show feasibility of this rule-based approach to constraint programming. we show how both types of rules can be automatically generated. as CHR rules of Fruhwirth (1995). This yields an implementation of this approach to programming by means of constraint logic programming. We illustrate the usefulness of this approach to constraint programming by discussing various examples, including Boolean constraints, two typical examples of many valued logics, constraints dealing with Waltz's language for describing polyhedral scenes, and Allen's qualitative approach to temporal logic.
In recent years light-weighted formal methods in construction and analysis of complex concurrent software system are of growing interest. In this paper a new rule-action based term rewriting framework, called TermWare...
详细信息
In recent years light-weighted formal methods in construction and analysis of complex concurrent software system are of growing interest. In this paper a new rule-action based term rewriting framework, called TermWare, is proposed and its application to software system analysis is described to provide better cost effectiveness of software maintenance under varied requirements and specifications of operation. The main advantage is light-weighted formal model based on not computational semantics but on particular properties of software system to be analyzed. Such approach eliminates the need in full formal analysis of software system and allows extreme flexibility of applications in two major concerns: high adaptability to changeable environment and easy reengineering and component reuse. The language and formal semantics of the system are defined. A new semantic model, called term system with action, is proposed for TermWare. A case study with some representative examples in source code analysis and software development with TermWare framework is presented.
Diaplan is a language for programming with graphs and diagrams that is currently being designed and implemented by the authors. In this paper, a programming example, declaration grids, shall illustrate how Diaplan sup...
详细信息
Diaplan is a language for programming with graphs and diagrams that is currently being designed and implemented by the authors. In this paper, a programming example, declaration grids, shall illustrate how Diaplan supports a functional and object-oriented style of programming. The example also indicates which features are needed beyond those discussed in previous work on the language [9].
In this paper, we present the rule-Maker System, which is a visualization approach of rule-based programming. Compared to traditional rule-based programming, rule-Maker provides an intuitive graphical interface to red...
详细信息
ISBN:
(纸本)9781595937537
In this paper, we present the rule-Maker System, which is a visualization approach of rule-based programming. Compared to traditional rule-based programming, rule-Maker provides an intuitive graphical interface to reduce programming effort and help developers focus on rule structure rather than rule syntax. Programmers can implement graphical modules of algorithms. By connecting with LRR (Laboratory for Rapid Rewriting), the visualization approach hides the computation detail information from the developer.
Since Arduino is the main entry-level platform to the world of electronic circuits and systems, there are many programming environments that try to ease the burden of Arduino textual programming on young primary stude...
详细信息
ISBN:
(纸本)9781467396806
Since Arduino is the main entry-level platform to the world of electronic circuits and systems, there are many programming environments that try to ease the burden of Arduino textual programming on young primary students. Although block-based, most of these environments retain the imperative structures of textual programming languages, which are not easily comprehensible by such students. The proposed, in this paper, Learning-Arduino-With-rules Introductory System (LAWRIS) tries to tackle this problem by adopting a rule-based approach: an Arduino-based pre-specified system can be programmed by constructing rules with very simple and intuitive jigsaw pieces, in a visual, web-based environment. Contrary to other programming environments for Arduino, the main logic of LAWRIS is implemented on the board side and only a configuration string is downloaded to it. Thus, LAWRIS features fast responses to both circuit input changes and program modifications, a very important characteristic for young students. It also imposes minimal overhead on the host system, allows web access of the programming environment, and has very low hardware cost.
The purpose of this paper is to use mathematical programming, including linear programming, dynamic programming, integer programming and goal programming to verify rule-based knowledge. We investigate both domain inde...
详细信息
The purpose of this paper is to use mathematical programming, including linear programming, dynamic programming, integer programming and goal programming to verify rule-based knowledge. We investigate both domain independent verification, exploiting the general structure of rules, and domain dependent verification, exploiting structure in the domain. Mathematical programming software is readily available and is very efficient. As a result, verification using mathematical programming can be very efficient at finding errors. Mathematical programming can be used to more than just find errors in knowledge representation. Once an error has been found, mathematical programming can be used to ''recommend'' an alternative. The recommendation can take into account the previous verified knowledge to mitigate the potential introduction of redundant knowledge and to help guide the choice process. Normally the development of recommendations to fix errors has been ignored in the verification literature, and treated as a separate knowledge acquisition task. Accordingly, this paper also extends the verification effort by providing a recommendation on how to fix errors.
This paper describes ImAtHome, an iOS application for smart home configuration and management. This application has been built over the framework HomeKit, made available in iOS, for communicating with and controlling ...
详细信息
ISBN:
(纸本)9781891706400
This paper describes ImAtHome, an iOS application for smart home configuration and management. This application has been built over the framework HomeKit, made available in iOS, for communicating with and controlling home automation accessories. Attention has been put on the design of the interaction with such an application, in order to make the interaction style as much coherent as possible with iOS apps and supporting users without programming skills to unwittingly create event-condition action rules that, in other similar systems, are usually defined through "if-then" constructs. The results of a user test demonstrate that ImAtHome is easy to use and well accepted by end users of different age and background.
The paper discusses issues of rule-based data transformation from arbitrary spreadsheet tables to a canonical (relational) form. We present a novel table object model and rule-based language for table analysis and int...
详细信息
The paper discusses issues of rule-based data transformation from arbitrary spreadsheet tables to a canonical (relational) form. We present a novel table object model and rule-based language for table analysis and interpretation. The model is intended to represent a physical (cellular) and logical (semantic) structure of an arbitrary table in the transformation process. The language allows drawing up this process as consecutive steps of table understanding, i. e. recovering implicit semantics. Both are implemented in our tool for spreadsheet data canonicalization. The presented case study demonstrates the use of the tool for developing a task-specific rule-set to convert data from arbitrary tables of the same genre (government statistical websites) to flat file databases. The performance evaluation confirms the applicability of the implemented rule-set in accomplishing the stated objectives of the application. (C) 2017 Elsevier Ltd. All rights reserved.
暂无评论