Rewrite techniques can be used to execute logic programs in order to avoid some drawbacks of classical Prolog resolution. Logic programs are represented as rewrite programs whose operational mechanism, inspired from Knuth-Bendix completion, allows to prune some unnecessary computations and ooers a synthesis ability which enables to represent innnite sets of answers as nite sets of formulas. We ...

Convergence hypothesis is one of the results of neoclassical growth model, which has been examined recently. This hypothesis has two forms of absolute and conditional Beta-convergence and implies that regions with lower per capita output have higher per capita growth rates. Since there is no data for regional GDP in Iran, there has been n study to test convergence hypothesis in Iran. Our main c...

K is a definitional framework based on term rewriting, in which programming languages, calculi, as well as type systems or formal analysis tools can be defined making use of special list and/or set structures, called cells, which can be potentially nested. In addition to cells, K definitions contain equations capturing structural equivalences that do not count as computational steps, and rewrit...

The declarative modeling of workflows has been introduced to cope with flexibility in processes. Its rationale is based on the idea of stating some basic rules (named constraints), tying the execution of some activities to the enabling, requiring or disabling of other activities. What is not explicitly prohibited by such constraints is implicitly considered legal, w.r.t. the specification of th...

Considerable planning and learning research has been devoted to the problem of learning domain specific search control rules to improve planning efficiency. There have also been a few attempts to learn search control rules that improve plan quality but such efforts have been limited to state-space planners. The reason being that most of the newer planning approaches are based on plan refinement...