This article presents a taxonomy of strategies for fully-automated general-purpose first-order theorem proving. It covers forwardreasoning ordering-based strategies and backward-reasoning subgoal-reduction strategies, which do not appear together often. Unlike traditional presentations that emphasize logical inferences, this classification strives to give equal weight to the inference and searc...

bounded scope dialogue with the user in order to collect his suggestions about the structure and content of the texts to be su~mmrized, and his requirements on the summary to be generated. This information is embedded in two different frameworks called working_ text schema and working summmar~, schema which contain the user's suggestions and requirements, respectively. The schemas will constitu...

I introduce axiomatically infinite sequential games that extend von Neumann and Kuhn’s classic axiomatic frameworks. Within this setup, I define a modified backward induction procedure that is applicable to all games. A strategy profile that survives backward pruning is called a backward induction equilibrium (BIE). The main result compares the sets of BIE and subgame perfect equilibria (SPE). ...

we derive error estimates in the appropriate norms, for the streamlinediffusion (sd) finite element methods for steady state, energy dependent,fermi equation in three space dimensions. these estimates yield optimal convergencerates due to the maximal available regularity of the exact solution.high order sd method together with implicit integration are used. the formulationis strongly consistent...

The invariant mass spectrum, forward-backward asymmetry, and lepton longitude polarization of the exclusive processes B → K(K)ll, l = μ, τ are analyzed under supersymmetric context. Special attention is given to the effects of neutral Higgs bosons. Our analysis shows that for the process B → Kμμ, the branching ratio can be quite largely modified by the effects neutral Higgs bosons and the forwa...

We study the pruning process developed by Abraham and Delmas (2012) on the discrete Galton-Watson sub-trees of the Lévy tree which are obtained by considering the minimal sub-tree connecting the root and leaves chosen uniformly at rate λ, see Duquesne and Le Gall (2002). The tree-valued process, as λ increases, has been studied by Duquesne and Winkel (2007). Notice that we have a tree-valued pr...

In this study, the performance of a centrifugal pump is investigated by adding polyacrylamide (PAM) polymer over the working fluid which is tap water in this case. PAM is a long chain polymer that leads to reduce the wall shear stress and drag in a turbulent fluid. Three different blade profiles including radial, straight backward and circular backward have been examined. For this purpose, a ce...

Previous studies of the stability of the second-order backward differentiation formula have concluded that stability is possible only if restrictions are placed on the stepsize ratios, for example, limiting the ratio to some value less than 1 + fi. However, actual implementations of the BDFs differ from the usual theoretical models of such methods; in particular, practical codes use scaled deri...

This paper will discuss how the backward design process (Wiggins & McTighe, 2005) was applied to develop a quality management course for adult learners. Although the backward design process was developed for use by elementary and secondary teachers, this alternative design methodology compliments the special requirements of adult learners by maximizing learning and understanding. Increased unde...

Forward chaining is a popular strategy for solving classical planning problems and a number of recent successful planners exploit it. To succeed, a forward chaining algorithm must carefully select its next action. In this paper, we introduce a forward chaining algorithm that selects its next action using heuristics that combine backward regression and goal ordering techniques. Backward regressi...