The Experts below are selected from a list of 318 Experts worldwide ranked by ideXlab platform

Zeshui Xu - One of the best experts on this subject based on the ideXlab platform.

  • novel basic operational laws for linguistic terms hesitant fuzzy linguistic term sets and probabilistic linguistic term sets
    Information Sciences, 2016
    Co-Authors: Zeshui Xu
    Abstract:

    In the process of decision making, people sometimes may feel more comfortable to express their preferences by linguistic terms instead of the quantitative form. However, as the basic premise of operations, the existing operational laws of linguistic terms and the extended linguistic term sets are very unreasonable. In order to overcome this issue, in this paper, we redefine some more logical operational laws for linguistic terms, hesitant fuzzy linguistic elements (HFLEs) and probabilistic linguistic term sets (PLTSs) based on two Equivalent Transformation functions. These novel operational laws can not only avoid the operation values exceeding the bounds of LTSs, but also keep the operation results more reasonable in decision making with linguistic information. Furthermore, the operational laws can keep the probability information complete when computing with PLTSs. Additionally, lots of properties of the operational laws are discussed, and some three-dimensional figures are drawn to show the regions of different operational laws of linguistic terms more vividly.

  • novel basic operational laws for linguistic terms hesitant fuzzy linguistic term sets and probabilistic linguistic term sets
    Information Sciences, 2016
    Co-Authors: Zeshui Xu
    Abstract:

    In the process of decision making, people sometimes may feel more comfortable to express their preferences by linguistic terms instead of the quantitative form. However, as the basic premise of operations, the existing operational laws of linguistic terms and the extended linguistic term sets are very unreasonable. In order to overcome this issue, in this paper, we redefine some more logical operational laws for linguistic terms, hesitant fuzzy linguistic elements (HFLEs) and probabilistic linguistic term sets (PLTSs) based on two Equivalent Transformation functions. These novel operational laws can not only avoid the operation values exceeding the bounds of LTSs, but also keep the operation results more reasonable in decision making with linguistic information. Furthermore, the operational laws can keep the probability information complete when computing with PLTSs. Additionally, lots of properties of the operational laws are discussed, and some three-dimensional figures are drawn to show the regions of different operational laws of linguistic terms more vividly.

Kiyoshi Akama - One of the best experts on this subject based on the ideXlab platform.

  • Constructing Web Service in Equivalent Transformation Programming Language
    2016
    Co-Authors: Zheng Cheng, Katsunori Katou, Kiyoshi Akama
    Abstract:

    Abstract:- research on the Web Services has rapidly developed in recent years. A Web Service is a technology that makes the distributed applications on a network cooperate by using the standard technology of the Internet compared with the Web site. It transforms the methods and the data tendered to it from WSDL into a utilizable class, an mutual Transformation of data and communication processing with the server are processed by programming done in a traditional language (C#, Java, and Perl, etc.). Here however, we examine the construction of the Web Service based on ET (Equivalent Transformation)

  • function variable elimination and its limitations
    International Joint Conference on Knowledge Discovery Knowledge Engineering and Knowledge Management, 2015
    Co-Authors: Kiyoshi Akama, Ekawit Nantajeewarawat
    Abstract:

    The famous proof method by the conventional Skolemization and resolution has a serious limitation. It does not guarantee the correctness of proving theorems in the presence of built-in constraints. In order to understand this difficulty, we use meaning-preserving Skolemization (MPS) and Equivalent Transformation (ET), which together provide a general framework for solving query-answering (QA) problems on first-order logic. We introduce a rule for function variable elimination (FVE), by which we regard the conventional Skolemization as a kind of the composition of MPS and FVE. We prove that the FVE rule preserves the answers to a class of QA problems consisting of only user-defined atoms, while we cannot prove it in the presence of built-in constraints. By avoiding the application of the FVE rule in MPS & ET computation, we obtain a more general solution for proof problems, which guarantees the correctness of computation even in the presence of built-in constraints.

  • a general schema for solving model intersection problems on a specialization system by Equivalent Transformation
    International Joint Conference on Knowledge Discovery Knowledge Engineering and Knowledge Management, 2015
    Co-Authors: Kiyoshi Akama, Ekawit Nantajeewarawat
    Abstract:

    A model-intersection problem (MI problem) is a pair of a set of clauses and an exit mapping. We define MI problems on specialization systems, which include many useful classes of logical problems, such as proof problems on first-order logic and query-answering (QA) problems in pure Prolog and deductive databases. The theory presented in this paper makes clear the central and fundamental structure of representation and computation for many classes of logical problems by (i) axiomatization and (ii) Equivalent Transformation. Clauses in this theory are constructed based on abstract atoms and abstract operation on them, which can be used for representation of many specific subclasses of problems with concrete syntax. Various computation can be realized by repeated application of many Equivalent Transformation rules, allowing many possible computation procedures, for instance, computation procedures based on resolution and unfolding. This theory can also be useful for inventing solutions for new classes of logical problems.

  • model intersection problems and their solution schema based on Equivalent Transformation
    International Joint Conference on Knowledge Discovery Knowledge Engineering and Knowledge Management, 2015
    Co-Authors: Kiyoshi Akama, Ekawit Nantajeewarawat
    Abstract:

    Model-intersection (MI) problems are a very large class of logical problems that includes many useful problem classes, such as proof problems on first-order logic and query-answering (QA) problems in pure Prolog and deductive databases. We propose a general schema for solving MI problems by Equivalent Transformation (ET), where problems are solved by repeated simplification. The correctness of this solution schema is shown. This general schema is specialized for formalizing solution schemas for QA problems and proof problems. The notion of a target mapping is introduced for generation of ET rules, allowing many possible computation procedures, for instance, computation procedures based on resolution and unfolding. This theory is useful for inventing solutions for many classes of logical problems.

  • Equivalent Transformation in an extended space for solving query answering problems
    Asian Conference on Intelligent Information and Database Systems, 2014
    Co-Authors: Kiyoshi Akama, Ekawit Nantajeewarawat
    Abstract:

    A query-answering problem QA problem is concerned with finding all ground instances of a query atomic formula that are logical consequences of a given logical formula describing the background knowledge of the problem. Based on the Equivalent Transformation ET principle, we propose a general framework for solving QA problems on first-order logic. To solve such a QA problem, the first-order formula representing its background knowledge is converted by meaning-preserving Skolemization into a set of clauses typically containing global existential quantifications of function variables. The obtained clause set is then transformed successively using ET rules until the answer set of the original problem can be readily derived. Many ET rules are demonstrated, including rules for unfolding clauses, for resolution, for dealing with function variables, and for erasing independent satisfiable atomic formulas. Application of the proposed framework is illustrated.

Hiroshi Mabuchi - One of the best experts on this subject based on the ideXlab platform.

  • a debugging algorithm in Equivalent Transformation model using oracle rules
    International Conference on Innovative Computing Information and Control, 2009
    Co-Authors: Shinya Miyajima, Kiyoshi Akama, Hiroshi Mabuchi
    Abstract:

    A debugging algorithm in Equivalent Transformation model is proposed. The proposed algorithm returns a bug rule in a program by receiving new rules from oracles (oracle rules). We construct a theory about correctness of the proposed algorithm. Moreover we present two strategies for selecting a part of computational states which an oracle rule transforms.

  • detecting incorrect rules automatically in Equivalent Transformation programs
    International Conference on Innovative Computing Information and Control, 2007
    Co-Authors: Shinya Miyajima, Kiyoshi Akama, Hiroshi Mabuchi, Yuya Wakamatsu
    Abstract:

    In the Equivalent Transformation computation model, a program (called an ET program) is a set of rules for meaning-preserving Transformation of problems. In this paper we propose a method for automatically detecting incorrect rules in a given ET program.

  • Equivalent Transformation rules as components of programs
    International Conference on Innovative Computing Information and Control, 2006
    Co-Authors: Hiroshi Mabuchi, Kiyoshi Akama, T Wakatsuki
    Abstract:

    Based on the Equivalent Transformation ( ET ) computation model, where computation is regarded as ET of problem descriptions and a program consists of many ET rules, we discuss how to regard ET rules as components of programs and how to define specifications of ET rules in order to guarantee correct and wide applicability of components.

  • a theoretical foundation of program synthesis by Equivalent Transformation
    International Andrei Ershov Memorial Conference on Perspectives of System Informatics, 2001
    Co-Authors: Kiyoshi Akama, Hidekatsu Koike, Hiroshi Mabuchi
    Abstract:

    Equivalent Transformation (ET) is useful for synthesis and Transformation of programs. However, it is not so clear what semantics should be preserved in synthesis and Transformation of programs in logic and functional programming, which come from the disagreement of computation models (inference or evaluation) and Equivalent Transformation. To overcome the difficulty, we adopt a new computation model, called Equivalent Transformation model, where Equivalent Transformation is used not only for program synthesis, but also for computation. We develop a simple and general foundation for computation and program synthesis, and prove the correctness ofET-based program synthesis.

  • Equivalent Transformation by safe extension of data structures
    International Andrei Ershov Memorial Conference on Perspectives of System Informatics, 2001
    Co-Authors: Kiyoshi Akama, H Koike, Hiroshi Mabuchi
    Abstract:

    Equivalent Transformation has been proposed as a methodology for providing programs with appropriate data structures. For instance, logic programs which use lists are transformed into Equivalent programs that use difference-lists. However lists and difference-lists are both usual terms and in this sense no new data structures are introduced in the Transformation. Since logic programming has fixed data structure called terms, no one can develop theoretical foundations for introducing new data structures into programs as far as only logic programs are discussed. In this paper we develop a theoretical foundation of Equivalent Transformation that introduces new data structures. We introduce a parameter G for data structures, by which many languages with different data structures are characterized. By changing this parameter (say from G1 to G2) we can discuss data structure change for programs. We define a concept ofsaf e extension ofdata structures, and prove that the meaning ofa program on a data structure is preserved by safe extension of the data structure.

Christian Lexcellent - One of the best experts on this subject based on the ideXlab platform.

  • Equivalent Transformation strain and its relation with martensite volume fraction for isotropic and anisotropic shape memory alloys
    Mechanics of Materials, 2008
    Co-Authors: Karine Taillard, Sylvain Calloch, Arbab S Chirani, Christian Lexcellent
    Abstract:

    The present paper deals with the superelastic behavior of both isotropic and anisotropic shape memory alloys (SMA). Recently, a macroscopic model, which permits to simulate the superelasticity of SMA under complex multi-axial loading, has been proposed by Bouvet et al. [Bouvet, C., Calloch, S., Lexcellent, C., 2004. A phenomenological model for pseudoelasticity of shape memory alloys under multi-axial proportional and non-proportional loadings. Eur. J. Mech. A Solids 23, 37-61]. In this model, a conjecture concerning the proportionality of the Equivalent Transformation strain with the martensite volume fraction has been adopted. The main goal of this study is to show the validity of this conjecture when the stress state is multi-axial. In a first part, the case of isotropic SMA is considered. An Equivalent stress and an Equivalent Transformation strain are introduced. In the second section, the case of anisotropic SMA is considered. The previous Equivalent stress and Equivalent Transformation strain are generalized to take into account the anisotropy of the material. The relation between the Equivalent Transformation strain and the martensite volume fraction is discussed by using, on one hand, experimental results under proportional tension-torsion loadings and, on the other hand, a polycrystalline model.

  • relation between martensite volume fraction and Equivalent Transformation strain in an anisotropic cuaibe shape memory alloy
    The 14th International Symposium on: Smart Structures and Materials & Nondestructive Evaluation and Health Monitoring, 2007
    Co-Authors: Karine Taillard, Sylvain Calloch, Shabnam Arbab Chirani, Christian Lexcellent
    Abstract:

    This study concerns the pseudoelasticity of Shape Memory Alloys (SMA). A series of tests under tension-compression-torsion multiaxial loadings is used to show the validity of a conjecture concerning the relation between the volume fraction of martensite and the Equivalent Transformation strain. It is shown that the proportionality between an ad doc Equivalent Transformation strain and the volume fraction of martensite is confirmed under multiaxial proportional and nonproportional loadings.

  • relation between the martensite volume fraction and the Equivalent Transformation strain in shape memory alloys
    Materials Science and Engineering A-structural Materials Properties Microstructure and Processing, 2006
    Co-Authors: Sylvain Calloch, Karine Taillard, Arbab S Chirani, Christian Lexcellent, E Patoor
    Abstract:

    This study concerns the pseudoelasticity of shape memory alloys. A series of tests under multiaxial loadings and a micro-macro model are used to show the validity of a conjecture concerning the relation between the volume fraction of martensite and the Equivalent Transformation strain.

Hidekatsu Koike - One of the best experts on this subject based on the ideXlab platform.

  • program generation in the Equivalent Transformation computation model using the squeeze method
    International Andrei Ershov Memorial Conference on Perspectives of System Informatics, 2006
    Co-Authors: Kiyoshi Akama, Ekawit Nantajeewarawat, Hidekatsu Koike
    Abstract:

    In the Equivalent Transformation (ET) computation model, a specification provides background knowledge in a problem domain, a program is a set of prioritized rewriting rules, and computation consists in successive reduction of problems by rule application. As long as meaning-preserving rewriting rules, called ET rules, with respect to given background knowledge are used, correct computation results are guaranteed. In this paper, a general framework for program synthesis in the ET model is described. The framework comprises two main phases: (1) Equivalent Transformation of specifications, and (2) generation of a program from an obtained specification. A method for program generation in the second phase, called the squeeze method, is presented. It constructs a program by accumulation of ET rules one by one on demand, with the goal of producing a correct, efficient, and nonredundant program.

  • Program synthesis based on the Equivalent Transformation computation model
    Lecture Notes in Computer Science, 2003
    Co-Authors: Kiyoshi Akama, Ekawit Nantajeewarawat, Hidekatsu Koike
    Abstract:

    Effective generation of efficient and correct programs from specifications is the underlying design motivation of the Equivalent Transformation (ET) computation model. This concise paper explains how the ET model satisfies major required features of a program synthesis framework, and outlines a three-phase program synthesis method.

  • a theoretical foundation of program synthesis by Equivalent Transformation
    International Andrei Ershov Memorial Conference on Perspectives of System Informatics, 2001
    Co-Authors: Kiyoshi Akama, Hidekatsu Koike, Hiroshi Mabuchi
    Abstract:

    Equivalent Transformation (ET) is useful for synthesis and Transformation of programs. However, it is not so clear what semantics should be preserved in synthesis and Transformation of programs in logic and functional programming, which come from the disagreement of computation models (inference or evaluation) and Equivalent Transformation. To overcome the difficulty, we adopt a new computation model, called Equivalent Transformation model, where Equivalent Transformation is used not only for program synthesis, but also for computation. We develop a simple and general foundation for computation and program synthesis, and prove the correctness ofET-based program synthesis.