Abstract Logic programming is a flexible paradigm due to the use of predicates without fixed data flow. To extend logic languages with compact notation functional programming, there are various proposals map evaluable functions into in order stay framework. Since amalgamated offer as well efficient evaluation strategies, we propose an opposite approach this paper. By mapping programs transforma...

in this article, a speed control of dc motor is designed and illustrated using fuzzy logic-based programmable logic controller (plc). the dc motor is an attractive part of electrical equipment in many industrial applications requiring variable speed and load specifications due to its ease of controllability. the designed system is consisted of three main parts including programmable logic contr...

A novel and simple combination of inductive logic programming with kernel methods is presented. The kFOIL algorithm integrates the well-known inductive logic programming system FOIL with kernel methods. The feature space is constructed by leveraging FOIL search for a set of relevant clauses. The search is driven by the performance obtained by a support vector machine based on the resulting kern...

For a cardinal of the form κ = בκ, Shelah’s logic L 1 has characterisation as maximal above $${ \cup _{\lambda < \kappa }}{L_{\lambda ,\omega }}$$ satisfying strengthening undefinability well-order. Karp’s chain [20] is known to satisfy well-order and interpolation. We prove that if singular countable cofinality, . Moreover, we show strong limit cardinals $$L_{ , }^c{ }}L_{\lambda ,\lambda }^c$...

Abstract We show that intuitionistic logic is deductively equivalent to Connexive Heyting Logic ( $$\textrm{CHL}$$ CHL ), hereby introduced as an example of a strongly connexive with intuitive semantics. use the reverse algebraisation paradigm: presented assertional point regular variety (whose structur...