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.
This article comprises of an Expert Enhanced Coloured Stochastic Petri Net (rule base system, or RBS) for modelling and analysing assembly/disassembly systems. RBSs are an Enhanced High-level Petri net extended with C...
详细信息
This article comprises of an Expert Enhanced Coloured Stochastic Petri Net (rule base system, or RBS) for modelling and analysing assembly/disassembly systems. RBSs are an Enhanced High-level Petri net extended with Close-World-Assumption (CWA). Traditional Petri nets can be used to model RBSs containing explicitly described knowledge. The main focus was is to facilitate and analyse the process planning activities of assembly/disassembly. The advantages of the new modelling approach were: (1) consideration of the non-desirable events, (2) occurrence of assembly/disassembly tasks with regard to colour of the tokens and utilization of probability concept to determine feasible steps, (3) establishing a relationship among components by means of arc labels, and (4) deeper insight into the assembly/disassembly process using high- and low-level petri nets.
In this research, a rule-based system has been developed for pattern recognition, making use of both statistical and syntactical approaches in classifying remote sensing data. This system attempts to automate the proc...
详细信息
In this research, a rule-based system has been developed for pattern recognition, making use of both statistical and syntactical approaches in classifying remote sensing data. This system attempts to automate the process of recognizing the output patterns from the unsupervised classifier based on a developed syntactic model. In the first phase of this work, a library of statistics of spectral characteristics of different land-use features in six bands of Thematic Mapper (TM) data (bands: 1, 2, 3, 4, 5 and 7) has been constructed. The statistical library is based on a prior knowledge (ground data) of the concerned pattern features, namely: maize, cotton, trees, soil, urban, water and salty water. The second phase is designing a grammar rule tree for recognizing each pattern, based on the outcome of this library, using waveform peak method. The developed system has a built-in intelligence so as to accept the unlabelled output spectral classes from the unsupervised classifier, parsing the pattern for each, and outputting descriptive classes.
This paper describes a new method for creating polynomial regression models. The new method is compared with stepwise regression and symbolic regression using three example problems. The first example is a polynomial ...
详细信息
This paper describes a new method for creating polynomial regression models. The new method is compared with stepwise regression and symbolic regression using three example problems. The first example is a polynomial equation. The two examples that follow are real-world problems, approximating the Colebrook-White equation and rainfall-runoff modelling. The three example problems illustrate the advantages of the new method. (C) 2002 Elsevier Science Inc. All rights reserved.
This paper describes a new method for creating polynomial regression models. The new method is compared with stepwise regression and symbolic regression using three example problems. The first example is a polynomial ...
详细信息
This paper describes a new method for creating polynomial regression models. The new method is compared with stepwise regression and symbolic regression using three example problems. The first example is a polynomial equation. The two examples that follow are real-world problems, approximating the Colebrook-White equation and rainfall-runoff modelling. The three example problems illustrate the advantages of the new method. (C) 2002 Elsevier Science Inc. All rights reserved.
This paper presents a Genetic Algorithm for Production Systems Optimization (GAPSO). The GAPSO finds an ordering of Condition Elements (CEs) in the rules of a Production System (PS) that results in a (near) optimal PS...
详细信息
This paper presents a Genetic Algorithm for Production Systems Optimization (GAPSO). The GAPSO finds an ordering of Condition Elements (CEs) in the rules of a Production System (PS) that results in a (near) optimal PS with respect to execution time. Finding such an ordering can be difficult since there is often a large number of ways to order CEs in the rules of a PS. Additionally, existing heuristics to order CEs in many cases conflict with each other. The GAPSO is applicable to PSs in general and no assumptions are made about the matching algorithm or the interpreter that executes the PS. The results of applying the GAPSO to some example PSs are presented. In all examples, the GAPSO found an optimal ordering of CEs in a small number of iterations.
Our approach for automating the negotiation of business contracts proceeds in three broad steps. First, determine the structure of the negotiation process by applying general know ledge about auctions and domain-speci...
详细信息
Our approach for automating the negotiation of business contracts proceeds in three broad steps. First, determine the structure of the negotiation process by applying general know ledge about auctions and domain-specific knowledge about the contract subject along with preferences from potential buyers and sellers, Second translate the determined negotiation structure into an operational specification for an auction platform. Third, after the negotiation has completed, map the negotiation results to a final contract. We have implemented a prototype which supports these steps by employing a declarative specification (in courteous logic programs) of (1) high-level knock ledge about alternative negotiation structures, (2) general-case rules about auction parameters. (3) rules to map the auction parameters to a specific auction platform, and (4) special-case rules for subject domains, We demonstrate the flexibility of this approach by automatically generating several alternative negotiation structures for the domain of travel shopping in a trading agent competition.
ELAN implements computational systems, a concept that combines two first class entities: rewrite rules and rewriting strategies. ELAN can be used either as a logical framework or to describe and execute deterministic ...
详细信息
ELAN implements computational systems, a concept that combines two first class entities: rewrite rules and rewriting strategies. ELAN can be used either as a logical framework or to describe and execute deterministic as well as non-deterministic rule-based processes. With the general goal to make precise a rewriting logic-based semantics of ELAN, this paper has three contributions: a presentation of the concepts of rules and strategies available in ELAN, an expression of rewrite rules with matching conditions in conditional rewriting logic, and finally an enrichment mechanism of a rewrite theory into a strategy theory in conditional rewriting logic. (C) 2002 Elsevier Science B.V. All rights reserved.
This paper presents a rules-based computerized symbolic carrier regeneration method for mechanical system conceptual design. In this method, design requirements of mechanical systems are expressed by regeneration rule...
详细信息
This paper presents a rules-based computerized symbolic carrier regeneration method for mechanical system conceptual design. In this method, design requirements of mechanical systems are expressed by regeneration rules which are composed mainly of symbols and logical codes;non-isomorphic graphs are chosen to be graphic carriers for symbolic carrier regeneration process;in each regeneration step, similarity identification needs to be done on symbolic carrier elements-links, so as to prevent redundant schemes. General design requirements can be expressed by simple Boolean calculation (AND, OR), relation calculation (adjacent, overlapping, topological relationship) and functional elements (concepts). based on computer and object oriented encapsulation technology, the method can solve general conceptual design problems of mechanical systems. Designers need not know much about specialized knowledge and can fulfill design process of mechanical products. (C) 2002 Elsevier Science Ltd. All rights reserved.
暂无评论