Equivalent Transformation Rules as Components of Programs

2006 ◽  
Author(s):  
H. Mabuchi ◽  
K. Akama ◽  
T. Wakatsuki
Keyword(s):  
Equivalent Transformation ◽  
Transformation Rules

How to Make Programs from Problem Descriptions in the Equivalent Transformation Paradigm

2003 ◽  
Vol 7 (3) ◽  
pp. 260-267
Author(s):  
Takahiko Ishikawa ◽  
◽  
Kiyoshi Akama ◽  
Hiroshi Mabuchi ◽  
◽  
...  
Keyword(s):  
Problem Solving ◽  
Expressive Power ◽  
Equivalent Transformation ◽  
Sample Problem ◽  
Computation Model ◽  
Transformation Rules ◽  
Manipulative Techniques

In the computation model of equivalent transformation (ET), problems are expressed by some declarative descriptions. Programs, which consist of equivalent transformation rules (ETRs), are made from the declarative descriptions, and applied to questions to solve them. The ET model can achieve various and efficient ways of problem-solving mainly due to the expressive power and priorities of ETRs. In this paper, we investigate and demonstrate, by solving a sample problem, how to make programs from problem descriptions in the ET paradigm. We introduce basic methods of generation and improvement of rules seeking for desirable ETRs. We can transform ETRs, preserving correctness of computation, through many manipulative techniques, i.e., changing from nondeterministic atoms into sequentially executable atoms, introducing multi-head rules, and adjusting priority of rules, by which we can effectively improve correct programs into both correct and more efficient programs.

Converting Constraint Handling Rules to Equivalent Transformation Rules

2006 ◽  
Vol 10 (3) ◽  
pp. 339-348 ◽  
Author(s):  
Yoshinori Shigeta ◽  
◽  
Kiyoshi Akama ◽  
Hiroshi Mabuchi ◽  
Hidekatsu Koike ◽  
...  
Keyword(s):  
Constraint Handling ◽  
Equivalent Transformation ◽  
Model Computation ◽  
Computation Model ◽  
Knowledge Processing ◽  
First Order ◽  
Transformation Rules ◽  
Logical Equivalence

We present a way to convert constraint handling rules (CHRs) to equivalent transformation rules (ETRs) and demonstrate the correctness of the conversion in equivalent transformation (ET) theory. In the ET computation model, computation is regarded as equivalent transformations of a description. A description is transformed successively by ETRs. Extensively used in the domain of first-order terms, the ET computation model has also been applied to knowledge processing in such data domains as RDF, UML, and XML. A CHR is a multiheaded guarded rule that rewrites constraints into simpler ones until they are solved. CHRs and ETRs are similar in syntax but they have completely different theoretical bases for the correctness of their computation. CHRs are based on the logical equivalence of logical formulas, while ETRs are based on the set equivalence of descriptions. We convert CHRs to rules used in the ET model and demonstrate converted rules to be correct ETRs, i.e., they preserve meanings of descriptions. We discuss correspondences and differences between CHRs and ETRs in theories, giving examples of correct ETRs that cannot be represented as CHRs.

Integration of Syntactic Analysis and Semantic Interpretation Based on Equivalent Transformation

2003 ◽  
Vol 7 (3) ◽  
pp. 306-314
Author(s):  
Hiroshi Mabuchi ◽  
◽  
Kiyoshi Akama ◽  
Takahiko Ishikawa ◽  
Hidekatsu Koike ◽  
...  
Keyword(s):  
General Principle ◽  
Efficient Algorithm ◽  
Semantic Interpretation ◽  
Cooperative Interaction ◽  
Syntactic Analysis ◽  
Equivalent Transformation ◽  
Language Understanding ◽  
Knowledge Processing ◽  
Transformation Rules ◽  
Mutually Independent

Making an efficient algorithm for natural language understanding by means of flexible and cooperative interaction between syntactic analysis and semantic interpretation is very difficult. In order to overcome the difficulties, the present paper proposes a new method for designing knowledge processing systems, the computation of which is based on equivalent transformation of declarative descriptions. Basic procedures for syntactic analysis and semantic interpretation are formalized as mutually independent equivalent transformation rules. Rule selection is dynamically determined flexibly during execution by a general principle independent of the domain of sentences.

Formalization of the Equivalent Transformation Computation Model

2006 ◽  
Vol 10 (3) ◽  
pp. 245-259 ◽  
Author(s):  
Kiyoshi Akama ◽  
◽  
Ekawit Nantajeewarawat ◽  
Keyword(s):  
Program Synthesis ◽  
Background Knowledge ◽  
Basic Structure ◽  
Equivalent Transformation ◽  
Computation Model ◽  
Problem Domain ◽  
Central Importance ◽  
Program Correctness ◽  
Transformation Rules ◽  
Successive Reduction

In the equivalent transformation (ET) computation model, a specification provides background knowledge in a problem domain and defines a set of queries of interest. A program is a set of prioritized transformation rules, and computation consists in successive reduction of queries using meaning-preserving transformation with respect to given background knowledge. We present a formalization of the ET model from the viewpoint of program synthesis, where not only computation but also program correctness and correctness relations are of central importance. The notion of program correctness defines “what it means for a program to be correct with respect to a specification,” and a correctness relation provides guidance on “how to obtain such a program.” The correctness relation of the ET model is established, based on which how the basic structure of the ET model facilitates program synthesis is discussed together with program synthesis strategies in this model.

scholarly journals Analysis of permutation equivalence in -adhesive transformation systems with negative application conditions

2014 ◽  
Vol 24 (4) ◽  
Author(s):  
FRANK HERMANN ◽  
ANDREA CORRADINI ◽  
HARTMUT EHRIG
Keyword(s):  
Equivalent Transformation ◽  
Reachability Graph ◽  
Transformation Rules ◽  
Transformation Sequence ◽  
Attributed Graphs ◽  
Deterministic Processes ◽  
High Level ◽  
Transformation Systems ◽  
Abstract Framework ◽  
Permutation Equivalent

$\mathcal{M}$-adhesive categories provide an abstract framework for a large variety of specification frameworks for modelling distributed and concurrent systems. They extend the well-known frameworks of adhesive and weak adhesive HLR categories and integrate high-level constructs such as attribution as in the case of typed attributed graphs.In the current paper, we investigate$\mathcal{M}$-adhesive transformation systems including negative application conditions (NACs) for transformation rules, which are often used in applications. For such systems, we propose an original equivalence on transformation sequences, calledpermutation equivalence, that is coarser than the classical switch equivalence. We also present a general construction of deterministic processes for$\mathcal{M}$-adhesive transformation systems based on subobject transformation systems. As a main result, we show that the process obtained from a transformation sequence identifies its equivalence class of permutation-equivalent transformation sequences. Moreover, we show how the analysis of this process can be reduced to the analysis of the reachability graph of a generated Place/Transition Petri net. This net encodes the dependencies between rule applications of the transformation sequence, including the inhibiting effects of the NACs.

Evaluation of the development ability of medical association based on evidential reasoning and prospect theory

2021 ◽  
pp. 1-18
Author(s):  
Tao Zhang ◽  
Shizheng Li ◽  
Jin Wang
Keyword(s):  
Prospect Theory ◽  
Comprehensive Evaluation ◽  
Risk Attitude ◽  
Decision Makers ◽  
Evidential Reasoning ◽  
Evaluation Index System ◽  
Evaluation Index ◽  
Equivalent Transformation ◽  
Qualitative And Quantitative ◽  
Quantitative Indexes

China has proposed medical couplet body to alleviate residents’ difficulties in seeking medical treatment, and the future development ability of medical couplet body has gradually become a research interest. On the basis of prospect theory, this study constructs a comprehensive evaluation index system with qualitative and quantitative indexes, clear hierarchy, and diverse attribute characteristics. The development ability of medical couplet body is also comprehensively and systematically evaluated. In addition, the evidential reasoning method is proposed on the basis of the equivalent transformation of prospect value. Furthermore, the validity and feasibility of the model are proven through experiments, and the influence of decision makers’ risk attitude on the evaluation results is discussed.

INSTANCE MIGRATION BETWEEN ONTOLOGIES HAVING STRUCTURAL DIFFERENCES

2011 ◽  
Vol 20 (06) ◽  
pp. 1127-1156 ◽  
Author(s):  
MAXIM DAVIDOVSKY ◽  
VADIM ERMOLAYEV ◽  
VYACHESLAV TOLOK
Keyword(s):  
Knowledge Management ◽  
Life Cycle ◽  
Structural Changes ◽  
Software Framework ◽  
Ontology Alignment ◽  
Transformation Rules ◽  
Structural Differences ◽  
Prototype Software ◽  
Descriptive Theories ◽  
Future Work

Ontology instance migration is one of the complex and not fully solved problems in knowledge management. A solution is required when the ontology schema evolves in the life cycle and the assertions have to be transferred to the newer version. The problem may become more complex in distributed settings when, for example, several autonomous software entities use and exchange partial assertional knowledge in a domain that is formalized by different though semantically overlapping descriptive theories. Such an exchange is essentially the migration of the assertional part of an ontology to other ontologies belonging to or used by different entities. The paper presents our method and tool for migrating instances between the ontologies that have structurally different but semantically overlapping schemas. The approach is based on the use of the manually coded transformation rules describing the changes between the input and the output ontologies. The tool is implemented as a plug-in for the ProjectNavigator prototype software framework. The article also reports the results of our three evaluation experiments. In these experiments we evaluated the degree of complexity in the structural changes to which our approach remains valid. We also chose the ontology sets in one of the experiments to make the results comparable with the ontology alignment software. Finally we checked how well our approach scales with the increase of the quantity of the migrated ontology instances to the numbers that are characteristic to industrial ontologies. In our opinion the evaluation results are satisfactory and suggest some directions for the future work.

Application of the Equivalent Transformation Layering Calculation Model in Heavy Cross-Section FGCs - Axis-Symmetrical Mechanics Problems

2005 ◽  
Vol 475-479 ◽  
pp. 1533-1536
Author(s):  
Liu Ding Tang ◽  
Xue Bin Zhang ◽  
Bing Zhe Li
Keyword(s):  
Mechanical Properties ◽  
Cross Section ◽  
Calculation Model ◽  
Functionally Graded ◽  
Equivalent Transformation ◽  
Metal Tube ◽  
Cross Sectional ◽  
Functionally Graded Composites ◽  
Graded Structure ◽  
Design And Practice

Based on equivalent transformation by means of mathematically rigorous analytics, the stress analysis of heavy cross-sectional, non-homogeneous Functionally Graded Composites (FGCs) has been performed by the layering calculation model in axis-symmetrical mechanics problems. The partially calculated results of the non-homogeneous layered thick-walled metal tube are similar to the design and practice of machine forging moulds manufactured with special welding electrodes developed by the German Capilla Company. The analysis is used complementary to the investigation of the quantitative analysis of thermo-mechanical properties, or the so-called anti-design and the optimization of the graded structure for FGCs.

Sign in / Sign up

Export Citation Format

Share Document