In the eld of program synthesis inductive existence proofs are used to compute algorithmic deenitions for the skolem functions under consideration. While in general the recursion orderings of the given function deenitions form the induction ordering this approach often fail for existence proofs. In many cases a completely new induction ordering has to be invented to prove an existence formula. ...

Inductive game theory captures how a player inductively derives his/her personal views from experiences. The player may have multiple views, some of which differ from the objective situation, but may revise them with further experiences. This paper gives a logical formulation of this revision process by focusing on the role of player’s beliefs. For this objective, we take the AGM approach of be...

Object-Oriented Design Patterns (OODPs) have been proposed as a technique to encapsulate design experience and aid in design reuse. However, so far, there is very little empirical evidence about what we can expect from this emergent technology. For instance, to date little research has focused on the development of techniques for discovering workable patterns that can be captured, formalized, p...

background: date (phoenix dactylifera l.) is one of the most important agricultural crops in iran. this study was carried out to determine the possibility of using date paste for manufacturing a new ready-to-eat food product. methods: various formulations were prepared by mixing mazafati date paste, bread, oil (animal and olive), nuts and spices but only six formulas were chosen according to se...

superconductor fault current limiter (sfcl) is an effective device to suppress high fault currents. this paper presents a comparative study of resistive and inductive fault current limiters from transient stability point of view.  appropriate location and type of the limiters in a hv substation is selected by a qualitative approach based on the equal area criterion. study system is simulated by...

A method using quantifier-elimination is proposed for automatically generating program invariants/inductive assertions. Given a program, inductive assertions, hypothesized as parameterized formulas in a theory, are associated with program locations. Parameters in inductive assertions are discovered by generating constraints on parameters by ensuring that an inductive assertion is indeed preserv...

Approximating a general formula from above and below by Horn formulas (its Horn envelope and Horn core, respectively) was proposed by Selman and Kautz (1991, 1996) as a form of \knowledge compilation," supporting rapid approximate reasoning; on the negative side, this scheme is static in that it supports no updates, and has certain complexity drawbacks pointed out by Kavvadias, Papadimitriou an...

The article discusses modeling procedures to capture the physical and chemical processes present in operational measurement with a high-precision inductive flowmeter. In this context, theoretical model numerical solution are proposed. Exploiting combined finite element method (FEM) volume (FVM), we prepared models of multiple variants flowmeter computed output voltage on device's electrodes. jo...

Inductive reasoning is an important way to generate knowledge from the propositions reflecting facts or directly from data We intend to extract new knowledge in the form of definitions given as fixed point equations. An appropriate fixed point theory is outlined in favour of our aim. This theory suggests the so called generative fixed point equation system as the form of hypothesis that we are ...