the design and application of a fuzzy logic based controller to a leakage current relay waspresented in this paper. a novel approach based on fuzzy logic to form the tripping action of leakagecurrent relay was investigated. in addition to the theoretical aspect of fuzzy logic, detection of a leakagecurrent, measurement of the leakage current, determination of its duration, trip opening of fault...

New trends and the effect of key factors influence the quality of the holes produced by ECM processes. Researchers developed a fuzzy logic controller by adding intelligence to the ECM process. Maintaining optimum ECM process conditions ensures higher machining efficiency and performance. This paper presents the development of a fuzzy logic controller to add intelligence to the ECM process. An e...

> We present here a depth-bounded bottom-up evaluation algorithm for logic programs. We show that it is sound, complete, and terminating for nite-answer queries if the programs are syntactically restricted to Datalog nS , a class of logic programs with limited function symbols. Datalog nS is an extension of Datalog capable of representing innnite phenomena. Predicates in Datalog nS can have arb...

Several program transformations|magic sets, envelopes, NRSU transformations and context transformations, among others|have been proposed for eeciently computing the answers to a query while taking advantage of the query constants. These transformations use sideways information passing strategies (sips) to restrict bottom-up evaluation to facts potentially relevant to the query. It is of interes...

Logic programs can be evaluated bottom-up by repeatedly applying all rules, in “iterations”, until the fixpoint is reached. However, it is often desirable — and in some cases, e.g. programs with stratified negation, even necessary to guarantee the semantics — to apply the rules in some order. An important property of a fixpoint evaluation algorithm is that it does not repeat inferences; we say ...

This paper presents an algorithm that combines traditional EBL techniques and recent developments in inductive logic programming to learn e ective clause selection rules for Prolog programs. When these control rules are incorporated into the original program, signi cant speed-up may be achieved. The algorithm is shown to be an improvement over competing EBL approaches in several domains. Additi...

Over the years the constraint-based method has been successfully applied to a wide range of problems in program analysis, from invariant generation to termination and non-termination proving. Quite often the semantics of the program under study as well as the properties to be generated belong to difference logic, i.e., the fragment of linear arithmetic where atoms are inequalities of the form u...

In this paper, we develop a solid theoretical foundation for a bottom up program transformation, capable of specialising a logic program with respect to a set of unit clauses. Extending a well-known operator , originally introduced for composing logic programs, we deene a bottom up partial deduction operator and prove correctness of the transformation with respect to the S-semantics. We also sh...

This paper presents an algorithm that combines traditional EBL techniques and recent developments in inductive logic programming to learn e ective clause selection rules for Prolog programs. When these control rules are incorporated into the original program, signi cant speed-up may be achieved. The algorithm produces not only EBL-like speed up of problem solvers, but is capable of automaticall...