We apply the methodology of domain refinement to systematically derive domains for type analysis. Domains are built by iterative application of the Heyting completion operator to a given set of basic types. We give a ...
详细信息
We show that Jacobs and Langen’s domain for set-sharing analysis is isomorphic to the domain of positive Boolean functions, introduced by Marriott and Søndergaard for groundness dependency analysis. Viewing a se...
详细信息
the proceedings contain 18 papers. the special focus in this conference is on Functional and logicprogramming. the topics include: Safe folding/unfolding with conditional narrowing;optimal non-deterministic functiona...
ISBN:
(纸本)3540634592
the proceedings contain 18 papers. the special focus in this conference is on Functional and logicprogramming. the topics include: Safe folding/unfolding with conditional narrowing;optimal non-deterministic functional logic computations;a semantic basis for termination analysis of logic programs and its realization using symbolic norm constraints;parallelizing functional programs by generalization;higher-order equational unification via explicit substitutions;parameterised higher-order algebraic specifications;a computation model for a higher-order functional logic language;on composable properties of term rewriting systems;needed reductions with context-sensitive rewriting;conditional term graph rewriting;lazy narrowing with parametric order sorted types;termination of algebraic type systems;proof net semantics of proof search computation;perpetuality and uniform normalization;model generation with existentially quantified variables and constraints and optimal left-to-right pattern-matching automata.
Ladder Diagrams(LD) have been widely used in industries as a programming language for PCs. However, the LD can not represent sequential flows of control logic explicitly. On the other hand as the Sequential Function C...
详细信息
ISBN:
(纸本)0780341929
Ladder Diagrams(LD) have been widely used in industries as a programming language for PCs. However, the LD can not represent sequential flows of control logic explicitly. On the other hand as the Sequential Function Chart(SFC) can explicitly represent the sequential flow in the control logic, the SFC is expected to be used more widely than the LD. Because many know-how with respect to sequential controls have been accumlated in the LD of the existing systems, for the promotion of SFC, it is preferable to develop transformation technique from the LD to the SFC. In this paper, first we suggest the necessity of the modeling of control plants for the LD transformation into the SFC using a conceptual example. Secondly we proposed a new algebraic analysis method that transforms the state equations of the total system into simultaneous linear inequalities whose solution can be sought with linear programming techniques.
this paper presents a new discrete control modeling technique for automated industrial systems. the proposed methodology helps to smooththe transition from specification to implementation. the technique is based on a...
详细信息
ISBN:
(纸本)0898061776
this paper presents a new discrete control modeling technique for automated industrial systems. the proposed methodology helps to smooththe transition from specification to implementation. the technique is based on a graphical representation (Y net) that efficiently describes the operation of Programmable logic Controllers (PLCs), the technique offers a structured way for constructing Y nets. Although Y net can be translated into any PLC language, we chose to present an automatic translation algorithm of Y net into Ladder Diagrams (LDs)-the most prevalent PLG language. the compactness of Y nets gives them an advantage over models that experience exponential explosion (e.g., slate diagrams). A large part of the method can be automated. Minimum specification is required from the user, and boththe Y net and the ladder diagram can be built automatically using the proposed algorithms.
In this research Genetic programming is applied to the synthesis of arbitrary logic expressions. As a new method of logic synthesis, this technique is uniquely advantageous in its flexibility for both problem applicab...
详细信息
In this research Genetic programming is applied to the synthesis of arbitrary logic expressions. As a new method of logic synthesis, this technique is uniquely advantageous in its flexibility for both problem applicability and optimization criterion. A number of experiments were conducted exploring this method with different types of logic gates and population sizes. While complete function coverage is not guaranteed, the best experimental test results over eight randomly designed functions, of four to seven input variables, have produced logic equations with a 98.4% function coverage. In addition, the relation between the training set size for the Genetic Program and function coverage was also empirically explored. these experiments showed that only small training sets were necessary for function recognition.
We show that non-determinism simplifies coding certain problems into programs. We define a non-confluent, but well-behaved class of rewrite systems for supporting non-deterministic computations in functional logic pro...
详细信息
in this paper a learning system is presented which integrates an ECG waveform classifier (called PECG) with an interactive learner (called IMPUT). the PECG system is based on an attribute grammar specification of ECGs...
详细信息
ISBN:
(纸本)354062709X
in this paper a learning system is presented which integrates an ECG waveform classifier (called PECG) with an interactive learner (called IMPUT). the PECG system is based on an attribute grammar specification of ECGs that has been transformed to Prolog. the IMPUT system combines the interactive debugging technique IDT withthe unfolding algorithm introduced in SPECTRE. Using the IMPUT system we can effectively assist in preparing the correct description of the basic structures of ECG waveforms.(4)
In this paper we present the CPUHR-tableau calculus, a modification of positive unit hyperresolution (PURR) tableaux, the calculus underlying the model generator and theorem prover Satchmo. In addition to clausal firs...
详细信息
暂无评论